Submission #7140824

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional> // std::function<void(int)>
using namespace std;
#define int long long
#define All(v) (v).begin(),(v).end()
int dy[4] = {-1,0,1,0};
int dx[4] = {0,1,0,-1};
int Dy[8] = {-1,-1,0,1,1,1,0,-1};
int Dx[8] = {0,1,1,1,0,-1,-1,-1};
const int mod = 1000000007;
const int inf = mod*mod;
const int d5 = 111111;
signed main(){
    string s;
    int k;
    cin>>s>>k;
    int l=s.size();
    string res="";
    for(int i=0;i<l-1;i++){
        int d='z'+1-s[i];
        //cout<<s[i]<<' '<<d<<endl;
        if(d==26){
            res+='a';
        }
        else if(d<=k){
            res+='a';
            k-=d;
        }
        else{
            res+=s[i];
        }
    }
    k%=26;
    if('0'+s[l-1]+k>'0'+'z'){
        s[l-1]=s[l-1]-'z'+'a'+k-1;
        res+=s[l-1];
    }
    else{
        res+=s[l-1]+k;
    }
    cout<<res<<endl;
}

Submission Info

Judge Result