Submission #2118513

---

Source Code Expand

#include <bits/stdc++.h>
//#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,long double> P;
typedef pair<ll,P> PP;

//-----------------------------------------------------------------------------

string s,t="abcdefghijklmnopqrstuvwxyz";
int k;

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

	cin>>s>>k;
	int sz=(int)s.size();
	REP(i,sz){
		if(s[i]=='a') continue;
		if(k==0) continue;
		int need=26-(s[i]-'a');
		if(k<need) continue;
		k-=need;
		s[i]='a';
	}
	k=k%26;
	s[sz-1]=t[(s[sz-1]-'a'+k)%26];
	cout<<s<<endl;

	return 0;
}

Submission Info

Judge Result