桶排序+函数 秒杀

#include <bits/stdc++.h>
using namespace std;
bool prime(int n){
    if(n<=1) return false;
    int a;
    for(a=2;a*a<=n;a++) if(n%a==0) return false;
    return true;
}
int main(){
    int a;
    int maxn=0,minn=100;
    int box[26]={0};
    char c;
    while(cin>>c) box[c-'a']++;
    for(a=0;a<26;a++){
        if(box[a]>maxn) maxn=box[a];
        if(box[a]<minn&&box[a]>0) minn=box[a];
    }
    if(prime(maxn-minn)) cout<<"Lucky Word"<<endl<<maxn-minn;
    else cout<<"No Answer"<<endl<<0;
}