P1125 [NOIP2008 提高组] 笨小猴

考虑1和0的特殊性

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int a[27] = {0};
    int maxn = 0, minn = 10000, jkl;
    char n;
    for (n = getchar(); n != '\n';)
    {
        a[int(n) - 97]++;
        n = getchar();
    }
    for (int i = 0; i < 27; i++)
    {
        if (a[i] > maxn)
        {
            maxn = a[i];
        }
        if (a[i] != 0 && a[i] < minn)
        {
            minn = a[i];
        }
    }
    jkl = maxn - minn;
    for (int i = 2;; i++)
    {   //1和零的特殊性
        if (jkl != 0 && jkl != 1 && i > sqrt(jkl))
        {
            cout << "Lucky Word" << endl;
            cout << jkl << endl;
            break;
        }
        else if (jkl == 1 || jkl % i == 0)
        {
            cout << "No Answer" << endl;
            cout << 0;
            break;
        }
    }
}