题解 | 笨小猴

#include <stdio.h>
int f(int n)
{
    int f=1;
    if(n<2)
    f=0;
    for(int i=2;i<n;i++)
    {
       if(n%i==0)
       {
        f=0;
        break;
       }
    }
    return f;
}
int main() {
    char sen[100];
    scanf("%s",sen);
    int maxn=0,minn=100;
    for(int i=0;sen[i]!='\0';i++)
    {
        int f=1;
        for(int k=i-1;k>=0;k--)
        {
            if(sen[k]==sen[i])
            {
                f=0;
                break;
            }
        }
        if(f)
        {
            int count=1;
            for(int j=i+1;sen[j]!='\0';j++)
            {
               if(sen[i]==sen[j])
               count++;
            }
            if(count>maxn)
            maxn=count;
            if(count<minn)
            minn=count;
        }
    }
    if(f(maxn-minn))
    printf("%s\n%d","Lucky Word",maxn-minn);
    else
     {
        printf("%s\n%d","No Answer",0);
       
     }
    return 0;
}