【NOIP2008提高组】笨小猴

#include<bits/stdc++.h>
using namespace std;
char word[105];
int alphabet['z'+5],maxnum=INT_MIN,minnum=INT_MAX,prime[35]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
int main(){
	freopen("word.in","r",stdin);
	freopen("word.out","w",stdout);
	scanf("%s",word);
	int len=strlen(word);
	for(int i=0;i<len;i++){
		alphabet[word[i]]++;//统计数据
	}
	/*
	for(int i='a';i<='z';i++){
		cout<<(char)i<<' '<<alphabet[i]<<endl;
	}
	*/
	for(int i='a';i<='z';i++){
		if(maxnum<alphabet[i]){
			maxnum=alphabet[i];
		}
		if(minnum>alphabet[i] and alphabet[i]!=0){//找出现次数最小的字母（出现次数不能是0，不然就没出现过）
			minnum=alphabet[i];
		}
	}
	//cout<<maxnum<<' '<<minnum;
	//cout<<maxnum-minnum<<endl;
	for(int i=1;i<=25;i++){//判断maxnum-minnum是否为质数
		if(maxnum-minnum==prime[i]){
			printf("Lucky Word\n%d",prime[i]);
			return 0;
		}
	}
	printf("No Answer\n0");
	return 0;
}