![](/img/trans.png)
[英]Does anyone know why this python code is just returning a single letter rather than a full word?
[英]Turn single digit code into full word code python
我正在為我的學校進行單詞加密,但不知道如何將其從一位數字加密轉換為完整單詞。 我希望能夠一次只用一個字母而不是一個字母寫完整的單詞。 如果有人可以幫助我解決這個問題,我將非常感謝
while True:
print("Input letters you would like to encrypt")
IN= input()
if IN=="a":
print("BCDEFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="A":
print("BCDEFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="b":
print("ACDEFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="B":
print("ACDEFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="c":
print("ABDEFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="C":
print("ABDEFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="d":
print("ABCEFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="D":
print("ABCEFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="e":
print("ABCDFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="E":
print("ABCDFGHIJKLMNOPQRSTUVWXYZ")
elif IN=="f":
print("ABCDEGHIJKLMNOPQRSTUVWXYZ")
elif IN=="F":
print("ABCDEGHIJKLMNOPQRSTUVWXYZ")
elif IN=="g":
print("ABCDEFHIJKLMNOPQRSTUVWXYZ")
elif IN=="G":
print("ABCDEFHIJKLMNOPQRSTUVWXYZ")
elif IN=="h":
print("ABCDEFGIJKLMNOPQRSTUVWXYZ")
elif IN=="H":
print("ABCDEFGIJKLMNOPQRSTUVWXYZ")
elif IN=="i":
print("ABCDEFGHJKLMNOPQRSTUVWXYZ")
elif IN=="I":
print("ABCDEFGHJKLMNOPQRSTUVWXYZ")
elif IN=="j":
print("ABCDEFGHIKLMNOPQRSTUVWXYZ")
elif IN=="J":
print("ABCDEFGHIKLMNOPQRSTUVWXYZ")
elif IN=="k":
print("ABCDEFGHIJLMNOPQRSTUVWXYZ")
elif IN=="K":
print("ABCDEFGHIJLMNOPQRSTUVWXYZ")
elif IN=="l":
print("ABCDEFGHIJKMNOPQRSTUVWXYZ")
elif IN=="L":
print("ABCDEFGHIJKMNOPQRSTUVWXYZ")
elif IN=="m":
print("ABCDEFGHIJKLNOPQRSTUVWXYZ")
elif IN=="M":
print("ABCDEFGHIJKLNOPQRSTUVWXYZ")
elif IN=="n":
print("ABCDEFGHIJKLMOPQRSTUVWXYZ")
elif IN=="N":
print("ABCDEFGHIJKLMOPQRSTUVWXYZ")
elif IN=="o":
print("ABCDEFGHIJKLMNPQRSTUVWXYZ")
elif IN=="O":
print("ABCDEFGHIJKLMNPQRSTUVWXYZ")
elif IN=="p":
print("ABCDEFGHIJKLMNOQRSTUVWXYZ")
elif IN=="P":
print("ABCDEFGHIJKLMNOQRSTUVWXYZ")
elif IN=="q":
print("ABCDEFGHIJKLMNOPRSTUVWXYZ")
elif IN=="Q":
print("ABCDEFGHIJKLMNOPRSTUVWXYZ")
elif IN=="r":
print("ABCDEFGHIJKLMNOPQSTUVWXYZ")
elif IN=="R":
print("ABCDEFGHIJKLMNOPQSTUVWXYZ")
elif IN=="s":
print("ABCDEFGHIJKLMNOPQRTUVWXYZ")
elif IN=="S":
print("ABCDEFGHIJKLMNOPQRTUVWXYZ")
elif IN=="t":
print("ABCDEFGHIJKLMNOPQRSUVWXYZ")
elif IN=="T":
print("ABCDEFGHIJKLMNOPQRSUVWXYZ")
elif IN=="u":
print("ABCDEFGHIJKLMNOPQRSTVWXYZ")
elif IN=="U":
print("ABCDEFGHIJKLMNOPQRSTVWXYZ")
elif IN=="v":
print("ABCDEFGHIJKLMNOPQRSTUWXYZ")
elif IN=="V":
print("ABCDEFGHIJKLMNOPQRSTUWXYZ")
elif IN=="w":
print("ABCDEFGHIJKLMNOPQRSTUVXYZ")
elif IN=="W":
print("ABCDEFGHIJKLMNOPQRSTUVXYZ")
elif IN=="x":
print("ABCDEFGHIJKLMNOPQRSTUVWYZ")
elif IN=="X":
print("ABCDEFGHIJKLMNOPQRSTUVWYZ")
elif IN=="y":
print("ABCDEFGHIJKLMNOPQRSTUVWXZ")
elif IN=="Y":
print("ABCDEFGHIJKLMNOPQRSTUVWXZ")
elif IN=="z":
print("ABCDEFGHIJKLMNOPQRSTUVWXY")
elif IN=="Z":
print("ABCDEFGHIJKLMNOPQRSTUVWXY")
else:
print("One number at a time bud")
通過
我了解您可能在項目上進行了艱苦的工作,但可悲的是,我認為它可能過於簡單,無法生成加密的文本。 正如您所說,您的代碼當前正在執行的工作就是能夠打印1位數字的加密。
可悲的是,我對python的了解有所減少,但是一個簡單的google也許可以為您提供幫助,對此我進行了快速查找,希望對您有所幫助! http://www.dlitz.net/software/pycrypto/希望能對您有所幫助,它還為您提供了解密器。 如果需要的話
我從他們的文件中得到的
>>> from Crypto.Cipher import DES
>>> obj=DES.new('abcdefgh', DES.MODE_ECB)
>>> plain="Guido van Rossum is a space alien."
>>> len(plain)
34
>>> obj.encrypt(plain)
Traceback (innermost last):
File "<stdin>", line 1, in ?
ValueError: Strings for DES must be a multiple of 8 in length
>>> ciph=obj.encrypt(plain+'XXXXXX')
>>> ciph
'\021,\343Nq\214DY\337T\342pA\372\255\311s\210\363,\300j\330\250\312\347\342I\3215w\03561\303dgb/\006'
>>> obj.decrypt(ciph)
'Guido van Rossum is a space alien.XXXXXX'
純娛樂:
from string import ascii_uppercase
while True:
print("Input letters you would like to encrypt")
IN= input().upper()
if IN.upper() in ascii_uppercase:
print(ascii_uppercase.replace(IN, ''))
看來您正在嘗試針對所提供的字母返回羅馬字母的補碼 。
有幾種方法可以做到這一點:
from string import ascii_uppercase
def reduce_complement_alpha(letters):
res = reduce(lambda letter: alphabet.replace(letter, ''), letters.upper(), ascii_uppercase)
return res
def set_complement_letters(letters):
res = ''.join(sorted(set(ascii_upper) - set(letters.upper())))
return res
def filter_complement_letters(letters):
res = ''.join(filter(lambda l: l not in letters.upper(), ascii_uppercase))
return res
這些只是幾個示例:)第一個功能具有O(n log n)時間復雜度,但實際上,由於您的n非常小,所以這無關緊要,而最后一個具有線性O(n)時間復雜度。
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.