Submission #7132847


Source Code Expand

# code-festival-2016-qualaC - 次のアルファベット / Next Letter
from string import ascii_lowercase as abc


def main():
    S = input().rstrip()
    K = int(input())
    # dist[c] := distance to "a" through "z"
    dist = {c: 26 - i for i, c in enumerate(abc)}
    dist["a"] = 0
    A = [dist[i] for i in S]
    ans = ""
    for i, s in zip(A[:-1], S[:-1]):
        if 0 < i <= K:  # change s to "a" if possible
            ans += "a"
            K -= i
        else:
            ans += s
    # use the remaining K on A[-1] and combine with ans
    ans += chr((ord(S[-1]) + K - ord("a")) % 26 + ord("a"))
    print(ans)


if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task C - Next Letter
User solzard
Language Python (3.4.3)
Score 400
Code Size 691 Byte
Status AC
Exec Time 49 ms
Memory 5532 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 28 ms 3956 KB
0_01.txt AC 24 ms 3768 KB
0_02.txt AC 24 ms 3768 KB
1_00.txt AC 24 ms 3764 KB
1_01.txt AC 24 ms 3768 KB
1_02.txt AC 24 ms 3764 KB
1_03.txt AC 24 ms 3764 KB
1_04.txt AC 24 ms 3768 KB
1_05.txt AC 24 ms 3764 KB
1_06.txt AC 42 ms 5368 KB
1_07.txt AC 49 ms 5488 KB
1_08.txt AC 45 ms 5532 KB
1_09.txt AC 43 ms 5364 KB
1_10.txt AC 44 ms 5364 KB
1_11.txt AC 45 ms 5360 KB
1_12.txt AC 43 ms 5372 KB
1_13.txt AC 43 ms 5364 KB
1_14.txt AC 48 ms 5524 KB
1_15.txt AC 49 ms 5524 KB
1_16.txt AC 49 ms 5528 KB
1_17.txt AC 49 ms 5528 KB
1_18.txt AC 49 ms 5528 KB
1_19.txt AC 49 ms 5364 KB
1_20.txt AC 47 ms 5368 KB
1_21.txt AC 49 ms 5368 KB
1_22.txt AC 49 ms 5528 KB
1_23.txt AC 49 ms 5524 KB