Submission #2704553

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<stack>
#include<set>
#include<climits>
#include<cstdlib>
#include<cmath>
#include<string>

using namespace std;

#define INF 1 << 29
#define LL long long int

LL const MOD = 1000000007;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    string str;
    cin >> str;

    LL k;
    cin >> k;

    for(int i = 0; i < str.size(); i++){
        if(str[i] == 'a'){
            continue;
        }

        LL t = (LL)('z' - str[i]) + 1;
        if(t <= k){
            k -= t;
            str[i] = 'a';
        }
    }

    if(k > 0){
        LL x = k%26;
        char tmp = str[str.size()-1];
        for(int i = 0; i < k; i++){
            tmp++;
            if(tmp > 'z'){
                tmp = 'a';
            }
        }
        str[str.size()-1] = tmp;
    }

    cout << str << endl;

    return 0;
}

Submission Info

Judge Result