Submission #891692
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using ll=long long;
using R=long double;
const R EPS=1e-9; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max<R>(x,0.0));}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
// Problem Specific Parameter:
int main(void){
string s;
cin >> s;
int k;
cin >> k;
int n=int(s.size());
rep(i,n){
int num=(26-(s[i]-'a'))%26;
if(num<=k){
k-=num;
s[i]='a';
}
}
s[n-1]=(s[n-1]-'a'+k)%26+'a';
cout << s << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Next Letter |
User |
Hec |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1452 Byte |
Status |
AC |
Exec Time |
7 ms |
Memory |
512 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
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 |
3 ms |
256 KB |
0_01.txt |
AC |
3 ms |
256 KB |
0_02.txt |
AC |
3 ms |
256 KB |
1_00.txt |
AC |
3 ms |
256 KB |
1_01.txt |
AC |
3 ms |
256 KB |
1_02.txt |
AC |
3 ms |
256 KB |
1_03.txt |
AC |
3 ms |
256 KB |
1_04.txt |
AC |
3 ms |
256 KB |
1_05.txt |
AC |
3 ms |
256 KB |
1_06.txt |
AC |
6 ms |
512 KB |
1_07.txt |
AC |
6 ms |
512 KB |
1_08.txt |
AC |
7 ms |
512 KB |
1_09.txt |
AC |
6 ms |
512 KB |
1_10.txt |
AC |
6 ms |
512 KB |
1_11.txt |
AC |
6 ms |
512 KB |
1_12.txt |
AC |
6 ms |
512 KB |
1_13.txt |
AC |
6 ms |
512 KB |
1_14.txt |
AC |
6 ms |
512 KB |
1_15.txt |
AC |
6 ms |
512 KB |
1_16.txt |
AC |
6 ms |
512 KB |
1_17.txt |
AC |
6 ms |
512 KB |
1_18.txt |
AC |
6 ms |
512 KB |
1_19.txt |
AC |
6 ms |
512 KB |
1_20.txt |
AC |
6 ms |
512 KB |
1_21.txt |
AC |
6 ms |
512 KB |
1_22.txt |
AC |
6 ms |
512 KB |
1_23.txt |
AC |
6 ms |
512 KB |