关于ACM Let the Balloon Rise问题求助

[PeterSSH]

#include <stdio.h>
#include <string.h>

int main(){
	int num, i, k, j, max, times;
	char **array;
	char maxColor[21];
	while (scanf("%d", &num) != EOF && num != 0)
	{
		getchar();

		array = (char **)malloc(sizeof(char*)*num);
		for (i = 0; i < num; i++)
		{
			array[i] = (char *)malloc(sizeof(char)* 21);
			gets(array[i]);
		}
		max = 0;
		times = 0;

		for (k = 0; k < num; k++)
		{
			for (j = 0; j < num; j++)
			{
				if (strcmp(array[k], array[j]) == 0)
				{
					times++;
				}
			}
			if (times > max)
			{
				max = times;
				strcpy(maxColor, array[k]);
			}
		}
		printf("%s\n", maxColor);
		free(array);
	}
}

求解不知道哪错了，显示Wrong Answer

[PeterSSH]

谢谢三楼更改以后可以通过了

[一起来玩玩呗]

ACM题目下面都有discuss 你在那里面找测试数据 个人觉得你想的太简单了

[sleeplacker]

少了个头文件

#include <stdlib.h>

[logiciel]

如下修改AC.

#include <stdio.h>
#include <string.h>
#include <stdlib.h> //加

int main(){
  int num, i, k, j, max, times;
  char **array;
  char maxColor[21];
  while (scanf("%d", &num) != EOF && num != 0)
  {
    getchar();

    array = (char **)malloc(sizeof(char*)*num);
    for (i = 0; i < num; i++)
    {
      array[i] = (char *)malloc(sizeof(char)* 21);
      gets(array[i]);
    }
    max = 0;
    //删times = 0;

    for (k = 0; k < num; k++)
    {
      times = 0;//加
      for (j = 0; j < num; j++)
      {
        if (strcmp(array[k], array[j]) == 0)
        {
          times++;
        }
      }
      if (times > max)
      {
        max = times;
        strcpy(maxColor, array[k]);
      }
    }
    printf("%s\n", maxColor);
    free(array);
  }
}