题解 | 凯撒加密

n = int(input())
s = input()
s= list(s)
l = len(s)
n = int(n%26)
m = [0]*l
# for i in range(l-n):
#     m[i+n]=s[i]
# for i in range(l-n,l):
#     m[i+n-l] = s[i]
# print(''.join(m))
#链表移动

alphabelt = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']

for i in range(l):
    for j in range(26):
        if alphabelt[j] == s[i]:
            if j<26-n:
                s[i] = alphabelt[j+n]
            else:
                s[i] = alphabelt[j-26+n]
            break
        

print(''.join(s))