Submission #2712610
Source Code Expand
#include <algorithm> #include <bitset> #include <cctype> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <numeric> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> #define int long long #define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i) #define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i) #define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i) #define REV(i, a, b) for (int i = (a); i >= (b); --i) #define CLR(a, b) memset((a), (b), sizeof(a)) #define DUMP(x) cout << #x << " = " << (x) << endl; #define INF (3e15) using namespace std; string s; int K; signed main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> s >> K; REP(i, s.size()) { char& c = s[i]; if ('z' - c < K) { K -= ('z' - c + 1); c = 'a'; } if (K == 0) break; } char& c = s[s.size() - 1]; c += (K % 26); cout << s << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Next Letter |
User | tatsumack |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1251 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 592 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 2 ms | 592 KB |
1_07.txt | AC | 2 ms | 592 KB |
1_08.txt | WA | 1 ms | 512 KB |
1_09.txt | WA | 1 ms | 512 KB |
1_10.txt | WA | 1 ms | 592 KB |
1_11.txt | WA | 1 ms | 512 KB |
1_12.txt | WA | 1 ms | 512 KB |
1_13.txt | WA | 1 ms | 512 KB |
1_14.txt | WA | 2 ms | 512 KB |
1_15.txt | WA | 2 ms | 512 KB |
1_16.txt | AC | 2 ms | 512 KB |
1_17.txt | AC | 1 ms | 512 KB |
1_18.txt | AC | 2 ms | 512 KB |
1_19.txt | AC | 2 ms | 592 KB |
1_20.txt | AC | 2 ms | 512 KB |
1_21.txt | AC | 2 ms | 592 KB |
1_22.txt | AC | 2 ms | 512 KB |
1_23.txt | AC | 2 ms | 512 KB |