-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathceaser-cypher.py
63 lines (44 loc) · 1.13 KB
/
ceaser-cypher.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'caesarCipher' function below.
#
# The function is expected to return a STRING.
# The function accepts following parameters:
# 1. STRING s
# 2. INTEGER k
#
def caesarCipher(s, k): # O(n)
# Special cases k > 26
# 66 > 26
# 66 - 26 - 26 = 14
if k > 26:
k = k % 26
alpha = 'abcdefghijklmnopqrstuvwxyz'
alpha_rot = alpha[k:]+alpha[:k]
alpha = alpha + alpha.upper()
alpha_rot = alpha_rot + alpha_rot.upper()
alpha_hash = {}
for i in range(len(alpha)): # O(n)
alpha_hash[alpha[i]] = alpha_rot[i]
print(alpha_hash)
s_arr = [*s]
for i in range(len(s_arr)): # O(n)
try:
letter = s_arr[i]
s_arr[i] = alpha_hash[letter]
except:
continue
return ''.join(s_arr)
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
s = input()
k = int(input().strip())
result = caesarCipher(s, k)
fptr.write(result + '\n')
fptr.close()