1
#include <stdio.h>
2
#include <stdlib.h>
3
#include <string.h>
4
char code[1001][17];
5
int num[1001];
6
int main ()
7

{
8
int n;
9
while (scanf ("%d", &n) != EOF && n != 0)
10
{
11
getchar ();
12
memset (code, 0, sizeof (code));
13
memset (num, 0 , sizeof (num));
14
15
for (int i = 0; i < n; i ++) //輸入處理
16
{
17
int j = 0;
18
while ( (code[i][j] = getchar ()) != '\n' ) i 代表這是第幾個(gè)串
19
j ++;
20
}
21
22
23
for (int m = 0; m < n; m ++) //匹配
24
{
25
for (int k = m + 1; k < n; k ++)
26
{
27
if ( !strcmp (code[m], code[k]) ) //相等返回 0
28
num[m]++;
29
}
30
}
31
32
int max = -1; int index = 0;
33
for ( int k = 0; k < n; k ++) //找到出現(xiàn)次數(shù)最多的下標(biāo)
34
{
35
if (max < num[k])
36
{
37
max = num[k];
38
index = k;
39
}
40
}
41
printf ("%s", code[index]);
42
}
43
//system ("pause");
44
return 0;
45
}
46
#include <stdio.h>2
#include <stdlib.h>3
#include <string.h>4
char code[1001][17];5
int num[1001];6
int main ()7


{8
int n;9
while (scanf ("%d", &n) != EOF && n != 0)10

{11
getchar ();12
memset (code, 0, sizeof (code));13
memset (num, 0 , sizeof (num));14
15
for (int i = 0; i < n; i ++) //輸入處理 16

{ 17
int j = 0; 18
while ( (code[i][j] = getchar ()) != '\n' ) i 代表這是第幾個(gè)串19
j ++;20
}21
22
23
for (int m = 0; m < n; m ++) //匹配24

{25
for (int k = m + 1; k < n; k ++)26

{27
if ( !strcmp (code[m], code[k]) ) //相等返回 0 28
num[m]++;29
} 30
}31
32
int max = -1; int index = 0;33
for ( int k = 0; k < n; k ++) //找到出現(xiàn)次數(shù)最多的下標(biāo) 34

{ 35
if (max < num[k])36

{37
max = num[k];38
index = k;39
} 40
}41
printf ("%s", code[index]);42
}43
//system ("pause"); 44
return 0;45
}46



