CODEVS|1053|笨小猴

#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
string w;
char h[110];
int hh[110];
char ch;
int n,m,cs=0;
int jg;
int main()
{
	memset(hh,0,sizeof(hh));
	cin>>w;
	int l=w.length();
	for(int i=0;i<l;i++)
	{
		if(i==0)
		{
			ch=w[i];
			h[cs]=ch;
			cs++;
			continue;
		}
		if(w[i]==ch)
			continue;
		if(w[i]!=ch)
		{
			ch=w[i];
			h[cs]=ch;
			cs++;
			continue;
		}
	}
	for(int i=0;i<=cs;i++)
	{
		for(int j=0;j<l;j++)
		{
			if(h[i]==w[j])
				hh[i]++;
		}
	}
	sort(hh,hh+cs);
	jg=hh[cs-1]-hh[0];
	if(jg==0)
	{
		cout<<"No Answer"<<endl;
		cout<<0;
		return 0;
	}
	if(jg==1)
	{
		cout<<"No Answer"<<endl;
		cout<<0;
		return 0;
	}
	if(jg==2)
	{
		cout<<"Lucky Word"<<endl;
		cout<<2;
		return 0;
	}
	for(int i=2;i<jg;i++)
	{
		if(jg%i==0)
		{
			cout<<"No Answer"<<endl;
			cout<<jg;
			return 0;
		}
		else if(jg%i!=0&&i==jg-1)
		{
			cout<<"Lucky Word"<<endl;
			cout<<jg;
			return 0;
		}
	}
}