pythonchallenge-1地址 ： http://www.pythonchallenge.com/pc/def/274877906944.html
圖片如下：


題目解析：看圖也不懂是什麽意思，於是看一下攻略。題目意思：把每個字符位移兩次，例如：K→M
解題過程：

import re

def charshitf(aa):
    p1=re.compile(‘[a-x]‘)
    if p1.match(aa):
        return chr(ord(aa)+2)
    elif aa == ‘y‘:
        return ‘a‘
    elif aa == ‘z‘:
        return ‘b‘
    else:
        return aa

straa = "g fmnc wms bgblr rpylqjyrc gr zw fylb. rfyrq ufyr amknsrcpq ypc dmp. bmgle gr gl zw fylb gq glcddgagclr ylb rfyr‘q ufw rfgq rcvr gq qm jmle. sqgle qrpgle.kyicrpylq() gq pcamkkclbcb. lmu ynnjw ml rfc spj. "
strbb = ""
strcc = "map"
for i in strcc:
    strbb = strbb +charshitf(i)
print(strbb)

答案：通過解譯頁面的文本內容得出：i hope you didnt translate it by hand. thats what computers are for. doing it in by hand is inefficient and that‘s why this text is so long. using string.maketrans() is recommended. now apply on the url.
實際上只要解譯 map字符即可，map→ocr
心得:使用了正則表達式，引用了re。
　　整個程序不夠簡練，等有空了在來調整一下

使用python 3.x 對pythonchallenge-----1的解答過程