Python Challenge

0.html

print 2**38

map.html

k->m,
o->q
e->g
# Python Challenge
# http://www.pythonchallenge.com/pc/def/map.html

str_to_parse = 'g fmnc wms bgblr rpylqjyrc gr zw fylb. rfyrq ufyr amknsrcpq ypc dmp.'\
    'bmgle gr gl zw fylb gq glcddgagclr ylb rfyrq ufw rfgq rcvr gq qm jmle.' \
    'sqgle qrpgle.kyicrpylq() gq pcamkkclbcb. lmu ynnjw ml rfc spj.'

print(str_to_parse)
abc_list = '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'.split()
m_dict = {}
for i, ch in enumerate(abc_list):
    m_dict[ch] = abc_list[(i+2) % len(abc_list)]


def getc(char):
    return m_dict[char] if char in m_dict else char

# parse_func = lambda c: mdict[c] if c in mdict else c
new_str = [getc(c) for c in str_to_parse]
ns = ''
for c in new_str:
    ns += c
print(ns)
print(str_to_parse.maketrans(m_dict))