Submission #1736370

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#include <cstring>
#include <map>
#include <queue>
#include <string>
#define pb push_back
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define inf (int)(1e9)
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;

int main(void){
  string s;
  int k;
  cin>>s>>k;
  for(int i=0;i<s.size();i++){
    if(s[i]=='a') continue;
    if(s[i]+k>'z'){
      k-='z'+1-s[i];
      s[i]='a';
    }
  }
  if(k>0){
    int t=s[s.size()-1];
    t-='a';
    t+=k;
    t%='z'-'a'+1;
    s[s.size()-1]='a'+t;
  }
  cout<<s<<endl;
  return 0;
}

Submission Info

Judge Result