Submission #1746099

---

Source Code Expand

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
using ll = long long;
//#define int ll
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
char alph[]={"abcdefghijklmnopqrstuvwxyz"};
signed main(){
    string s; cin>>s;
    int n=(int)s.length();
    int k; cin>>k;
    map<char,int>mp;
    rep(i,26)mp[alph[i]]=26-i;
    string ans;
    rep(i,n){
        if(mp[s[i]]<=k){
            ans.push_back('a');
            if(s[i]!='a')k-=mp[s[i]];
        }
        else
            ans.push_back(s[i]);
            
    }
    k%=26;
    ans[n-1]=alph[(abs(mp[ans[n-1]]-26)+k)%26];
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result