label
stringlengths
1
2
index
stringlengths
1
5
code
stringlengths
87
8.24k
14
6600
void main() { struct student { long num; int chinese; int math; }; struct student stu[100001]; int i,t,h,l=0; long n; int a[100001]; scanf("%ld",&n); for(i=0;i<n;i++) scanf("%d%d%d",&stu[i].num,&stu[i].chinese,&stu[i].math); for(i=0;i<n;i++) a[i]=stu[i].chi...
14
6601
int main(int argc, char* argv[]) { int x,i,n,m=0,j=0,k=0,s,l1,l2,l3; int a[100000],b[100000]; scanf("%d",&n); for (i=1;i<=n;i++) { scanf("%d%d%d",&x,&(a[i]),&(b[i])); s=a[i]+b[i]; if(s>m) { j=m; m=s; l2=l1; l1=i;} else if(s>j) { k=j; j=s; l3=l2; l2=i;} else if(s>k) { k=s; ...
14
6602
struct stu { int num; int m; int c; int sum; }; int main() { long int n; int a=0,b=0,c=0,x=0,y=0,z=0; struct stu student[65535]; scanf("%d",&n); for (int i=0;i<n;i++) { scanf("%d %d %d",&student[i].num,&student[i].c,&student[i].m); student[i].sum=student[i].m+student[i].c; } for (int i=0;i<n;i...
14
6603
void main() { struct data { int number; int chinese; int math; int total; }student[100000],temp; long n,i,j; scanf("%ld",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&student[i].number,&student[i].chinese,&student[i].math); student[i].total=student[i].chinese+student[i].math; } for(i=0;i<3;i++) f...
14
6604
struct student { long num; int math; int chinese; struct student *next; }; long stu_num; struct student *max1,*max2,*max3; struct student *creat(void) { struct student *head,*p1,*p2; long n; p1=p2=(struct student *)malloc(LEN); scanf("%ld%d%d",&p1->num,&p1->math,&p1->chinese); head=NULL; n=0; while(n<stu_n...
14
6605
main() { struct student{ int id; float yuwen,shuxue,sum; }stu[100000],t; int n,i,j; scanf("%d",&n); for(i=0;i<n;i++) {scanf("%d %f %f",&stu[i].id,&stu[i].yuwen,&stu[i].shuxue); stu[i].sum=stu[i].yuwen+stu[i].shuxue;} for(i=0;i<3;i++) for(j=n-1;j>i;j--) if(stu[j].sum>stu[j-1].sum) ...
14
6606
int main() { struct st {int id; int yu; int ma; }; int n,i; struct st st1={0,0,0},st2={0,0,0},st3={0,0,0},stn; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%d%d",&stn.id,&stn.yu,&stn.ma); if(stn.yu+stn.ma>st1.yu+st1.ma){ st3=st2; st2=st1; st1=stn; }else{ if(stn.yu+stn.ma>st2.yu+st2.ma){ st...
14
6607
int main() { int n; scanf("%d",&n); struct student { int num; int yu; int shu; }a[100000]; int d[100000]; int i=0;; for(i=0;i<n;i++) { scanf("%d %d %d",&a[i].num,&a[i].yu,&a[i].shu); d[i]=a[i].yu+a[i].shu; } int q,w,e,h; q=0; w=0;e=0; for(i=0;i<n;i++) { if(d[q]<d[i]) { q=i; } } for(i...
14
6608
int main() { int i,j,n; struct point { int m,x,y; }a[100000],aa; scanf ("%d",&n); for (i=0;i<n;i++) { scanf ("%d%d%d",&a[i].m,&a[i].x,&a[i].y); } for(i=0;i<3;i++) { for (...
14
6609
struct stu { int no; int chi; int math; int sum; struct stu *next; }; void main() { struct stu a,*head,*p,*tail,*q; int k,i,m1,m2,m3,n1,n2,n3,temp1,temp2; head=NULL; scanf("%d",&k); for(i=0;i<k;i++) { p=(struct stu*)malloc(LEN); scanf("%d %d %d",&p->no,&p->chi,&p->math); p->sum=(p->chi+p->math...
14
6610
struct { int ID[100000],Chinese[100000],Maths[100000]; }stu; int main() { int n,i,sum[100000],max1=0,max2=0,max3=0,num1,num2,num3; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d %d %d",&stu.ID[i],&stu.Chinese[i],&stu.Maths[i]); } i=0; while(stu.ID[i]>0){ sum[i]=stu.Chinese[i]+stu.Maths[i]; i++; } i=0; while(i...
14
6611
struct Student { int num,yuwen,shuxue,sum; }; void main() { int n,max1=0,max2=0,max3=0,stu1=0,stu2=0,stu3=0; struct Student student[100000],*stu; scanf("%d",&n); for(stu=student;stu<student+n;stu++){ scanf("%d",&stu->num); scanf("%d",&stu->yuwen); scanf("%d",&stu->shuxue); (stu->sum)=(stu->yuwen)+(stu->...
14
6612
struct student { int num; int yu; int shu; struct student *next; }; int n; struct student *creat(void) { int i; struct student *head; struct student *p1,*p2; scanf("%d",&n); p1=p2=(struct student*)malloc(LEN); scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu); head=p1; for(i=1;i<=n-1;i++) { p1=(struct student*...
14
6613
struct student { int num; int chinese; int maths; int sum; struct student *next; }; int m,max[3]={0},t[3]={0}; struct student *head; struct student *p1,*p2; struct student *creat(int n) { m=0; p1=p2=(struct student*)malloc(LEN); scanf("%d %d %d",&p1->num,&p1->chinese,&p1->maths); p1->sum=p1->chinese+p1->maths;...
14
6614
void main() { struct student { int num; int sum; }stu[100000],temp; int total,i,j,chin,math; scanf("%d",&total); for(i = 0;i<total;i++) { scanf("%d %d %d",&stu[i].num,&chin,&math); stu[i].sum = chin+math; } for(i = 2;i<5;i++) { for(j = total-i;j>=0;j--) { if(stu[j].sum<stu[j+1].sum) { te...
14
6615
struct student { int no; int yuwen; int shuxue; int total; }; void main() { int n,i; struct student *p,*stu,temp; scanf("%d",&n); stu=(struct student *)calloc(n,sizeof(struct student)); for(p=stu;p-stu<n;p++) { scanf("%d%d%d",&p->no,&p->yuwen,&p->shuxue); p->total=p->yuwen+p->shuxue; } for(i=0;i<3;i++) ...
14
6616
struct student { int id; int chinese; int math; int total; }; int main() { int i, num; struct student stu[100000]; int max_0 = 0, max_1 = 0, max_2 = 0; int max_0_id, max_1_id, max_2_id; scanf("%d", &num); for (i = 0; i < num; ++i) { scanf("%d %d %d", &(stu[i].id), &(stu[i].chinese), &(stu[i].math)); s...
14
6617
int main() { struct student { int ID,Chinese,math,sum; } stu[100000],temp1,temp2,temp3; int n,i,j,k; scanf("%d\n",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&stu[i].ID,&stu[i].Chinese,&stu[i].math); stu[i].sum=stu[i].Chinese+stu[i].math; } temp1=stu[0]; for(i=1;i<n-1;i+...
14
6618
int main() { struct score { int n; int a; int b; int c; }score[5]; int i,m; scanf("%d",&m); score[1].n=0; score[1].c=0; score[2].n=0; score[2].c=0; score[3].n=0; score[3].c=0; for (i=0;i<m;i++) { scanf("%d%d%d",&score[4].n,&score[4].a,&score[4].b); score[4].c=score[4].a+score[4].b; if (score...
14
6619
struct student { int num; int yw; int sx; int he; }student[100000]; int main() { int i,n,j,s=0,m; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&student[i].num,&student[i].yw,&student[i].sx); student[i].he=student[i].yw+student[i].sx; } for(i=0;i<n;i++) ...
14
6620
struct student { int num; int chn; int math; int sum; }stu[100000]; main() { int n,i; scanf("%d",&n); for(i=0;i<n;i++) {scanf("%d%d%d",&stu[i].num,&stu[i].math,&stu[i].chn); stu[i].sum=stu[i].math+stu[i].chn; } int j,sum...
14
6621
int main() { long n,i,j,math[100000],chin[100000],total[100000],id[100000]; scanf("%ld",&n); for(i=0;i<n;i++) {scanf("%ld",&id[i]); scanf("%ld",&math[i]); scanf("%ld",&chin[i]);} for(i=0;i<n;i++) {total[i]=100000*(math[i]+chin[i])+100000-id[i];} int comp(const void *a,const void *b);...
14
6622
struct Student { int Num; int Chinese; int Math; int Sum; }; int main() { int n,i,s; scanf("%d",&n); struct Student stu[n]; struct Student temp,*p=stu; for(i=0;i<n;i++) { scanf("%d%d%d",&stu[i].Num,&stu[i].Chinese,&stu[i].Math); stu[i].Sum=stu[i].Chinese+...
14
6623
struct Student { int number; int a; int b; int c; }; int main() { int n, i; int x, y, z; struct Student stu; struct Student maxStu, smaxStu, tmaxStu; scanf("%d",&n); scanf("%d%d%d",&x,&y,&z); stu.number = x; stu.a = y; stu.b = z; stu.c = stu.a + stu.b; maxStu = stu; smaxStu = stu; tmaxStu = stu; ...
14
6624
struct student{ int j; int x,y; int z; }stu[100000]; int main(int argc, char* argv[]) { int n,i,a=0,b=0,c=0,a1,b1,c1; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&stu[i].j,&stu[i].x,&stu[i].y); stu[i].z=stu[i].x+stu[i].y; } for(i=0;i<n;i++) { if(a<stu[i].z) { a=stu[i].z; a1=i; }...
14
6625
int n,i,max=0,d,t=0; struct stu { int id; int chi; int ma; struct stu *next; } *p1,*p2; struct stu *creat(void) { struct stu *head; scanf("%d",&n); p2=p1=(struct stu *)malloc(sizeof(struct stu)); for(i=0;i<n;i++) { scanf("%d %d %d",&p1->id,&p1->chi,&p1->ma); if(i==0) head=p1; else p2->next=p1; p2=p...
14
6626
int main(){ int n,i,j,temp; cin>>n; struct stu{ int xuehao[100000]; int yuwen[100000]; int shuxue[100000]; int zongfen[100000]; }a; for(i=0;i<n;i++) { cin>>a.xuehao[i]; cin>>a.yuwen[i]; cin>>a.shuxue[i]; a.zongfen[i]=a.shuxue[i]+a.yuwen[i]; } for(i=n-1;i>=n-3;i--) for(j=i;j>=1;j--) if(a.zon...
14
6627
struct student {int num; int yu; int shu; int score; struct student *next; }; void main() { int n,i,max; struct student *p1,*p2,*head; p1=p2=head=NULL; scanf("%d",&n); for(i=0;i<n;i++) { p1=(struct student *)malloc(sizeof(struct student)); scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu); p1->score=p1->yu...
14
6628
int main() { struct student{ long num; long chinese; long maths; long sum; }t[100000]; long n,i,j,k,tmp; scanf("%ld",&n); for(i=0;i<n;i++) { scanf("%ld %ld %ld",&t[i].num,&t[i].chinese,&t[i].maths); } for(i=0;i<n;i++) { t[i].sum=t[i].chinese+t[i].maths; } for(i=0;i<3;i++) { k=i; fo...
14
6629
struct Stu{ int StuNo; int Chinese; int math; int sum; struct Stu *next; }; void main() { struct Stu *p,*head,*tail; int n,i,max1,max2,max3,n1,n2,n3; scanf("%d",&n); head=tail=NULL; for(i=1;i<=n;i++) { p=(struct Stu*)malloc(len); scanf("%d%d%d",&p->StuNo,&p->Chinese,&p->math); if(head==NULL) head=ta...
14
6630
int main() { struct stu { int num; int ch; int ma; int to; }; int i,j1,j2,j3,k,max; struct stu student[100000]={0}; struct stu temp; scanf("%d",&k); for(i=0;i<=k-1;i++) { scanf("%d%d%d",&student[i].num,&student[i].ch,&student[i].ma); student[i].to=student...
14
6631
struct student { int num; int yu; int shu; int he; struct student *next; }; struct student *create(int n) { struct student *head,*p1,*p2; int i; p1=(struct student*)malloc(len); scanf("%d %d %d",&p1->num,&p1->yu,&p1->shu); p1->he=p1->yu+p1->shu; p1->next=NULL; head=p1; p2=p1; for(i=1;i<=n-1;i++) { p...
14
6632
void main() { int i,n,j,max; scanf("%d",&n); struct student { int num; int yuwen; int shuxue; struct student * next; }; struct student *head,*ppre,*p0,*p3; struct student *p1,*p2; head=p1=p2=(struct student *)malloc(sizeof(struct student)); for(i=0;i<n;i++)...
14
6633
/*???????? *????? *???1000010549 *???2010-12-25 */ struct student{ int num; int scorec; int scorem; int score; }; int main(){ int n; int i; struct student stu[100001]; int best[2][3]={{0,0,0},{0,0,0}}; cin>>n; for(i=1;i<=n;i++) { cin>>stu[i].num>>stu[i].scorec>...
14
6634
struct stu { int id; int verbal; int math; int sum; }; int main() { struct stu *a,t; int n,i,j; scanf("%d",&n); a=(struct stu *)malloc(n*sizeof(struct stu)); for (i=0;i<n;i++) { scanf("%d %d %d",&a[i].id,&a[i].verbal,&a[i].math); a[i].sum=a[i].verbal+a[i].math; } for (j=0;j<3;j++) for (i=n;i>j...
14
6635
struct score { long num; int yu; int shu; int sum; }stu[100000]; void main() { long i,n,j,k; int t; scanf("%ld",&n); for(i=0;i<n;i++) { scanf("%ld%d%d",&stu[i].num,&stu[i].yu,&stu[i].shu); stu[i].sum=stu[i].yu+stu[i].shu; } for(i=0;i<3;i++) { for(j=0;j<n-i-1;j++) if(stu[j].sum>stu[j+1].s...
14
6636
struct stu { int ID; int c; int m; }; struct stu a[100000]; int main(int argc, char* argv[]) { int n,i,x,y,z,t,q,w,e; int b[100000]; scanf("%d\n",&n); for(i=0;i<n;i++) { scanf("%d ",&a[i].ID); scanf("%d ",&a[i].c); scanf("%d",&a[i].m); } for(i=0;i<n;i++) b[i]=a[i].c+a[i].m; if(b[0]>b[1]&&b[1]...
14
6637
int main() { struct student { int num; int chinese; int math; int sum; }m[4],t; int n,i; scanf("%d",&n); for(i=1;i<=3;i++) m[i].sum=-1; for(i=1;i<=n;i++) { scanf("%d %d %d",&t.num,&t.chinese,&t.math); t.sum=t.chinese+t.math; if(t.sum>m[1].sum) { m[3]=m[2]; m[2]=m[1]; m[1]=t; } els...
14
6638
struct a { char No[20]; int y; int s; struct a* next; }; int n; struct a* creat(void) { struct a *p1,*p2,*head; int i; scanf("%d\n",&n); p1=p2=(struct a* )malloc(LEN); head=NULL; for(i=0;i<n;i++) { scanf("%s %d %d",p1->No,&p1->y,&p1->s); if(i==0)head=p1; else p2->next=p1; p2=p1; p1=(struct a* )mall...
14
6639
struct student { int ID; int chinese; int math; int total; }st[4],temp; int main() { int n,cnt=3; cin>>n; for(int i=0;i<3;i++) { cin>>st[i].ID>>st[i].chinese>>st[i].math; st[i].total=st[i].chinese+st[i].math; } do{ cin>>st[3].ID>>st[3].chinese>>st[3].math; st[3].total=st[3].chinese+st[3].math; ...
14
6640
int main() { int n,i,p,q,c,d; int a[100000]; scanf("%d",&n); struct student { int num; int score1; int score2; }stu[100000]; for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].num,&stu[i].score1,&stu[i].score2); } for(i=0;i<n;i++) { ...
14
6641
struct Student { long id; int chn; int mth; int total; struct Student *next; }; struct Student * insert(struct Student *head,struct Student *stu) { int j=0; struct Student *p0,*p1,*p2; p1=head; p0=stu; if(head==NULL) {head=p0;p0->next=NULL;} else { while((p0->total<=p1->total)&&(p1->next!=NULL)&&j<4) {p2=p1;p1=p1->nex...
14
6642
void main() { struct student { int num,sum; } stu[100000]; int n,i,j,t,chi,math; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%d %d %d",&stu[i].num,&chi,&math); stu[i].sum=chi+math; } for (i=0;i<3;i++) { for (j=n-1;j>i;j--) { if (stu[j].sum>stu[j-1].sum) { t=stu[j].sum; stu[j].sum=stu[...
14
6643
int main() { struct student { int num; int yuwen; int math; int zong; }; struct student stu[100000]; struct student *p,*p1,*p2,*p3,*p4; int n; scanf("%d",&n); for(p=stu;p<stu+n;p++) { scanf("%d",&p->num); scanf("%d",&p->yuwen); scanf("%d",&p->math); } for(p=stu;p<stu+n;p++) { (p->zong)=(p->yuwen)+(...
14
6644
int main() { struct student {int num; int chi; int math; }stu[100000]; int n,i,j,mid; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%d%d",&stu[i].num,&stu[i].chi,&stu[i].math); } for(i=0;i<3;i++){ for(j=n-1;j>0;j--){ if(stu[j].math+stu[j].chi>stu[j-1].chi+stu[j-1].math){ mid=stu[j].num; s...
14
6645
int main(){ int num; cin>>num; struct { int No; int Chinese; int Math; int Sum; //?? }student[100000],t; //?????? int i,j; for(i=0;i<num;i++){ cin>>student[i].No>>student[i].Chinese>>student[i].Math; student[i].Sum=student[i].Math+student[i].Chinese; } for(i=0;i<3;i++) //???? for(j=0;j<num-1...
14
6646
struct student {long num; int yuwen; int shuxue; int sum; struct student *next; }; int n; void main() { struct student *creat(void); void shuchu(struct student *head); int i; struct student *head; scanf("%d",&n); head=creat(); for(i=0;i<3;i++) shuchu(head); } struct student *creat(void) { int i,k=0; struct s...
14
6647
struct student { int stuID; int yuwen; int shuxue; int zongfen; }stu[100000]; int main() { int i,n,j,x,str; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].stuID,&stu[i].yuwen,&stu[i].shuxue); stu[i].zongfen=stu[i].yuwen+stu[i].shuxue; } for(i=0;i<3;i++) { for(j=0;j<n-1;j++) { if(stu[j...
14
6648
void main() { int n,i,j,k=0,e=0,max,y;scanf("%d",&n); struct st { int a;int z;int c; int d; }b[100000]; for(i=0;i<n;i++) { scanf("%d%d%d",&b[i].a,&b[i].z,&b[i].c);b[i].d=b[i].z+b[i].c; } for(i=0;i<n;i++) { max=0; for(j=0;j<n;j++) {if(b[j].d>max){max=b[j].d;y=j;}} printf("%d %d\n",b[y].a,b[y].d);e++;b[y].d=...
14
6649
/* * 1000012826_????????.cpp * * Created on: 2010-12-24 * Author: Administrator */ struct Student{ int num; int mscore; int cscore; int total; }stu[100001]; int main(){ int n,i,m=0,b[201][100]={0},a[201][100]={0},j=200,count=3,k=0,c[201]={0}; cin>>n; for(i=0;i<n;i++){ cin>>stu[i].num; cin>>stu...
14
6650
struct score {int num; int yuwen; int shuxue; int total; struct score*next; }; int n; struct score*creat() {struct score*p1,*p2,*head; head=p2=(struct score*)malloc(len); scanf("%d%d%d",&p2->num,&p2->yuwen,&p2->shuxue); p2->total=p2->shuxue+p2->yuwen; n--; while(n--) {p1=(struct score*)malloc(len); scan...
14
6651
struct student{ int xuehao; int yuwen; int shuxue; int mark; struct student *next; }; int n; struct student *creat(int max) { struct student *head; struct student *p1,*p2; n=0; p1=p2=(struct student *)malloc(LEN); scanf("%d %d %d",&p1->xuehao,&p1->yuwen,&p1->shuxue); head=p1; while(n<max-1) { n++; ...
14
6652
int main(int argc, char* argv[]) { int n,a[99999],b[2],i,k,m,s[99999],first=0,x,y; scanf ("%d",&n); for (i=0;i<n;i++) { scanf ("%d",&a[i]); for (k=0;k<2;k++) { scanf("%d",&b[k]); } s[i]=b[0]+b[1]; } for (m=0;m<3;m++) { first=0; for (x=0;x<n;x++) { if (s[x]>first) {f...
14
6653
int main() { struct gpa { int num; int math; int chin; int total; } STUDENT_NUM[100000], first,second,third; int num,math,chin; long n,i; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&num); scanf("%d",&math); sca...
14
6654
struct student { int id; int cs; int ms; int s; struct student *next; }; void main() { int n,i,m=0; scanf("%d",&n); struct student *head,*p1,*p2; p1=p2=(struct student *)malloc(LEN); scanf("%d %d %d",&p1->id,&p1->cs,&p1->ms); p1->s=p1->cs+p1->ms; head=NULL; while(p1->id!=n) { m=m+1; if(m==1) head=p1; ...
14
6655
struct student { int xuehao; int shuxue; int yuwen; int zongfen; }; int main() { int n,i,e,j; scanf("%d", &n); struct student stu[100001]; for(i=0;i<n;i++) { scanf("%d %d %d", &stu[i].xuehao,&stu[i].shuxue,&stu[i].yuwen); stu[i].zongfen=stu[i].shuxue+stu[i].yuwen; } for(i=1;i<4;i++) { for(j=...
14
6656
struct Student {int ID; int chi; int math; int total; }; int main() { struct Student stu[100000]; struct Student temp; int i,n,j,m; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d %d %d",&stu[i].ID,&stu[i].chi,&stu[i].math); stu[i].total=stu[i].chi+stu[i].math; } for(j=1;j<4;j++){ for(m=0;m<n-j;m++){ if(stu[m].total>=st...
14
6657
int main() { struct a { int h; int y; int s; }b[100000],e; int c[100000]; int n,i,f,j,d; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&b[i].h,&b[i].y,&b[i].s); } for(i=0;i<n;i++) { c[i]=b[i].y+b[i].s; } for(j=0;j<3;j++) { for(i=j+1;i<n;i++) { ...
14
6658
/* * jiegou1.cpp * * Created on: 2010-12-24 * Author: l */ struct student { int No; int china; int math; };//????student int main(){ int n; cin>>n; struct student st[n];//??n????????st?n??????? int i; for(i=0;i<n;i++) cin>>st[i].No>>st[i].china>>st[i].math; int s; int a1=0,a2=0,a3=0,b1=0,b2=0,b...
14
6659
struct student { int num; float chinese; float math; float sum; }; void main() { int n,i; struct student *pt,*p,temp; scanf("%d",&n); pt=(struct student *)malloc(n*LEN); for(p=pt;p<pt+n;p++) { scanf("%d%f%f",&p->num,&p->chinese,&p->math); p->sum=p->chinese+p->math; } for(i=0;i<3;i++)...
14
6660
struct s{ int num; int x; int y; int z; }s[100000],s1,s2,s3,A; int main(int argc, char* argv[]) { int n; scanf("%d",&n); int i; for(i=0;i<n;i++) { scanf("%d %d %d",&s[i].num,&s[i].x,&s[i].y); s[i].z=s[i].x+s[i].y; } if(s[0].z>=s[1].z) { s1=s[0]; s2=s[1]; } else { s1=s[1]; s2=s[0]; } if(s[2]...
14
6661
int main() { struct student { int num; int math; int chinese; int sum; }a[100000]; int n,i,j,temp; char c[10]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&a[i].num,&a[i].math,&a[i].chinese); a[i].sum=a[i].math+a[i].chinese; } for(i=0;i<3;i++) { for(j=i+1;j<n;j++) { if(a[i].sum<a[j...
14
6662
struct student { int id; int ch; int math; }; void main() { struct student stu[100000]; int n,i,j,sum=0,id1=0,flag=0; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %d %d",&stu[i].id,&stu[i].ch,&stu[i].math); for(i=0;i<3;i++) { for(j=0;j<n;j++) { if((stu[j].ch+stu[j].math)>sum) {sum=stu[j].ch+stu[j].math; id1=stu[j].id; fl...
14
6663
int main() { struct{ int n; int a; int b; }n[100000]; int m,i,sum[100000],first,second,third,d,e,f; scanf("%d",&m); for(i=0;i<m;i++) { scanf("%d",&n[i].n); scanf("%d",&n[i].a); scanf("%d",&n[i].b); sum[i]=n[i].a+n[i].b; } if(sum[0]>sum[1]&&sum[0]>sum[2]&&sum[1]>sum[2]) { first=sum[0]; second=...
14
6664
int main() { int a[100001][5]; int i , j , n, k = 3, max = 0, t=0; scanf( "%d",&n ); for( i = 1 ;i <= n;i++ ) {scanf("%d%d%d",&a[i][1], &a[i][2], &a[i][3]); a[i][4] = a[i][2] + a[i][3]; } while( k-- ) { for( i = 1;i <= n ;i++ ) { if( a[i][4] > max ) {m...
14
6665
int main() { int num[3], chinese[100000], math[100000], sum[100000]; int m, i, n; cin >> n; for (i = 0; i < n; i ++) { cin >> m >> chinese[i] >> math[i]; sum[i] = chinese[i] + math[i]; } int largest = 0; for (i = 0; i < 3; i ++) { largest = 0; for (int j = 0; j < n; j ++) if (sum[j] > largest) { ...
14
6666
struct Student{//????? int nID,nChinese,nMath; }; void main(){ int n,i,a1,a2,a3,t1,t2,t3,t;//a1,a2,a3????????ID?t1,t2,t3???? struct Student students; t1=0; t2=0; t3=0; a1=0; a2=0; a3=0; scanf("%d",&n); for (i=1;i<=n;i++){ scanf("%d%d%d",&students.nID,&students.nChinese,&students.nMath); t=students.nChine...
14
6667
struct stu { int num; int yuwen; int shuxue; int sum; }score[100000]; int main() { int n,i,a,b,c,a1,b1,c1; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%d%d",&score[i].num,&score[i].yuwen,&score[i].shuxue); score[i].sum=score[i].shuxue+score[i].yuwen; }a=0; b=0; c=0; a1=0; b1=0; c1=0; for(i=0;i<n;...
14
6668
struct stu { int a; int b; int c; struct stu *next; }; void main() { int i,j,n,t,sum[100000]; struct stu *head,*p1,*p2; scanf("%d",&n); p1=(struct stu*)malloc(sizeof(struct stu)); scanf("%d%d%d",&(p1->a),&(p1->b),&(p1->c)); sum[0]=p1->b+p1->c; head=p1; p2=p1; for(i=1;i<n;i++) { p1=(stru...
14
6669
int a[100000][3],s[100000],x=0,y=0,z=0,x1=0,y1=0,z1=0; int main() { int n,i,j; scanf("%d",&n); for (i=1;i<=n;i++) { for (j=0;j<3;j++) {scanf("%d",&a[i][j]);} s[i]=a[i][1]+a[i][2]; } for (i=1;i<=n;i++) { if (s[i]>x) { x=s[i]; x1=a[i][0];} } for (i=1;i<=n;i++) { if(s...
14
6670
struct student { int num; int chinese; int math; int sum; }; void main() { int n,i,j; struct student stu[100000]; struct student stud; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&stu[i].num,&stu[i].chinese,&stu[i].math); stu[i].sum=stu[i].chinese+stu[i].math; } for(i=0;i<3;i++) { for(j=i+1;j<n...
14
6671
int main() { int n; scanf("%d",&n); struct student{ int num; int chi; int math; int sum; }; struct student*fig; fig=(struct student*)malloc(sizeof(student)*n); int i,a=0,b=0,c=0,numa=0,numb=0,numc=0; for(i=0;i<n;i++) { scanf("%d%d%d",&(fig+i)->num,&(fig+i)->chi,&(fig+i)->math); (fig+i)->sum=(fig+i)...
14
6672
int main() { int n,i; int fir=0,sec=0,thi=0; int fir_n=0,sec_n=0,thi_n=0; struct { int num; int ma; int cn; int score; }s; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&s.num,&s.ma,&s.cn); s.score=s.ma+s.cn; if(s.score>fir) { thi=sec; thi_n=sec_n; sec=fir; sec_n=fir_n; ...
14
6673
struct student{ int num; int chin; int math; int sum; }tem_stu; int main() { int n,i; scanf("%d",&n); struct student *stu; stu=(struct student*)malloc(n*sizeof(int)*4); for(i=0;i<n;i++){ scanf("%d%d%d",&stu[i].num,&stu[i].chin,&stu[i].math); stu[i].sum=stu[i].chin+stu[i].math; } int j; for(j=1;j<4;...
14
6674
int pfCompare( const void*elem1, const void*elem2) { int *p1,*p2; p1=(int*)elem1; p2=(int*)elem2; return (*p2)-(*p1); } int main() { int n; scanf("%d",&n); int a[n],b[n],c[n],d[n],e[n]; int i; for(i=0;i<n;i++) { scanf("%d %d %d",&a[i],&b[i],&c[i]); ...
14
6675
struct stu { int num; struct stu *next; }; void main() { int i=0,n,a,b,score,first=0,second=0,third=0; struct stu *head,*p,*p1,*p2,*p3; scanf("%d",&n); head=p=(struct stu *)malloc(sizeof(struct stu)); while(i++<n) { scanf("%d %d %d",&(*p).num,&a,&b); score=a+b; if(score>first) { third=second;second=f...
14
6676
void main() { int n,i; int diyi,dier,disan; diyi=0; dier=0; disan=0; struct student { int num; int yuwen; int shuxue; int sum; }stu[99999]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue); stu[i].sum=stu[i].yuwen+stu[i].shuxue; } for(i=0;i<n;i++) {...
14
6677
struct grade { char ID[20]; int math,cn; }; int main(){ int n,i,j,max,m; int *s; struct grade stu[100000]; scanf("%d",&n); s=(int*)malloc(n*sizeof(int)); if(n==1){ scanf("%s %d %d",stu[0].ID,&stu[0].math,&stu[0].cn); printf("%s %d",stu[0].ID,stu[0].math+stu[0].cn); } else if(n==2){ scanf("%s %d %d",stu[...
14
6678
int main() { struct { int number; float score1; float score2; float score3; }stu[100000],temp; int n,i,j; cin>>n; for(i=0;i<=n-1;i++) { cin>>stu[i].number>>stu[i].score1>>stu[i].score2; stu[i].score3=stu[i].score2+stu[i].score1; } for(i=n-1;i>=n-3;i--) for(j=n-1;j>=n-i;j--) if(stu[j-1].scor...
14
6679
struct student { int num; int yw; int sx; }; int main() { int n,i,x=0,y=0,z=0; scanf("%d",&n); struct student a[n]; int b[n]; for(i=0;i<n;i++) { scanf("%d%d%d",&a[i].num,&a[i].yw,&a[i].sx); b[i]=a[i].yw+a[i].sx; } for(i=1;i<n;i++) { ...
14
6680
void main() { struct student { char a[6]; int c; int m; int s; struct student * next; }; struct student * head; struct student * p1,* p2; struct student first={"",0,0,0,0}; struct student second={"",0,0,0,0}; struct student third={"",0,0,0,0}; int n,i,j; char ch; scanf("%d",&n); p1=p2=(struct student *...
14
6681
int main() { int n,i,j,k,l,sum[100001],temp=0; cin>>n; struct student { int ID; int chinese; int math; }person[100001];//???????,??ID????????? for(i=1;i<=n;i++) { cin>>person[i].ID>>person[i].chinese>>person[i].math; sum[i]=person[i].chinese+person[i].math;//???? } for(i=1;i<=n;i++) { if(sum[i]>te...
14
6682
void main() { int n,i,j,t; struct score {int num; int verbal; int math; int sum; }; struct score a[4]; scanf("%d",&n); for(i=0;i<=2;i++) { scanf("%d%d%d",&a[i].num,&a[i].verbal,&a[i].math); a[i].sum=a[i].verbal+a[i].math; } for(i=0;i<=1;i++) for(j=1;j<=2-i;j++) { if(a[i].verbal+a[i].math<a[i+...
14
6683
struct stu1 { long num; int score1; int score2; struct stu1 *next; }; struct stu1 *creat(void) { int n,i=1; struct stu1 *h; struct stu1 *q1,*q2; scanf("%d",&n); q2=q1=(struct stu1 *)malloc(LEN1); h=NULL; while(i<=n) { scanf("%ld %d %d",&q1->num,&q1->score1,&q1->score2); if(i==1){h=q1;} ...
14
6684
main() { struct student {int num; int sc; int sm; int score; } student[100001]; int n,i,j,k,m; scanf("%d",&n); for(i=1;i<=n;i++) {scanf("%d %d %d",&student[i].num,&student[i].sc,&student[i].sm);} for(i=1;i<=n;i++) {student[i].score=(student[i].sc+student[i].sm);} int x,y,...
14
6685
int main(int argc, char* argv[]) { int i; long n; int sum[100000]; int max=0,second=0,third=0; int a=0,b=0,c=0; scanf("%d",&n); struct student { int id; int chi; int math; }; struct student wangchong[100000]; for (i=0;i<n;i++) { scanf("%d%d%d",&wangchong[i].id,&wangchong[i].chi,&wangchong[i].math); ...
14
6686
struct linknode *CreateLinkList(); void DisplayLinkList(struct linknode *linklist1); void qiansan(struct linknode *linklist2); struct linknode { int id; int chinese; int math; int total; int mark; struct linknode *next; }; int main() { qiansan(CreateLinkList()); } struct linknode *CreateLinkList() { long n,i; ...
14
6687
struct student { int num; int Chinese; int math; int sum; }; void main() { int i,n,p,q,r,b=0,c=0,d=0; struct student a[100000]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&a[i].num,&a[i].Chinese,&a[i].math); a[i].sum=a[i].Chinese+a[i].math; if(i==0) p=q=r=a[i].sum; else { if(a[i].sum>p)...
14
6688
struct student { int num; int sum; }; int main() { int n,i,j,t,a,b,m; int tempSum; int tempMax; int rank[3]={0}; scanf("%d",&n); struct student * stu; stu = (struct student *)malloc(sizeof(struct student) * n); for(i=0;i<n;i++) { tempSum = 0; scanf("%d",&s...
14
6689
struct Stu{ int stuID; int mark; }stu[3]={0}; int compare(const void *p1,const void *p2) { struct Stu *a; struct Stu *b; a=(struct Stu*)p1; b=(struct Stu*)p2; if(a->mark>b->mark) return -1; if(a->mark<b->mark) return 1; if(a->mark==b->mark) return 0; } void main(){ int n,i; int ID,chi,math; scanf("%d",&...
14
6690
struct student { int n; int y; int s; }; int cmp(const void *a,const void *b) { return(((struct student *)b)->y > ((struct student *)a)->y?1:-1); } main() { int num; scanf("%d",&num); struct student s[100000]; for(int i=0;i<num;i++) { scanf("%d %d %d",&s[i...
14
6691
struct student { int id; int cs; int ms; int s; struct student *next; }; void main() { int n,i,m=0; scanf("%d",&n); struct student *head,*p1,*p2; p1=p2=(struct student *)malloc(LEN); scanf("%d %d %d",&p1->id,&p1->cs,&p1->ms); p1->s=p1->cs+p1->ms; head=NULL; while(p1->id!=n) { m=m+1; if(m==1) head=p1; ...
14
6692
struct stu {int n; int a; int m; struct stu *next; }; int n,l; struct stu *creat(void) { struct stu *head; struct stu *p,*q; n=0; p=q=(struct stu *)malloc(Len); scanf("%d %d %d",&p->n,&p->a,&p->m); head=Null; for(;n<l-1;) { n++; if(n==1) head=p; else q->next=p; q=p; p=(struct stu *)malloc(Len); s...
14
6693
struct student { int num; int chi; int math; int sum; }; void main() { int n,i,j,max; struct student t,*s; scanf("%d",&n); s=(struct student *)malloc(n*sizeof(struct student)); for(i=0;i<n;i++) { scanf("%d%d%d",&s[i].num,&s[i].chi,&s[i].math); s[i].sum=s[i].chi+s[i].math;} max=0; for(i=0;i<n;i++) { ...
14
6694
int main () { int n,c,m; cin>>n; struct student { int id; int total; }; //????? struct student stu[n+1];//?????? int i,j; for(i=0;i<n;i++){ cin>>stu[i].id>>c>>m; stu[i].total=c+m;//????????? } for(i=n-1;i>n-4;i--) for(j=n-1;j>n-i-1;j--) { if(stu[j].total>stu[j-...
14
6695
struct stu* create(); int compare (const void * a, const void * b); int main() { int i,j=0,n; scanf("%d", &n); struct stu{ int num; int chi; int math; int total; }; struct stu *p=(struct stu*)calloc( n,sizeof(struct stu) ); struct stu *a=p; int *tot=(int *)calloc( n, sizeof(int) ); for(i=0;i<n;i++...
14
6696
struct student { int number; int ch; int ma; int sum; int key; }stu[100000]; void main() { int n,i,max=0,l=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].number,&stu[i].ch,&stu[i].ma); stu[i].sum=stu[i].ch+stu[i].ma; stu[i].key=0; } for(i=0;i<n;i++) if(max<stu[i].sum&&stu[i].key==0) ...
14
6697
int main() { int n,i,j,b,c,d,t,z; struct a { int num; int b; int c; int d; }a[4]; scanf("%d",&n); for(i=0;i<3;i++){ scanf("%d %d %d",&a[i].num,&a[i].b,&a[i].c); a[i].d=a[i].b+a[i].c; } for(j=0;j<2;j++){ for(i=0;i<2-j;i++){ if(a[i].d<a[i+1].d){ t=a[i].d; z=a[i].num; a[i].d=a[i+1].d; ...
14
6698
int main() { struct student{ long num; long chinese; long maths; long sum; }t[100000],l; long n,i,j,k,tmp; scanf("%ld",&n); for(i=0;i<n;i++) { scanf("%ld %ld %ld",&t[i].num,&t[i].chinese,&t[i].maths); } for(i=0;i<n;i++) { t[i].sum=t[i].chinese+t[i].maths; } for(i=0;i<3;i++) { k=i; ...
14
6699
// ?????????? struct record { int stuID; short YuWen; short math; short total; }; struct YyxNode { struct record m_rec; struct YyxNode *next; }; struct YyxLink { int n; struct YyxNode *head; struct YyxNode *tail; }; struct YyxLink *CreateNewLink() { struct YyxLink *newLn; if((newLn=(struct YyxLink*)mall...