s*小猴的s*题解（词汇量很“小”）

#include <iostream>
#include <string>
#include <algorithm>
#include <climits>
using namespace std;

bool isPrime(int n) {
if (n <= 1) return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}

int main() {
string word;
cin >> word;
int count[26] = {0};

for (char c : word) {
    count[c - 'a']++;
}

int maxn = 0, minn = INT_MAX;
for (int i = 0; i < 26; i++) {
    if (count[i] > 0) {
        maxn = max(maxn, count[i]);
        minn = min(minn, count[i]);
    }
}

int diff = maxn - minn;
if (isPrime(diff)) {
    cout << "Lucky Word" << endl << diff;
} else {
    cout << "No Answer" << endl << 0;
}

return 0;

}