洛谷P1125 笨小猴

题目传送门

代码：

#include<bits/stdc++.h>

using namespace std;
#define MAXN 35
int arr[MAXN];



bool isPrim(int x)
{
    if(x < 2)
    {
        return false;
    }
    if(x == 2)
    {
        return true;
    }
    for(int i=3; i<=sqrt(x); i++)
    {
        if(x%i == 0)
        {
            return false;
        }
    }
    return true;
}

int main()
{
    int MAX = 0;
    int MIN = 120;
    string word;
    cin>>word;
    memset(arr,0,sizeof(arr));
    int len = word.length(),i;
    for(i = 0; i < len; i++)
    {
        arr[word[i]-'a'] ++;
    }
    for(i = 0; i < 26; i++)
    {
        if(arr[i])
        {
            MAX = max(MAX,arr[i]);
            MIN = min(MIN,arr[i]);
        }

    }
    int x = MAX - MIN;
    //cout<<MIN<<" "<<MAX<<" "<<x<<endl;
    if(isPrim(x))
    {
        cout<<"Lucky Word"<<endl<<x<<endl;
    }else
    {
        cout<<"No Answer"<<endl<<0<<endl;
    }
    return 0;
}