Submission #897116

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <cstdlib>
#define INF 100000000
#define _INF -100000000
#define INFLL (long long)1e14
#define _INFLL (long long)-1e14
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#define Loop1(i, n) for(int i = 1; i <= (int)n; i++)
#define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = (int)n; i >= 1; i--)
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> P;
 
char advance(char c, int x) {
	c = c - 26 + x;
	if (c < 'a') c += 26;
	return c;
}

int main() {
	string s; cin >> s;
	int k; cin >> k;
	Loop(i, s.length()) {
		if (i == s.length() - 1) {
			s[i] = advance(s[i], k % 26);
		}
		else {
			if (s[i] == 'a') continue;
			int x = 'z' + 1 - s[i];
			if (k >= x) {
				s[i] = advance(s[i], x);
				k -= x;
			}
		}
	}
	cout << s << endl;
	return 0;
}

Submission Info

Judge Result