Submission #1610606


Source Code Expand

#include<bits/stdc++.h>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pii pair<int,int>
#define piii pair<int,pii>
#define mp make_pair
#define pb push_back  
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-5;
const double PI = M_PI;  
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
  
#define DIV 1000000007
typedef vector<ll> Array;
typedef vector<Array> matrix;
typedef tuple<int,int,int> tiii;
#define mt make_tuple

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

Submission Info

Submission Time
Task C - Next Letter
User cashisu1
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1091 Byte
Status AC
Exec Time 5 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 27
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 4 ms 512 KB
1_07.txt AC 4 ms 512 KB
1_08.txt AC 4 ms 512 KB
1_09.txt AC 4 ms 512 KB
1_10.txt AC 5 ms 512 KB
1_11.txt AC 4 ms 512 KB
1_12.txt AC 4 ms 512 KB
1_13.txt AC 4 ms 512 KB
1_14.txt AC 4 ms 512 KB
1_15.txt AC 4 ms 512 KB
1_16.txt AC 5 ms 512 KB
1_17.txt AC 4 ms 512 KB
1_18.txt AC 4 ms 512 KB
1_19.txt AC 5 ms 512 KB
1_20.txt AC 4 ms 512 KB
1_21.txt AC 5 ms 512 KB
1_22.txt AC 4 ms 512 KB
1_23.txt AC 4 ms 512 KB