Submission #1248080


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;

string s;
int k;

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> s >> k;
	int sz = s.size();
	FOR(i, sz) {
		if (s[i] == 'a') continue;
		if ('z' - s[i] < k) {
			k -= 'z' - s[i] + 1;
			s[i] = 'a';
		}
		if (!k) break;
	}
	if (k) {
		k %= 26;
		if ('z' - s[sz-1] >= k) {
			s[sz-1] = (char)(s[sz-1] + k);
		}
		else s[sz-1] = (char)('a' + k - 'z' + s[sz-1] - 1);
	}
	cout << s << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Next Letter
User moguta
Language C++14 (GCC 5.4.1)
Score 400
Code Size 711 Byte
Status AC
Exec Time 2 ms
Memory 592 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 27
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 AC 2 ms 512 KB
1_09.txt AC 1 ms 512 KB
1_10.txt AC 2 ms 592 KB
1_11.txt AC 2 ms 512 KB
1_12.txt AC 1 ms 512 KB
1_13.txt AC 1 ms 512 KB
1_14.txt AC 2 ms 512 KB
1_15.txt AC 2 ms 512 KB
1_16.txt AC 2 ms 512 KB
1_17.txt AC 2 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