Submission #893451

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define MOD 1000000007
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
typedef pair<ll, string> PLS;

string s;
int n, cnt[100100];

int main(){
	cin >> s >> n;
	REP(i, s.size()){
		cnt[i] = s[i] - 'a';
	}
	int pos = 0;
	while (n > 0){
		if (cnt[pos] != 0){
			int num = 26 - cnt[pos];
			if (n >= num){
				s[pos] = 'a';
				n -= num;
			}
		}
		if (pos == s.size() - 1){
			n %= 26;
			break;
		}
		pos++;
	}
	if (n > 0){
		s[s.size() - 1] += n;
	}
	cout << s << endl;
}

Submission Info

Judge Result