Submission #7071557

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
const int MOD = 1000000007;

int main() {
    string s;
    int k;
    cin >> s >> k;
    int n = s.size();
    REP(i, n - 1) {
        if (k == 0) break;
        int d = (('z' - s[i]) + 1) % 26;
        if (d > k) continue;
        s[i] = 'a';
        k -= d;
    }
    if (k > 0) {
        k %= 26;
        if (s[n - 1] + k > 'z') {
            s[n - 1] += k - 26;
        } else {
            s[n - 1] += k;
        }
    }
  
    cout << s << endl;
}

Submission Info

Judge Result