Submission #6894182

---

Source Code Expand

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;

int main(void){
    string s;
    ll k;
    std::cin >> s;
    std::cin >> k;
    
    ll n = s.length();
    
    for (int i = 0; i < n; i++) {
        // a,b,c,d,,,,,,,,x,y,z
        // 0,1,2,3,,,,,23,24,25

        if( s[i] == 'a' ){
            continue;
        }
        if( k >= 26-(s[i]-'a') ){
            k -= 26-(s[i]-'a');
            s[i] = 'a';
        }else{
            continue;
        }
    }
    
    if(k>0){
        s[n-1] = (char) ( (k + (s[n-1]-'a'))%26 )+'a';
    }
    
    
    std::cout << s << std::endl;
}

Submission Info

Judge Result