-
Notifications
You must be signed in to change notification settings - Fork 0
/
第二次作业
59 lines (57 loc) · 784 Bytes
/
第二次作业
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<stdio.h>
#include<string.h>
struct node
{
char name[10000];
char boss[20];
int num;
}data[20000];
int main()
{
int b[10000]={0};
int k=0;
int i=0;
int j,ans=0;
FILE* fp;
fp = fopen("test.txt","r");
rewind(fp);
while(!feof(fp))
{
fscanf(fp,"%s %s %d\n",data[i].name,data[i].boss,&data[i].num);
i++;
}
fclose(fp);
for(j=0 ; j<i ; j++)
{
if(data[j].num>=100 )
{
b[k]=j;
k++;
}
}
//printf("%d",k);
for(i=0;i<=k-1;i++)
{
for(j=i+1;j<=k-1;j++)
{
if(strcmp(data[b[i]].name,data[b[j]].name)==0)
b[j]=10050; //测试数据最多就到10001
}
}
for(i=0;i<=k-1;i++)
{
if(b[i]!=10050)
{
ans++;
}
}
printf("%d\n",ans);
for(i=0;i<=k-1;i++)
{
if(b[i]!=10050)
{
printf("%s\n",data[b[i]].name);
}
}
return 0;
}