Submission #1697130

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"

using namespace std;

const long long int MOD = 1000000007;

long long int N, M, K, H, W, L, R;


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

	string s;
	cin >> s;
	cin >> N;
	M = s.size();
	K = 0;
	while (N) {
		if (N + s[K] - 'a' < 26) {
			K++;
			if (K == M)break;
			continue;
		}
		else {
			N -= 26 - (s[K] - 'a');
			s[K] = 'a';
		}
		K++;
		if (K == M)break;
	}
	s[M - 1] = char('a' + ((s[M-1] - 'a' + N)) % 26);
	cout << s << endl;
	return 0;
}

Submission Info

Judge Result