Submission #7090003

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define REP(var, a, b) for (int var = (a); var < (b); var++)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define ALL(c) (c).begin(), (c).end()
#define rALL(c) (c).rbegin(), (c).rend()
ll MOD = 1000000007;
ll INF = 1000000000;

int main() {
  //
  string s;
  cin >> s;
  ll k;
  cin >> k;
  rep(i, s.size()) {
    if (s[i] == 'a') continue;
    int add = 26 - (s[i] - 'a');
    // cout << add << endl;
    if (add <= k) {
      k -= add;
      s[i] = 'a';
    }
  }
  // cout << k << endl;
  if (k > 0) {
    k = k % 26;
    s[s.size() - 1] = s[s.size() - 1] + k;
  }
  cout << s << endl;
  return 0;
}

Submission Info

Judge Result