P1125 笨小猴，80分

#include<bits/stdc++.h>
using namespace std;
int alphacount[26];
char word[100];
bool isprime(int x)
{
	if(x<2)
	    return 0;
	for(int i=2;i<=sqrt(x);i++)
	{
		if(x%i==0)
		    return 0;
	}
	return 1;
}
int main()
{
	int maxn=-1,minn=101;
	cin>>word;
	for(int i=0;i<strlen(word);i++)
		alphacount[word[i]-'a']++;
	for(int i=0;i<26;i++)
	{
		if(alphacount[i]>maxn)
			maxn=alphacount[i];
		if(alphacount[i]<minn)
			minn=alphacount[i];
	}
	minn++;
	if(isprime(maxn-minn))
		cout<<"Lucky Word\n"<<maxn-minn<<endl;
	else
	    cout<<"No Answer\n0\n";
	return 0;
}