Submission #891664

---

Source Code Expand

#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int main()
{
	int n,k;string s;
	cin>>s;cin>>k;n=s.size();
	rep(i,n-1){
		int now=(s[i]-'a');
		if(now>0 && now+k>=26){
			s[i]='a';k-=26-now;
		}
	}
	int now=(s[n-1]-'a');now+=k;now%=26;
	s[n-1]=('a'+now);
	cout<<s<<endl;
}

Submission Info

Judge Result