题解 | #[NOIP2008]笨小猴#

#include <stdio.h>
#include <stdlib.h>
int cmp(const void* e1 ,const void* e2)
{
    return *(char*)e1 - *(char*)e2;
}

int prime_num(int num)
{
    int i = 0;
    if(num < 2)
        return 0;
    for(i = 2; i<=num/2; i++)
    {
        if(num%i==0)
        return 0;
    }
    return 1;
}

int main() {
    
    char arr[100] = {0};
    int i;
    int min = 100;
    int max = 0;
    int count = 1;
    scanf("%s",arr);

    qsort(arr,strlen(arr),1,cmp);
    int left = 0;
    int next = 1;
    while(arr[next] != '\0')
    {
        while(arr[left] == arr[next])
        {
            count++;
            next++;
            left++;
        }
        if(count<min)
        {
            min = count;
        }
        if(count>max)
        {
            max = count;
        }
        count = 1;
        next++;
        left++;
    }

    int ret =  prime_num(max-min);
    if(ret == 1)
    {
        printf("Lucky Word\n");
        printf("%d\n",max-min);
    }
    else
    {
        printf("No Answer\n");
        printf("%d",0);
    }
  
    return 0;
}