#include<bits/stdc++.h>
using namespace std;
char s[1000];
int num[1000];
bool is_prime(int num) {//判断质数
if (num == 0 || num == 1)
return 0;
if (num == 2)
return 1;
for (int i = 2; i < num; i++) {
if (num % i == 0)
return 0;
}
return 1;
}
int main() {
int ans=0,minn=101,maxn=0,NUM=0;
cin >> s;
for (int i = 0; s[i] != '\0'; i++) {//字母出现一次 在下标处+1
ans = s[i]-96;
num[ans]++;
}
for (int i = 1; i <= 26; i++) {//求出最大和最小值
if (num[i] >= maxn)
maxn = num[i];
if (num[i] <= minn && num[i] != 0)
minn = num[i];
}
NUM = maxn - minn;
if (is_prime(NUM) == 1)//判断
cout << "Lucky Word" << endl << NUM << endl;
else
cout << "No Answer" << endl << "0" << endl;
system("pause");
return 0;
}
P1125 [NOIP2008 提高组] 笨小猴
最新推荐文章于 2024-09-29 23:53:24 发布