-
P5733 【深基6.例1】自动修正
s=input()
print(s.upper())
-
P1914 小书童——凯撒密码
n=int(input())
s=list(input())
l=len(s)
for i in range(l):
s[i]=chr((ord((s[i]))-ord('a')+n)%26+ord('a'))
print(''.join(s))
-
P1125 [NOIP2008 提高组] 笨小猴
from math import sqrt
def is_prime(n):
if n<=1:
return False
for i in range(2,int(sqrt(n))+1):
if n%i==0:
return False
return True
word=input()
frequency={}
for letter in word:
if letter in frequency:
frequency[letter]+=1
else:
frequency[letter]=1
if not frequency:
print("Lucky Word")
print(0)
else:
maxn=max(frequency.values())
minn=min(frequency.values())
diff=maxn-minn
if is_prime(diff)==True:
print("Lucky Word")
print(diff)
else:
print("No Answer")
print(0)