Submission #891421
Source Code Expand
#include <iostream> #include <vector> #include <cmath> #include <ctime> #include <cassert> #include <cstdio> #include <queue> #include <set> #include <map> #include <fstream> #include <cstdlib> #include <string> #include <cstring> #include <algorithm> #include <numeric> #define mp make_pair #define mt make_tuple #define fi first #define se second #define pb push_back #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define forn(i, n) for (int i = 0; i < (int)(n); ++i) #define for1(i, n) for (int i = 1; i <= (int)(n); ++i) #define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i) #define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i) using namespace std; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vpi; typedef vector<vi> vvi; typedef long long i64; typedef vector<i64> vi64; typedef vector<vi64> vvi64; template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.precision(10); cout << fixed; #ifdef LOCAL_DEFINE freopen("input.txt", "rt", stdin); #endif string s; int k; cin >> s >> k; forn(i, s.size()) { if (s[i] == 'a') continue; int d = 26 - (s[i] - 'a'); if (d <= k) s[i] = 'a', k -= d; } k %= 26; s.back() = 'a' + (s.back() - 'a' + k) % 26; cout << s << '\n'; #ifdef LOCAL_DEFINE cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Next Letter |
User | endagorion |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1678 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 592 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 | 3 ms | 592 KB |
1_07.txt | AC | 3 ms | 592 KB |
1_08.txt | AC | 3 ms | 512 KB |
1_09.txt | AC | 3 ms | 512 KB |
1_10.txt | AC | 3 ms | 592 KB |
1_11.txt | AC | 3 ms | 512 KB |
1_12.txt | AC | 3 ms | 512 KB |
1_13.txt | AC | 3 ms | 512 KB |
1_14.txt | AC | 3 ms | 512 KB |
1_15.txt | AC | 3 ms | 512 KB |
1_16.txt | AC | 3 ms | 512 KB |
1_17.txt | AC | 3 ms | 512 KB |
1_18.txt | AC | 3 ms | 512 KB |
1_19.txt | AC | 3 ms | 592 KB |
1_20.txt | AC | 3 ms | 512 KB |
1_21.txt | AC | 3 ms | 592 KB |
1_22.txt | AC | 3 ms | 512 KB |
1_23.txt | AC | 3 ms | 512 KB |