Submission #3772230

---

Source Code Expand

#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>

typedef  long long ll;
#define mop 1000000007
using namespace std;

int main() {
   
    ll k;
    string s;
    cin >> s >> k;
    while(k>0){
        for (ll i=0;i<s.length();i++){
            if (s[i] == 'a' and i != s.length()-1){
                continue;
            }
            if(26 - (s[i] - 'a') <= k){
                k -= (26 - (s[i] - 'a'));
                s[i] = 'a';
            }else if (i == s.length()-1){
                if(k > (26 - (s[i] - 'a'))) {
                    s[i] = ((k - (26 - (s[i] - 'a'))) % 26) + 'a';
                    k = 0;
                }else{
                    s[i] += k;
                    k = 0;
                }
            }
        }
    }

    cout << s << endl;
}

Submission Info

Judge Result