Luo Gu solution to a problem [P1125] stupid monkey

This question is for sorting (statistics) and a prime number has certain requirements. But still small case (laughs)

#include <stdio.h> 
#include < String .h>
 int main () 
{ 
    int A [ 26 is ] = { 0 }, FlaB = . 1 , Minn = 1000 , MAXN = - 100 , SUM, I = 0 ; // assuming that 1000 is positive infinity, minus 100 is negative infinity. flab also be BOOL. 
    char B [ 101 ]; 
    Scanf ( " % S " , B);
     for (I = 0 ; I <strlen (B); I ++) A [B [I] - ' A ' ] ++; // input word, bucket sort 
    for (I = 0 ; I < 26 is;i++)
    {
        if(a[i]>maxn) maxn=a[i];
        else if(a[i]<minn&&a[i]>0) minn=a[i];
    }
    sum=maxn-minn;
    for(i=2;i<sum;i++)
    {
        if(sum/i==0) {flab=0;break;}//判断是否质数
    }
    if(flab!=0) 
    {
        if(sum!=1&&sum!=0)
        {
            printf("Lucky Word");
            printf("\n%d",sum);
        }
        else printf("No Answer\n0");    
    }
    else printf("No Answer\n0");
    return 0;
}