Each letter of the input string, the string is encrypted, encryption principle is as follows: A - & gt; Z, B - & gt; Y, C - & gt; X... Z - & gt; A, small also reflected on the way,
Digital law: 0 - & gt; 9, 1 - & gt; 8, 2 - & gt; 7... 9 - & gt; 0, to write an encryption function (f3),
Input validation: "I am 15," output "R recent 84"

CodePudding user response:

48,

 l=[[57], [65, 90], [97, 122]] 

Def f3 (TMPS) : 
Result='
For I in TMPS: 
R='
For j in l: 
If j [1] & gt;=word (I) & gt;=j [0] : 
R=CRH (j [1] - (word (I) - j [0])) 
Result=result + (r if r else I) 
Return the result 

Print (f3 (' I am 15 ')) 

CodePudding user response:

S="". Join ([CRH (letter) for letter in range (65,91)])
S1=s] [: : - 1
S=s + "". Join (x.l power () for x in s) +" 9876543210 "
S1=s1 + "". Join (x.l power () for x in s1) [: : - 1) +" 9876543210 "] [: : - 1
Print (s)
Print (s1)
Ss=list (s)
Ss1=list (s1)
Dicts=dict (zip (ss, ss1))
Print (dicts)
Tt='aeidk'
TTS=map (lambda x: dicts [x] if x in dicts. The keys () else x, the list (tt))
Print (". "the join (list (TTS)))