参考代码:
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')
0.0分
2 人评分
川哥的吩咐 (C++代码)浏览:1019 |
蓝桥杯历届试题-九宫重排 (C++代码)浏览:2785 |
C语言程序设计教程(第三版)课后习题8.3 (C语言代码)浏览:721 |
C语言程序设计教程(第三版)课后习题6.9 (C语言代码)浏览:661 |
The 3n + 1 problem (C语言代码)浏览:554 |
printf基础练习2 (C语言代码)浏览:630 |
1113题解浏览:794 |
矩阵乘方 (C语言代码)浏览:1038 |
C二级辅导-等差数列 (C语言代码)浏览:735 |
C语言程序设计教程(第三版)课后习题8.4 (C语言代码)浏览:577 |