[RQNOJ]399笨小猴

http://www.rqnoj.cn/Problem_399.html

#include "stdio.h"

#include "math.h"

struct word

{

       char ch;

       int num;

}a[26]={0,0};

void main()

{

       char str[100];

       int i,j,max=0,min=100,n=0,flag=0,t,k;

       gets(str);

       for (i=0;str[i];i++)

       {

              for(j=0;j<n;j++)

                     if(a[j].ch==str[i])

                     {

                            a[j].num++;

                            break;

                     }

      

              if(j==n)

                     a[n++].ch=str[i];

       }

 

       for (i=0;i<n;i++)

       {

              if(a[i].num>max)

                     max=a[i].num;

              else

                     if(a[i].num<min)

                            min=a[i].num;

 

       }

       t=max-min;

 

       k=sqrt((double)t);

       for (i=2;i<=k;i++)

              if(t%i==0)

                     break;

       if(i!=k+1||t==1||t==0)

              printf("No Answer/n0/n");

       else

              printf("Lucky Word/n%d/n",t);

}