Submission #3237428


Source Code Expand

def c_next_letter(S, K):
    s = list(S)
    for t, elem in enumerate(s):
        if t == len(s) - 1 and K > 0:
            # 末尾に来たときに操作回数が残っていたら、その回数だけ操作する
            s[t] = chr(ord('a') + (ord(elem) - ord('a') + K) % 26)
        elif elem == 'a':
            continue  # 文字が最初から'a'ならば、何もしなくていい
        elif ord('z') - ord(elem) + 1 <= K:
            # K回以下の操作で'a'にできるなら、そうする
            s[t] = 'a'
            K -= ord('z') - ord(elem) + 1
    ans = ''.join(s)
    return ans

S = input()
K = int(input())
print(c_next_letter(S, K))

Submission Info

Submission Time
Task C - Next Letter
User kenseiQ
Language Python (3.4.3)
Score 400
Code Size 686 Byte
Status AC
Exec Time 74 ms
Memory 4084 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 16 ms 3064 KB
0_01.txt AC 16 ms 3064 KB
0_02.txt AC 16 ms 3064 KB
1_00.txt AC 17 ms 3060 KB
1_01.txt AC 17 ms 3064 KB
1_02.txt AC 17 ms 3060 KB
1_03.txt AC 16 ms 3064 KB
1_04.txt AC 17 ms 2940 KB
1_05.txt AC 17 ms 3060 KB
1_06.txt AC 33 ms 3956 KB
1_07.txt AC 71 ms 3956 KB
1_08.txt AC 49 ms 4084 KB
1_09.txt AC 48 ms 3956 KB
1_10.txt AC 48 ms 3956 KB
1_11.txt AC 56 ms 3956 KB
1_12.txt AC 45 ms 3956 KB
1_13.txt AC 46 ms 3956 KB
1_14.txt AC 74 ms 4084 KB
1_15.txt AC 63 ms 4084 KB
1_16.txt AC 65 ms 4084 KB
1_17.txt AC 68 ms 4084 KB
1_18.txt AC 67 ms 4084 KB
1_19.txt AC 67 ms 3956 KB
1_20.txt AC 68 ms 3956 KB
1_21.txt AC 64 ms 3956 KB
1_22.txt AC 72 ms 4084 KB
1_23.txt AC 66 ms 4084 KB