Submission #891406
Source Code Expand
#include <cstdio> #include <numeric> #include <iostream> #include <vector> #include <set> #include <cstring> #include <string> #include <map> #include <cmath> #include <ctime> #include <algorithm> #include <bitset> #include <queue> #include <sstream> #include <deque> using namespace std; #define mp make_pair #define pb push_back #define rep(i,n) for(int i = 0; i < (n); i++) #define re return #define fi first #define se second #define sz(x) ((int) (x).size()) #define all(x) (x).begin(), (x).end() #define sqrt(x) sqrt(abs(x)) #define y0 y3487465 #define y1 y8687969 #define fill(x,y) memset(x,y,sizeof(x)) #define prev PREV #define next NEXT typedef vector<int> vi; typedef long long ll; typedef long double ld; typedef double D; typedef pair<int, int> ii; typedef vector<ii> vii; typedef vector<string> vs; typedef vector<vi> vvi; template<class T> T abs(T x) { re x > 0 ? x : -x; } template<class T> inline T sqr (T x) { re x * x; } #define filename "" int n; int m; string s; int main () { cin >> s >> m; n = sz (s); for (int i = 0; i < n; i++) if (s[i] != 'a' && 'z' - s[i] + 1 <= m) { m -= 'z' - s[i] + 1; s[i] = 'a'; } m %= 26; s[n - 1] = (s[n - 1] - 'a' + m) % 26 + 'a'; cout << s << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Next Letter |
User | vepifanov |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1325 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 640 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 | 3 ms | 256 KB |
0_02.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 2 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 | 6 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 | 640 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 |