mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
70 lines
1.6 KiB
Python
70 lines
1.6 KiB
Python
def mixed_keyword(key: str = "college", pt: str = "UNIVERSITY") -> str:
|
|
"""
|
|
|
|
For key:hello
|
|
|
|
H E L O
|
|
A B C D
|
|
F G I J
|
|
K M N P
|
|
Q R S T
|
|
U V W X
|
|
Y Z
|
|
and map vertically
|
|
|
|
>>> mixed_keyword("college", "UNIVERSITY") # doctest: +NORMALIZE_WHITESPACE
|
|
{'A': 'C', 'B': 'A', 'C': 'I', 'D': 'P', 'E': 'U', 'F': 'Z', 'G': 'O', 'H': 'B',
|
|
'I': 'J', 'J': 'Q', 'K': 'V', 'L': 'L', 'M': 'D', 'N': 'K', 'O': 'R', 'P': 'W',
|
|
'Q': 'E', 'R': 'F', 'S': 'M', 'T': 'S', 'U': 'X', 'V': 'G', 'W': 'H', 'X': 'N',
|
|
'Y': 'T', 'Z': 'Y'}
|
|
'XKJGUFMJST'
|
|
"""
|
|
key = key.upper()
|
|
pt = pt.upper()
|
|
temp = []
|
|
for i in key:
|
|
if i not in temp:
|
|
temp.append(i)
|
|
len_temp = len(temp)
|
|
# print(temp)
|
|
alpha = []
|
|
modalpha = []
|
|
for j in range(65, 91):
|
|
t = chr(j)
|
|
alpha.append(t)
|
|
if t not in temp:
|
|
temp.append(t)
|
|
# print(temp)
|
|
r = int(26 / 4)
|
|
# print(r)
|
|
k = 0
|
|
for _ in range(r):
|
|
s = []
|
|
for _ in range(len_temp):
|
|
s.append(temp[k])
|
|
if k >= 25:
|
|
break
|
|
k += 1
|
|
modalpha.append(s)
|
|
# print(modalpha)
|
|
d = {}
|
|
j = 0
|
|
k = 0
|
|
for j in range(len_temp):
|
|
for m in modalpha:
|
|
if not len(m) - 1 >= j:
|
|
break
|
|
d[alpha[k]] = m[j]
|
|
if not k < 25:
|
|
break
|
|
k += 1
|
|
print(d)
|
|
cypher = ""
|
|
for i in pt:
|
|
cypher += d[i]
|
|
return cypher
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(mixed_keyword("college", "UNIVERSITY"))
|