Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Nearest Prime Number
def find_prime(): N = 127 prime = [True for i in range(N+1)] p = 2 while (p * p <= N): if(prime[p] == True): for i in range(p*p,N+1,p): prime[i] = False p+=1 prime[0] = False prime[1] = False return prime def get_nearest(e,p): ind = ord(e) i = j = ind for s in range(len(p)): r_i = ind + s l_i = ind - s if(l_i >= 0 and p[l_i] == True and chr(l_i).isalpha()): return chr(l_i) elif(r_i < len(p) and p[r_i] == True and chr(r_i).isalpha()): return chr(r_i) prime = find_prime() s= "AWGrOwUcFWnghtAyvxSb" # "CYGqOqSaGYmggqCqqqSa" for each in s: print(get_nearest(each ,prime))
run
|
edit
|
history
|
help
0
PyClosure
homework1
ms 80
.....✓[Guess the number]®®®®®®®•$$$$✓.....
Python_Hello_World
Counting
три шарика в матрице
python, attributes, setter and getter the pythonic way (V2)
Regular falsi
Love