记录

#4 WA，

90pts

talk is cheap,show you my code.

Code

#include <bits/stdc++.h>
using namespace std;
int minn = 2147483647, maxn = -2147483648;
int len, a[10086];
char str[10086];
int tmp;
bool p(int x) {
    if (x <= 1) return 0;
    for (int i = 2; i * i <= x; ++i) {
        if (x % i == 0) {
            return 0;
        }
    }
    return 1;
}
int main(){
    scanf("%s", str);
    len = strlen(str);
    for (int i = 0; i < len; ++i) {
        a[str[i] - 'a']++;
    }
    for (int i = 0; i < len; ++i) {
        if (a[i] < minn && a[i] != 0) minn = a[i];
    }
    for (int i = 0; i < len; ++i) {
        if (a[i] > maxn) maxn = a[i];
    }
    tmp = maxn - minn;
    if (p(tmp)) printf("Lucky Word\n%d", tmp);
    else printf("No Answer\n0");
    return 0;
}