Submission #1501179

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<complex>

#define INF (long long)1000000000
#define MOD 1000000007
#define EPS 1e-8

#define REP(i, m) for(long long i = 0; i < m; ++i)
#define FOR(i, n, m) for(long long i = n; i < m; ++i)
#define ALL(v) v.begin(), v.end()
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

int main() {
	string s;
	cin>>s;
	int k;
	cin>>k;
	REP(i,s.size()) {
		if(i!=s.size()-1) {
			if((int)('z'-s[i])+1<=k) {
				k-=(int)('z'-s[i])+1;
				s[i]='a';
			} else {
				continue;
			}
		} else {
			int c = k%26;
			if(c<=(int)('z'-s[i])) {
				s[i]=s[i]+c;
			} else {
				c-=(int)('z'-s[i]);
				--c;
				s[i]='a'+c;
			}
		}
	}
	cout<<s<<endl;
}

Submission Info

Judge Result