[TYVJ] P1010 笨小猴

 1 #include<stdio.h>
 2 #include<string.h>
 3 int i,maxn=-1,minn=999,j,n,len,b[50];
 4 char a[200];
 5 
 6 int
 7 check(int n)
 8 {
 9     if (n<2) return(0);
10     if (n==2) return(1);
11     for (i=2;i<=n-1;i++)
12     if (n%i==0) return(0);
13     return(1);
14 }   
15 
16 int
17 main(void)
18 {
19     scanf("%s",a);
20     len=strlen(a);
21     
22     for(i=0;i<=(len-1);i++) b[a[i]-96]++;
23         
24     for (i=1;i<=26;i++)
25     {
26          if ((b[a[i]-96]!=0)&&(b[a[i]-96]<minn)) minn=b[a[i]-96];
27          if (b[a[i]-96]>maxn) maxn=b[a[i]-96];
28     }
29     if (check(maxn-minn)==0) printf("No Answer\n%d\n",0); 
30     else printf("Lucky Word\n%d\n",maxn-minn); 
31 
32     return 0;
33 
34 }