题解 P1125 [笨小猴]

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

string word;
int maxn = -1, minn = 101;

void GetMaxMin(string);
bool prime(int);

int main()
{
    cin >> word;
    GetMaxMin(word);
    if (prime(maxn - minn))
        cout << "Lucky Word" << endl << maxn - minn;
    else
        cout << "No Answer" << endl << 0;
    return 0;
}
void GetMaxMin(string s)
{
    for (char c = 'a'; c <= 'z'; c++)
    {
        int t = count(&s[0], &s[s.length()], c);
        maxn = max(t, maxn);
        if (t != 0)
            minn = min(t, minn);
    }
}
bool prime(int x)
{
    if (x < 2)
        return false;
    for (int i = 2; i * i <= x; i++)
        if (x % i == 0)
            return false;
    return true;
}