『题解』A14.笨小猴

前言：建议升黄/普及

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define re return
#define ew 5005
#define sz 10000005
#define sscc cout<<6;
const int MOD=1e9+7;
map<char,int>mp;
bool is(int x){
	if(x<=1){
		return false;
	}
	for(int i=2;i<x;i++){
		if(x%i==0){
			return false;
		}
	}
	return true;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	string s;
	cin>>s;
	int maxn=-1e9;
	int minn=1e9;
	for(int i=0;i<s.size();i++){
		mp[s[i]]++;
	}
	for(int i=1;i<=26;i++){
		//cout<<mp[i+96]<<" "<<char(i+96)<<endl;
		if(mp[i+96]!=0){
			maxn=max(maxn,mp[i+96]);
			minn=min(minn,mp[i+96]);
		}
	}
	//cout<<maxn<<" "<<minn<<endl;
	if(is(maxn-minn)){
		cout<<"Lucky Word"<<endl;
		cout<<maxn-minn;
	}
	else{
		cout<<"No Answer"<<endl;
		cout<<0;
	}
	re 0;
}