题解 | 笨小猴

#include <stdio.h>
#include <string.h>

int if_zhishu(int n)
{
    if(n<=1)return 0;
    for(int a=2;a<n;a++)
    {
        if(n%a==0)return 0;
    }
    return 1;
}
int main() 
{
    char arr[100];
    int basement[26]={0};
    fgets(arr,100,stdin);
        int len=strlen(arr);
        if (len > 0 && arr[len-1] == '\n') 
        {
          arr[len-1] = '\0';
          len--;
        }
        for(int a=0;a<len;a++)
        {
            basement[arr[a]-'a']++;
        }
    
    int maxn=0;
    int minn=100;
    for(int a=1;a<26;a++)
    {
       if(basement[a]>0)
        {
            if(basement[a]>maxn)maxn=basement[a];
            if(basement[a]<minn)minn=basement[a];
        }
    }
    int outcome=maxn-minn;
    if(if_zhishu(outcome))
    {
        printf("Lucky Word\n");
        printf("%d\n",outcome);
    }
    else 
    {
        printf("No Answer\n0\n");
    }
    return 0;
}