【P1125 笨小猴】70分 WA

#include <iostream>
#include <cstdio>
#include <cmath>
#include <map>
#include <cstring>
#include<algorithm>
using namespace std;

bool v[200];
int prime[200];
int Ora(int n) //返回质数数量
{
    int cnt = 0;
    for (int i = 2; i <= n; i++)
    {
        if (v[i] == 0)
            prime[cnt++] = i;
        for (int j = 0; j <= cnt && prime[j] * i <= n; j++)
        {
            v[prime[j] * i] = 1;
            if (i % prime[j]==0)
                break;
        }
    }
    return cnt;
}

char a[120];//输入单词
map<char, int> sum; //存储的元素为对应下标ASCII的字母出现的次数
int main()
{
    int n = Ora(110);//用于binary_search

    scanf("%s", a);
    int len = strlen(a);   
    for (int i = 0; i < len; i++)//记录
    {
        sum[a[i]]++;
    }


    int max = 0, min = 120;

    min = sum.begin()->second;
    map<char, int>::iterator i = sum.end();
    i--;
    max = i->second;


    if (binary_search(prime,prime+n,max - min))
    {
        cout << "Lucky Word" << endl;
        cout << max - min;
    }
    else
    {
        cout << "No Answer" << endl;
        cout << 0;
    }

    return 0;
}