2906: 笨小猴

解题思路:

注意事项:

参考代码:

#include <stdio.h>

#include <string.h>

int sort(int as[100],int sz)

{

int max = 0, min = 100;

for (int i = 0; i < sz; i++)

{

if (as[i] > max)

{

max = as[i];

}

if (as[i] < min)

{

min = as[i];

}

}

int c = 0;

for (int i = 1; i <= (max - min); i++)

{

if ((max - min) % i == 0)

{

c++;

}

}

if (c == 2)

{

return (max - min);

}

else

return 0;

}

void judge(char arr[100], int sz)

{

int as[100] = { 0 };

for (int i = 0; i < sz; i++)

{

int c = 0;

for (int j = 0; j < sz; j++)

{

if (arr[i] == arr[j])

{

c++;

}

}

as[i] = c;

}

int c=sort(as,sz);

if (c)

printf("Lucky Word\n%d", c);

else

printf("No Answer\n0");

}

int main()

{

char arr[100] = { 0 };

scanf("%s", arr);

int sz = strlen(arr);

judge(arr, sz);

return 0;

}