判断是否为质数

def is_prime(num):
if num < 2:
return False
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
return False
return True

处理输入单词

word = input().strip()

统计每个字母出现的次数

from collections import Counter
counts = Counter(word)

获取最大和最小出现次数

maxn = max(counts.values())
minn = min(counts.values())

计算差值

diff = maxn - minn

判断是否为 Lucky Word

if is_prime(diff):
print("Lucky Word")
print(diff)
else:
print("No Answer")
print(0)