Submission #3238603
Source Code Expand
#include <iostream> #include <stdio.h> #include <fstream> #include <algorithm> #include <string> #include <map> #include <set> #include <queue> #include <stack> #include <vector> #include <limits.h> #include <math.h> #include <functional> #include <bitset> #define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i)) #define debug(x) cerr << #x << ": " << x << '\n' #define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i] << '\n' #define debugArrayP(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i].first<< " " << x[i].second << '\n' using namespace std; typedef long long ll; typedef pair<int,int> Pii; typedef vector<int> vint; typedef vector<ll> vll; const ll INF = LLONG_MAX/10; const ll MOD = 1e9+7; int main(){ string s;cin >> s; ll K;cin >> K; repeat(i,s.length()){ ll dif = ('z'-s[i]+1)%26; if(dif<=K){ s[i] = 'a'; K -= dif; } } K %= 26; s.back() += K; cout << s << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Next Letter |
User | hashiryo |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1065 Byte |
Status | AC |
Exec Time | 5 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 | 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 | 5 ms | 512 KB |
1_07.txt | AC | 5 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 | 5 ms | 512 KB |
1_15.txt | AC | 4 ms | 512 KB |
1_16.txt | AC | 5 ms | 512 KB |
1_17.txt | AC | 5 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 |