Submission #2200243

---

Source Code Expand

#include <iostream>
#include <string>
using namespace std;

typedef long long lint;

int main(){
    string s;
    lint K;
    cin >> s >> K;
    for(int i=0;i<s.size();i++){
        if('z'-s[i]+1<=K){
            K-='z'-s[i]+1;
            s[i]='a';
        }
    }
    K%=26;
    lint l=s[s.size()-1]-'a';
    l=(l+K)%26;
    s[s.size()-1]='a'+l;

    cout << s << endl;
    return 0;
}//

Submission Info

Judge Result