全WA。

code

#include <bits/stdc++.h>
using namespace std;
int tong[30];
char a;
bool is_zs(int n){
    for(int i=2;i*i<=n;i++){
        if(n%i==0){
            return 0;
        }
    }
    return 1;
}

int main(){
    while(cin>>a){
        tong[a-'a'+1]++;
    }
    sort(tong+1,tong+27);
    int maxn=tong[26];
    int minn=tong[1];
    if(is_zs(maxn-minn)) cout<<"Lucky Word\n"<<maxn-minn;
    else cout<<"No Answer\n"<<maxn-minn;
    return 0;
}