Submission #1135291

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;

string S;
int N, K;

int main() {
  cin >> S >> K;
  N = S.length();
  string o;
  for (int i=0; i<N; i++) {
    if (S[i] != 'a' && K >= '{'-S[i]) {
      int c = '{'-S[i];
      K -= c;
      o += 'a';
    }
    else {
      o += S[i];
    }
  }
  o[N-1] = (char)('a' + ((o[N-1]-'a'+K) % 26));
  cout << o << "\n";
  return 0;
}

Submission Info

Judge Result