16.笨小熊
来源:互联网 发布:如何考取数据分析师 编辑:程序博客网 时间:2024/04/29 04:29
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define NN 55
int sushu(int s)
{
int i=2;
int mark=0;
for (; i<=sqrt(s); i++) {
if (s%i != 0) {
mark=1;
}
else
{
mark = 0;
break;
}
}
if ( s == 2||s == 3) {
mark = 1;
}
return mark;
}
int main()
{
int N;
char **arr;
int i,j;
int max=0,min=100;
int word[100][26]={0};
int select;
scanf("%d",&N);
fflush(stdin);
arr=(char **)malloc(sizeof(char*)*N);
for (i=0; i<N; i++)
{
arr[i]=(char *)malloc(sizeof(char)*NN);
scanf("%s",arr[i]);
fflush(stdin);
}
for (i=0; i<N; i++)
{
for ( j=0; arr[i][j]; j++)
{
word[i][arr[i][j]-'a']++;
}
}
for ( i=0; i<N; i++)
{
max=0;
min=100;
for ( j=0; j<26; j++)
{
if (word[i][j])
{
max= word[i][j]>max?word[i][j]:max;
min= word[i][j]<min?word[i][j]:min;
}
}
select=max-min;
sushu(select)? printf("Lucky word!\n"):printf("No answer!\n");
select?printf("%d\n",select):printf("0\n");
}
return 0;
}
0 0