@营业执照思密达的题解

@营业执照思密达 你自己看看

#include <iostream>
#include <cstring>
using namespace std;

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

int main() {
    string s;
    cin >> s;
    int count[27] = {0}, maxn = 0, minn = 10000;
    for (int i = 0; i < s.size(); i++) {
        count[s[i] - 'a' + 1]++;
    }
    for (int i = 0; i < s.size(); i++) {
        maxn = max(maxn, count[s[i] - 'a' + 1]);
        minn = min(minn, count[s[i] - 'a' + 1]);
    }
    if (isPrime(maxn - minn)) {
        cout << "Lucky Word" << endl;
        cout << maxn - minn << endl;
    } else {
        cout << "No Answer" << endl;
        cout << 0 << endl;
    }
    return 0;
}