Submission #2127722

---

Source Code Expand

// #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
// }}}
// #define {{{
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
// }}}

string s;
int K;

int main(){
  cin >> s >> K;
  for(auto&e : s) {
    int need = 'a' - e;
    if(need < 0) need += 26;
    if(K >= need) e = 'a' , K -= need;
  }
  int t = (s.back() - 'a' + K % 26) % 26;
  s[sz(s)-1] = 'a' + t;
  cout << s << endl;
  return 0;
}

Submission Info

Judge Result