Submission #891669
Source Code Expand
#include "bits/stdc++.h"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/pb_ds/assoc_container.hpp"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define in(x) (read(x))
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) a.begin(),a.end()
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) (x&(-x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 1e9+7;
const ld eps = 1e-9;
const int inf = mod;
const db PI = atan(1)*4;
template<typename T>
inline int sign(const T&a){if(a<0)return -1;if(a>0)return 1;return 0;}
template<typename T> inline void in(T &x){
x = 0; T f = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
while (isdigit(ch)) {x = x * 10 + ch - '0'; ch = getchar();}
x *= f;
}
string s;
const int maxn = 100010;
int a[maxn];
int main(){
cin>>s;
REP(i,0,sz(s))a[i] = s[i]-'a';
int k = 0;
cin>>k;
REP(i,0,sz(s)){
if(a[i]==0)continue;
if(26-a[i]<=k){
k-=26-a[i];
a[i] = 0;
}
}
a[sz(s)-1] = (a[sz(s)-1]+k)%26;
REP(i,0,sz(s)){
cout<<(char)(a[i]+'a');
}
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Next Letter |
User |
samzhang |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1824 Byte |
Status |
AC |
Exec Time |
9 ms |
Memory |
896 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 |
2 ms |
256 KB |
0_01.txt |
AC |
2 ms |
256 KB |
0_02.txt |
AC |
2 ms |
256 KB |
1_00.txt |
AC |
2 ms |
256 KB |
1_01.txt |
AC |
2 ms |
256 KB |
1_02.txt |
AC |
2 ms |
256 KB |
1_03.txt |
AC |
2 ms |
256 KB |
1_04.txt |
AC |
2 ms |
256 KB |
1_05.txt |
AC |
2 ms |
256 KB |
1_06.txt |
AC |
9 ms |
896 KB |
1_07.txt |
AC |
9 ms |
896 KB |
1_08.txt |
AC |
9 ms |
896 KB |
1_09.txt |
AC |
9 ms |
896 KB |
1_10.txt |
AC |
9 ms |
896 KB |
1_11.txt |
AC |
9 ms |
896 KB |
1_12.txt |
AC |
9 ms |
896 KB |
1_13.txt |
AC |
9 ms |
896 KB |
1_14.txt |
AC |
9 ms |
896 KB |
1_15.txt |
AC |
9 ms |
896 KB |
1_16.txt |
AC |
9 ms |
896 KB |
1_17.txt |
AC |
9 ms |
896 KB |
1_18.txt |
AC |
9 ms |
896 KB |
1_19.txt |
AC |
9 ms |
896 KB |
1_20.txt |
AC |
9 ms |
896 KB |
1_21.txt |
AC |
9 ms |
896 KB |
1_22.txt |
AC |
9 ms |
896 KB |
1_23.txt |
AC |
9 ms |
896 KB |