AcWing 493. 笨小猴
原题链接
简单
作者:
aabyte
,
2022-04-02 00:23:49
,
所有人可见
,
阅读 139
#include <iostream>
#include <string>
using namespace std;
int nums[26];
bool isprime(int n)
{
if(n < 2) return false;
for(int i = 2;i <= n / i; ++i)
{
if(n % i == 0) return false;
}
return true;
}
int main()
{
string s;
cin>>s;
int ma = 0,mi = 0;
for(int i = 0;i < s.size(); ++i)
{
nums[s[i] - 97] ++;
}
for(int i = 0;i < 26; ++i)
{
if(nums[i] != 0)
{
mi = nums[i];
break;
}
}
for(int i = 0;i < 26; ++i)
{
ma = max(ma, nums[i]);
if(nums[i] != 0) mi = min(mi, nums[i]);
}
if(isprime(ma - mi)) cout<<"Lucky Word"<<endl<<ma - mi<<endl;
else cout<<"No Answer"<<endl<<"0"<<endl;;
return 0;
}