题解

#include<bits/stdc++.h>
using namespace std;

map<char, int> freqs;
bool isprime(int n)
{
	if(n==0||n==1) return false;
    for(int i=2;i<=sqrt(n);i++) if(n%i==0) return false;
    return true;

}
bool cmp(pair<char,int> a, pair<char,int> b)
{
	return a.second>b.second;
}


int main(){
    int maxn=-1, minn=999999;
    string s;
    cin>>s;
    for(int i=0;i<s.size();i++)
    {
        freqs[s[i]];
        freqs[s[i]]++;
    }
    for(auto i : freqs)
    {
        if(i.second>maxn) maxn=i.second;
        else if(i.second<minn) minn=i.second;
    }
    if(isprime(maxn-minn))
    {
        cout<<"Lucky Word\n";
        cout<<maxn-minn;
    }
    else
    {
        cout<<"No Answer\n0";
    }
}