Submission #4029505


Source Code Expand

s = input()
K = int(input())
N = len(s)

abc = 'bcdefghijklmnopqrstuvwxyza'
abc_to_index = {abc[_]: _ for _ in range(26)}

ans = ''
for i in range(N):
    if 25 - abc_to_index[s[i]] > K or i == N - 1:
        ans += s[i]
    else:
        ans += 'a'
        K -= 25 - abc_to_index[s[i]]
ans = ans[:-1] + abc[(abc_to_index[ans[-1]] + K) % 26]
print(ans)

Submission Info

Submission Time
Task C - Next Letter
User yydoco
Language Python (3.4.3)
Score 400
Code Size 369 Byte
Status AC
Exec Time 79 ms
Memory 3572 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 17 ms 3064 KB
0_01.txt AC 17 ms 3060 KB
0_02.txt AC 17 ms 3060 KB
1_00.txt AC 17 ms 3064 KB
1_01.txt AC 17 ms 3060 KB
1_02.txt AC 17 ms 3060 KB
1_03.txt AC 17 ms 3064 KB
1_04.txt AC 17 ms 3064 KB
1_05.txt AC 17 ms 3064 KB
1_06.txt AC 72 ms 3444 KB
1_07.txt AC 73 ms 3444 KB
1_08.txt AC 62 ms 3444 KB
1_09.txt AC 58 ms 3444 KB
1_10.txt AC 55 ms 3444 KB
1_11.txt AC 61 ms 3444 KB
1_12.txt AC 57 ms 3444 KB
1_13.txt AC 56 ms 3444 KB
1_14.txt AC 69 ms 3444 KB
1_15.txt AC 75 ms 3572 KB
1_16.txt AC 72 ms 3444 KB
1_17.txt AC 71 ms 3444 KB
1_18.txt AC 71 ms 3444 KB
1_19.txt AC 78 ms 3444 KB
1_20.txt AC 73 ms 3444 KB
1_21.txt AC 79 ms 3444 KB
1_22.txt AC 69 ms 3444 KB
1_23.txt AC 71 ms 3444 KB