Submission #891303

---

Source Code Expand

#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define li long long
#define itn int

using namespace std;

inline int nxt(){
	int n;
	scanf("%d", &n);
	return n;
}

int main(){

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

	cout << s << "\n";

	return 0;
}

Submission Info

Judge Result