Submission #2162552

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64,i64> P;
#define rep(i,s,e) for(int i = (s);i <= (e);i++)

string s;
int k;

int next(char c)
{
    if(c == 'a') return 0;
    return ('z' - c + 1);
}

string str = "";

int main()
{
    for(char c = 'a';c <= 'z';c++)
    {
        str += c;
    }
    cin >> s >> k;

    rep(i,0,s.size() - 1)
    {
        int n = next(s[i]);
        if(n <= k)
        {
            s[i] = 'a';
            k -= n;
        }
    }

    k += s.back() -'a';

    s.back() = str[k % str.size()];

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

Submission Info

Judge Result