题解 | #[NOIP2008]笨小猴#

#include <iostream>
using namespace std;

int main() {


    string str;
    cin >> str;

    int cnt[26] = {0};
    for (int i = 0; i < str.size(); i++) {
        cnt[str[i] - 'a']++;
    }


    int maxn = 0;
    int minn = 0;

    for (int i = 0; i < 26; i++) {
        if (cnt[i] >= maxn) {
            maxn = cnt[i];
        }
    }

    minn = maxn;
    for (int i = 0; i < 26; i++) {
        if (cnt[i] <= minn && cnt[i] >= 1) {
            minn = cnt[i];
        }
    }



    int num = maxn - minn;

    int flag = 0;
    for (int i = 2; i < num; i++) {
        if (num % i == 0) {
            flag=1;
        }
    }


    if (flag == 1 || num == 1 || num == 0) {
        cout << "No Answer" << endl;
        cout << 0 << endl;
    } else if(flag == 0) {
        cout << "Lucky Word" << endl;
        cout << num << endl;
    }


    return 0;
}
// 64 位输出请用 printf("%lld")