[KMU_SW_17] 시저 암호 알고리즘

encryption_algorithm.py

def is_small(n):
    if 97 <= n <= 122:
        return True
    else:
        return False


def shift(c, shift_count):
    if not (65 <= ord(c) <= 90 or 97 <= ord(c) <= 122):
        return c

    if is_small(ord(c)):
        if ord(c) + shift_count > 122:
            tmp = ord(c) + shift_count - 122 - 1
            return chr(97 + tmp)
        else:
            return chr(ord(c) + shift_count)

    else:
        if ord(c) + shift_count > 90:
            tmp = ord(c) + shift_count - 90 - 1
            return chr(65 + tmp)
        else:
            return chr(ord(c) + shift_count)


n = int(input())

for i in range(n):
    shift_count = int(input())
    text = list(input())
    result_text = ""
    for c in text:
        result_text += shift(c, shift_count)
    print(result_text)