Submission #1420304


Source Code Expand

#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int MOD = 1e9 + 7;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	string s; cin >> s;
	ll k; cin >> k;
	int len = s.length();
	for (int i = 0; i < len; i++) {
		int step = (26 - (s[i] - 'a')) % 26;
		if (k >= step) {
			k -= step;
			s[i] = 'a';
		}
	}
	if (k > 0) {
		s[len - 1] = (s[len - 1] -'a'+ k) % 26 +'a';
	}
	cout << s << endl;
}

Submission Info

Submission Time
Task C - Next Letter
User zaki_
Language C++14 (GCC 5.4.1)
Score 400
Code Size 702 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 2 ms 512 KB
1_10.txt AC 2 ms 592 KB
1_11.txt AC 2 ms 512 KB
1_12.txt AC 2 ms 512 KB
1_13.txt AC 2 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