50分!(回答有奖)

#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
bool is_prime(int x)
{
	if(x==1||x==0)
		return false;
	else
	{
		for(int i=2;i<=sqrt(x);i++)
			if(x%i==0)
				return false;
		return true;
	}
}
int main()
{
	string s;
	int k[10005]={0},maxn=-1,minn=101;
	cin>>s;
	for(int i=0;i<s.size();i++)
		k[s[i]]++;
	for(int i=0;i<s.size();i++)
	{
		maxn=max(maxn,k[s[i]]);
		minn=min(minn,k[s[i]]);
	}
	if(is_prime(maxn-minn)==1)
		cout<<"lucky Word"<<endl<<maxn-minn;
	else
		cout<<"No Answer"<<endl<<0;
 }