【Python题解】蓝桥杯算法提高VIP-笨小猴

参考代码:

s = list(input())
num = []
for i in set(s):
    num.append(s.count(i))
result = max(num) - min(num)

def prime(n):
    if n <= 1:
        return False
    else:
        for i in range(2, n):
            if n%i == 0:
                return False
        return True

if prime(result):
    print('Lucky Word')
    print(result)
else:
    print('No Answer')
    print('0')