这题普及-？

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

int a[30];
int maxn, minn;

bool is_prime(int x){
    if (x<2) return false;
    for (int i=2;i<x/i;i++){
        if (x%i==0) return false;
    }
    return true;
}

int main(){
    char c;
    while (cin >> c){
        a[c-'a']++;
    }

    sort(a, a+26);
    for (int i=0;i<26;i++){
        if (a[i]){
            minn = a[i];
        }
    }

    sort(a, a+26, greater<int>());
    for (int i=0;i<26;i++){
        if (a[i]){
            maxn = a[i];
        }
    }

    swap(minn, maxn);
    
    int cha = maxn-minn;

    (is_prime(cha)?cout << "Lucky Word\n" << maxn-minn:cout << "No Answer\n0");

    
    
    return 0;
}