Submission #891409

---

Source Code Expand

#include <sstream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cassert>
#include <ctime>
#include <map>
#include <math.h>
#include <cstdio>
#include <set>
#include <deque>
#include <memory.h>
#include <queue>

#pragma comment(linker, "/STACK:64000000")
typedef long long ll;

using namespace std;

const int MAXN = 1 << 18;
const int MOD = 1; // 1000 * 1000 * 1000 + 7;
const int INF = 2e9;

int main() {
#ifdef _MSC_VER
	freopen("input.txt", "r", stdin);
#endif

	string s;
	int k;
	while (cin >> s >> k) {
		int n = s.length();
		for (int i = 0; i < n; i++) {
			int need = 'z' - s[i] + 1;
			if (need == 26) need = 0;
			if (need <= k) {
				s[i] = 'a';
				k -= need;
			}
		}

		s[n - 1] = 'a' + (s[n - 1] - 'a' + k) % 26;
		cout << s << endl;
	}

	return 0;
}

Submission Info

Judge Result