label
stringlengths
1
2
index
stringlengths
1
5
code
stringlengths
87
8.24k
14
6700
int k[99999]; int x[99999]; int main() { int n,i ,a,b,c,j,r,t,m=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&a,&b,&c);k[a-1]=b+c;x[i]=a; } for(j=n-1;j>=0;j--) { for(r=0;r<j;r++) { if(k[r]>=k[r+1]) { t=k[r+1]; k[r+1]=k[r]; k[r]=t; t=x[r+1]; x[r+1]=x[r]; x[...
14
6701
struct student { int xuehao; int yuwen; int shuxue; int zongfen; }stu[100000]; int main(int argc, char* argv[]) { int n,i; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].xuehao,&stu[i].yuwen,&stu[i].shuxue); stu[i].zongfen=stu[i].yuwen+stu[i].shuxue; } int max1=2,max2=1,max3=0,num1=0,num2=0,n...
14
6702
struct student { int num,z; }a,max1,max2,max3; void main() { int i,n,x,y; scanf("%d",&n); max1.z=-1; max2.z=-1; max3.z=-1; for (i=0;i<n;i++) { scanf("%d %d %d",&a.num,&x,&y); a.z=x+y; if (a.z>max1.z) { max3=max2; max2=max1; max1=a; } else if (a.z>max2.z) { max3=max2; max2=a; }el...
14
6703
struct student { int num; int chn; int math; int sum; }; int main() { int n; int i, j, e; int x; struct student a[100000]; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d %d %d", &a[i].num, &a[i].chn, &a[i].math); a[i].sum=a[i].chn+a[i].math; } for(i=1; i<=3; i++) { for(j=n-i-1; j>=0; j--) { if(a[j...
14
6704
int main() { struct stu { char id[9]; int chn; int math; int both; struct stu *next; }; int n,i; scanf("%d",&n); struct stu *head,*p1,*p2; for(i=0;i<n;i++) { if(i==0) { head=(struct stu*)malloc(sizeof(struct stu)); p1=head; } else { p1->next=(struct stu*)malloc(sizeof(struct stu));...
14
6705
struct student { char num[10]; int grade[2]; }; struct student stu[100000]; int main() { int n,sum[100000],i,count,max,j; count = 1; scanf("%d",&n); for(i=0;i<n;i++) { sum[i]=0; scanf("%s %d %d",stu[i].num,&stu[i].grade[0],&stu[i].grade[1]); sum[i]= stu[i].grade[...
14
6706
void main() { struct student {int num; int score1; int score2; }stu[100000]; long int n; int i,score[100000],max[3]={0},a[3]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&stu[i].num,&stu[i].score1,&stu[i].score2); score[i]=stu[i].score1+stu[i].score2; } for(i=0;i<n;i++) { if(max[...
14
6707
struct Student { int number; int math; int chinese; int total; struct Student *next; }; void main() { int i=0,n,max; struct Student *linkHead, *linkTail, *student,*ppre,*pmax,*premax; scanf("%d",&n); linkHead = linkTail = NULL; //???????????? while(i<n) { student = (struct Student *)malloc(Len); ...
14
6708
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
6709
struct student { int num; int chi; int math; int sum; struct student *next; }; struct student *creat(int n) { int i; struct student *head,*p1,*p2; p1=(struct student*)malloc(sizeof(struct student)); scanf("%d %d %d",&p1->num,&p1->chi,&p1->math); p1->sum=p1->chi+p1->math; head=p1; p2...
14
6710
int main(int argc, char* argv[]) { int n,num,math,china,z,i; int num1=2,num2=1,num3=0,m1=0,m2=0,m3=0; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&num); scanf("%d",&math); scanf("%d",&china); z=math+china; if(z>num3) { num1=num2; m1=m2; num2=num3; m2=m3; num3=z; m3=i; } ...
14
6711
int main(int argc, char* argv[]) { int n,i,j,ta,tb,ts,tnum; int *a,*b,*s,*num; scanf("%d",&n); a=(int*)malloc(sizeof(int)*n); b=(int*)malloc(sizeof(int)*n); s=(int*)malloc(sizeof(int)*n); num=(int*)malloc(sizeof(int)*n); for(i=1;i<=n;i++) { scanf("%d%d%d",&num[i],&a[i],&b[i]); s[i]=a[i]+b[i]; } f...
14
6712
struct Student { int num; int Chi; int Math; int sum; }; struct Student stud[100000],temp; int main() { int n,i,j; cin>>n; for(i=0;i<n;i++) { cin>>stud[i].num>>stud[i].Chi>>stud[i].Math; stud[i].sum=stud[i].Chi+stud[i].Math; } if(n==2) { if(stud[0].sum<stud[1]....
14
6713
struct point{ int id,a,b,c; }s[100000],tmp; int main(int argc, char *argv[]) { int i,n; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&s[i].id,&s[i].a,&s[i].b); s[i].c=s[i].a+s[i].b; } for(i=1;i<n;i++) { if(s[i].c>s[0].c) { tmp=s[0]; s[0]=s[i...
14
6714
int main() { int n,i,j; cin>>n; struct student { int num; int yuwen; int shuxue; int sum; }stu[100000]; for(i=0;i<n;i++) { cin>>stu[i].num>>stu[i].yuwen>>stu[i].shuxue; stu[i].sum=stu[i].yuwen+stu[i].shuxue; } int max=0,maxj=0; if(n>=3) { for(i=0;i<n;i++) if(stu[i].sum>max) { max=stu[i].sum;...
14
6715
struct student { int num; int chinese; int math; struct student * next; }; int m; struct student * creat(int n) { struct student * head; struct student * p1,*p2; m=0; p1=p2=(struct student*)malloc(sizeof(struct student)); scanf("%d%d%d",&p1->num,&p1->chinese,&p1->math); head=NULL; while(n--) { m=m+1; if...
14
6716
void main() { struct student{ int i; int x; int y; int m; struct student *next; }; int n,j,k; struct student *head,*p1,*p2,*p0; scanf("%d",&n); p1=(struct student*) malloc(LEN); scanf("%d%d%d",&p1->i,&p1->x,&p1->y); p1->m=p1->x+p1->y; p2=(struct student*) malloc(LEN); scanf("%d%d%d",&p2->i,&p2->x,&p2->y); p2->m=p2->x+p...
14
6717
struct student { int number; int math; int chinese; int total; }; int main() { struct student a[100000]; int n,i,sf=0,ss=0,st=0,f,s,t; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%d%d%d",&a[i].number,&a[i].math,&a[i].chinese); a[i].total=a[i].math+a[i].chinese; if (a[i].total>sf) { t=s; st=ss; s=f...
14
6718
void main() { int n,i,k,max,m,c; int a[100000]; struct student { int num; int math; int b; }stu1; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu1.num,&stu1.math,&stu1.b); a[i]=stu1.math+stu1.b; } max=a[0]; for(i=1;i<n;i++) { if(a[i]>max) {max=a[i]; k=i;} } printf("%d ...
14
6719
int main() { struct student { int id; int chinese; int math; int total; }; long int n; int temp; int max = 0, max_1 = 0, max_2 = 0; struct student *p, *p_ori, *p_end, *q; struct student *p_max, *p_max_1, *p_max_2; scanf("%ld",&n); ...
14
6720
struct data { int num[100000],a[100000],b[100000],sum[100000]; }data; int main(int argc, char* argv[]) { int i,n,x=0,y=0,z=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&data.num[i],&data.a[i],&data.b[i]); data.sum[i]=data.a[i]+data.b[i]; } for(i=0;i<n;i++) { if(data.sum[i]>data.sum[x]) { ...
14
6721
struct student { int ID; int yuwen; int shuxue; int zongfen; }; int main() { int n,i,j,e; scanf("%d",&n); struct student*stu=(struct student*)malloc(sizeof(struct student)*n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].ID,&stu[i].yuwen,&stu[i].shuxue); stu[i].zongfen=stu[i].yuwen+stu[i].shuxue; } for(...
14
6722
struct student { int num; int yuwen; int math; int total; struct student *next; }; long m,n,k; struct student *creat(void) { struct student *head; struct student *p1,*p2,*p3; m=0;head=0; while(m<n) { m=m+1; p1=(struct student *)malloc(sizeof(struct student)); scanf("%d %d %d",&p1->num,&p1->yuwen,&p1->math)...
14
6723
struct stu{ long int num[100000]; int y[100000]; int m[100000]; }; int main() { int n,i,temp=0,sum[100000]; struct stu p; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%ld %d %d",&p.num[i],&p.y[i],&p.m[i]); sum[i]=p.m[i]+p.y[i]; } for(i=0;i<n-1;i++){ if(sum[i]>=sum[i+1]){ temp=sum[i+1]; sum[i+1]=sum[i...
14
6724
void main() { int i,j,k,m,n,max; struct stu { int xh; int yw; int sx; int zf; struct stu *next; }; struct stu *p1,*p2,*head; scanf("%d",&n); p2=head=p1=(struct stu *)malloc(sizeof(struct stu)); scanf("%d %d %d",&p1->xh,&p1->yw,&p1->sx); p1->zf=p1->yw+p1->sx; for(i=1;i<n;i++) { p1=(struct stu *)ma...
14
6725
int main(int argc, char* argv[]) { struct student{ int ID,Ch,Ma; }temp; int fID=0,fG=0,sID=0,sG=0,tID=0,tG=0; int n; scanf("%d",&n); int i; for(i=0;i<n;i++) { int sum=0; scanf("%d%d%d",&temp.ID,&temp.Ch,&temp.Ma); sum=temp.Ch+temp.Ma; if(sum==fG) { tG=sG; tID=sID; sG...
14
6726
struct student {int nn; int nnn; int nmn; int sum; }st[100002],tmp; int main() {int i,j,m,n; scanf("%d",&n); for(i=1;i<=n;i++) {scanf("%d %d %d",&st[i].nn,&st[i].nnn,&st[i].nmn); st[i].sum=st[i].nnn+st[i].nmn; } for(i=1;i<=3;i++) {for(j=i+1;j<=n;j++) {if(st[i].sum<st[j].sum) {tmp=st[i]; st[i]=st[j]; s...
14
6727
struct student{ int ID; int yw; int sx; } stu[100000];//?????? int main(){ int num,i,j,sum[100000],t,m; cin>>num; for(i=1;i<=num;i++){ cin>>stu[i].ID>>stu[i].yw>>stu[i].sx; sum[i]=stu[i].yw+stu[i].sx; }//????????? for(i=1;i<4;i++){ for(j=num;j>1;j--){ if(sum[j]>sum[j-1]){ t=sum[j-1];m=stu[j-1].ID; s...
14
6728
struct student { int num; int chinese; int math; int total; }a[100000]; int main() { int n,i; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&a[i].num,&a[i].chinese,&a[i].math); a[i].total=a[i].chinese+a[i].math; } int max,numm; max=a[1].total; for(int j=0;j<3;j++) { for(i=0;i<n;i++) { ...
14
6729
int first[3],firsti[3]; struct stu { int num; int chinese; int math; int sum; struct stu *next; } *p1,*p2; struct stu *creat(int n) { struct stu *head=NULL; p1=p2=(struct stu*)malloc(sizeof(struct stu)); while (n--) { scanf("%d %d %d",&p1->num,&p1->chinese,&p1->math); if(head==NULL) head=p1; ...
14
6730
struct student { int num; int yu; int shu; int sum; } stu[100000]; int main() { int n,i; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d %d %d",&stu[i].num, &stu[i].yu, &stu[i].shu); stu[i].sum=stu[i].shu+stu[i].yu; } int k,e; for(k=0;k<3;k++){ for(i=n-2;i>=k;i--){ if(stu[i].sum<stu[i+1].sum){ e=stu[...
14
6731
int main() { struct student { int num; int chinese; int mathematics; int sum; }temp; struct student stu[100000]; int i,j,n; scanf("%d",&n); for (i=0;i<n;i++){ scanf("%d %d %d",&stu[i].num,&stu[i].chinese,&stu[i].mathematics); stu[i].sum=stu[i].c...
14
6732
int main(){ int n; scanf("%d",&n); struct score{ int id; int yw; int sx; } stu [100000]; int i,j; for(i=0;i<n;i++){ scanf("%d%d%d",&stu[i].id,&stu[i].yw,&stu[i].sx); } for(j=1;j<=3;j++){ int e,max=0; for(i=0;i<=n-j;i++){ if((stu[i].yw+stu[i].sx)>(stu[max].yw+stu[max].sx)){ max=i; } } ...
14
6733
struct student {int num; int score1; int score2; } stu[100000]; void main() { int n,i,sum[100000],max=0,j,k,l; scanf("%d",&n); for(i=0;i<n;i++) {scanf("%d%d%d",&stu[i].num,&stu[i].score1,&stu[i].score2); sum[i]=stu[i].score1+stu[i].score2;} for(i=0;i<n;i++) if(sum[i]>max){max=sum[i];j=i;} max=0; for(i=0;i<...
14
6734
void main() { int n,i,j,k,max=0,smax=0,tmax=0,id[3]={0},a,b,c; struct student { int No; int yuwen; int math; }stu[100000]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&stu[i].No); scanf("%d",&stu[i].yuwen); scanf("%d",&stu[i].math); } for(i=0;i<n;i++) { if(max<stu[i].yuwen+stu[i].math) { ...
14
6735
struct stu { char num[15]; int chinese; int math; int sum; struct stu *next; }; int n; struct stu *creat(void) { struct stu *head,*p,*g,*h; int i,j; p=(struct stu*)malloc(LEN); scanf ("%s %d %d",(*p).num,&(*p).chinese,&(*p).math); (*p).sum=((*p).chinese+(*p).math); for (i=0;;i++) { if (i==0) {head=p;(*p)....
14
6736
struct statistics { int num; int chinese; int math; int sum; } form[100000],temp; int main() { int n; scanf("%d",&n); int i,j; for(i=0;i<n;i++) { scanf("%d %d %d",&form[i].num,&form[i].chinese,&form[i].math); form[i].sum=form[i].chinese+form[i].math; } for(i=0;i<3;i++) { int k=i; for(j=i+1;...
14
6737
void main() { struct student { int ID; int math; int chinese; int sum; }; int n,i,t,j; scanf("%d",&n); struct student stu[n]; for(i=0;i<n;i++) scanf("%d %d %d",&stu[i].ID,&stu[i].math,&stu[i].chinese); for(i=0;i<n;i++) stu[i].sum=stu[i]....
14
6738
void main() { int n; scanf("%d",&n); struct student { int num; int score_1; int score_2; int sum; }; struct student stu[n]; int i,j,t; for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].num,&stu[i].score_1,&stu[i].score_2); stu[i].sum=stu[i].score_1+stu[i].score_2; } for(j=0;j<=2;j++) { for(i=n...
14
6739
struct person { char num[6]; int Chinese; int math; int total; }stu[100000]; int main() { int n, i, max, j, k, temp = 0,tnum = 0; cin >> n; for (i = 0; i < n; i++) { cin >> stu[i].num; cin >> stu[i].Chinese; cin >> stu[i].math; stu[i].total = stu[i].math + stu[i].Chinese; } for (j = 0; j < 3; j+...
14
6740
struct xue { int ID; int sx; int yw; int sum; }xueshen; int main() { int n,i,k; scanf("%d",&n); struct xue *xuesheng; xuesheng=(struct xue*)malloc(4*sizeof(int)*n); for (i=0;i<n;i++){ scanf("%d%d%d",&xuesheng[i].ID,&xuesheng[i].sx,&xuesheng[i].yw); xuesheng[i].sum=xuesheng[i].sx+xuesheng[i].yw; } for...
14
6741
struct mark { int num; int ch; int math; int sum; }stu[100000]; int main(int argc, char* argv[]) { int i,n; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d %d %d",&stu[i].num,&stu[i].ch,&stu[i].math); stu[i].sum=stu[i].math+stu[i].ch; } for(i=0;i<n-1;i++){ if(stu[i].sum>=stu[i+1].sum){ stu[100000]=stu[i];...
14
6742
struct student { long int ID; int math; int chinese; int add; }stu[100000]; main() { long int n; int i,j; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].ID,&stu[i].math,&stu[i].chinese); stu[i].add=stu[i].math+stu[i].chinese; ...
14
6743
struct data { int id; int cs; int ms; int s; }; int cmp(const void *a,const void *b) { return ((struct data*)b)->s - ((struct data*)a)->s; } main() { struct data *a; int n; int i; scanf("%d",&n); a=(struct data *)malloc(n*sizeof(struct data)); for (i=0;i<n;i++) { scanf("%d %d %d",&a[i].id,&a[i].cs,&a[i...
14
6744
int main(int argc, char* argv[]) { int a=0,b=0,c=0; int an,bn,cn; int n,i,sum=0; struct student{ int num,ch,math; }students[100000]; scanf("%d",&n); for (i=0; i<n; i++){ scanf("%d%d%d",&students[i].num, &students[i].ch, &students[i].math); sum = students[i].ch + students[i].math; if (sum > c){ c = sum...
14
6745
struct score { int num; int yuwen; int shuxue; }student[100000]; int max(int a,int b) { return (a>b)?a:b; } int min(int a,int b) { return (a<b)?a:b; } int main() { int max(int a,int b); int total[100000]; int n,i; int max1=0,max2=0,max3=0; int maxnum1=0,maxnum2=0,maxnum3=0; scanf("%d",&n); for(i=0;i<n;i++){...
14
6746
void main() { struct student { int num; int yu; int shu; int c; } s[100000],k; int i,j,n; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&s[i].num,&s[i].yu,&s[i].shu); s[i].c=s[i].yu+s[i].shu; } /* for(i=0;i<n-1;i++) { for(j=0;j<n-1-i;j++) { if(s[j].c<s[j+1].c) { k=s[j]; s...
14
6747
struct stu { int num; int chinese; int maths; }stu[100000]; void main() { int i,j,n,sum[100000],max=0,m; scanf("%d\n",&n); for(i=0;i<n;i++) { scanf("%d %d %d\n",&stu[i].num,&stu[i].chinese,&stu[i].maths); } for(i=0;i<n;i++) { sum[i]=stu[i].chinese+stu[i].maths; } for(j=0;j<3;j++) { for(i=0;i<n;i++) { if(sum[i]>max) {m...
14
6748
struct student { long num; int scorec; int scorem; struct student *next; }; struct student *creat(long n) { struct student *head,*p1,*p2; p1=(struct student*)malloc(LEN); scanf("%ld %d %d",&p1->num,&p1->scorec,&p1->scorem); long s=n-1; p1->next=NULL; head=p1; p2=p1; do { p1=(stru...
14
6749
struct stu { int num; int yw; int sx; int zf; }s1,s2,s3,s; int main() { int n,i; s1.zf=s2.zf=s3.zf=-1; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&s.num,&s.yw,&s.sx); s.zf=s.yw+s.sx; if(s.zf>s1.zf) { s3=s2; s2=s1; s1=s; } else if(s.zf>s2.zf) { s3=s2; s2=s; } else if(s.z...
14
6750
struct Student { int num; int math; int chinese; }stu[100000]; int main() { int n,i,j,s[100000],t[100000],c=0; scanf("%d",&n); for(i=0;i<=(n-1);i++) { scanf("%d%d%d",&stu[i].num,&stu[i].chinese,&stu[i].math); } for(i=0;i<=(n-1);i++) { s[i]=stu[i].math+stu[i].chinese; t[i]=s[i]; } int p; ...
14
6751
int main() { int a[99999],b[99999],c[99999],d[99999]; int i,n,sum,s; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%d%d%d",&a[i],&b[i],&c[i]); d[i]=c[i]+b[i]; } for (i=0;i<n;i++) { if (d[i]>=d[i+1]){ sum=d[i]; d[i]=d[i+1]; d[i+1]=sum; s=a[i]; a[i]=a[i+1]; a[i+1]=s; } } for (i=0;i<n-1;i+...
14
6752
void swap(int *i,int *j) { int *p=i,t=*i; *p=*j; p=j; *p=t; } struct Student { int id; int chinese; int math; }; int main() { void swap(int *i,int *j); int n,i,first,second,third,one,two,three; int *f=&first,*s=&second,*t=&third,*on=&one,*tw=&two,*th=&three; struct Student stu[100000]; scanf("%d",&n); for(...
14
6753
void main() { int i,j,m,n,a[3][2],k; struct student { int num; int s1; int s2; int l; }stu[100000]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].num,&stu[i].s1,&stu[i].s2); stu[i].l=stu[i].s1+stu[i].s2; } for(i=0;i<3;i++) { for(m=0,j=0;j<n;j++) { if(m<stu[j].l) { m=stu[...
14
6754
struct stu{ int ID; int yuwen; int shuxue; int sum; struct stu *next;}; struct stu *creat(long n) {long i; struct stu *p,*q,*head; p=(struct stu *)malloc(LEN); head=q=p; scanf("%d %d %d",&p->ID,&p->yuwen,&p->shuxue),p->sum=p->shuxue+p->yuwen; for(i=1;i<n;i++) { p=(struct stu *)malloc(LEN); scanf("%d %d %d",&p...
14
6755
void main() { struct student { int ID; int chinese; int math; int total; }stu1,stu2,stu3,temp; int i,n; stu1.total=0; stu2.total=0; stu3.total=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&temp.ID,&temp.chinese,&temp.math); temp.total=temp.chinese+temp.math; if(temp.total>stu1.total) {...
14
6756
struct result//??result?????num????????????? { int num; int chn; int math; int total; }; int main() {int n,k; cin>>n; struct result student[n+1];//?result??????student for(k=1;k<=n;k++) {cin>>student[k].num>>student[k].chn>>student[k].math;//?????? student[k].total=student[...
14
6757
int main() { int n,i,first,second,third,x,y,z; scanf("%d",&n); struct mark{ int ID,chinese,math,sum; }*num; num=(struct mark*)malloc(sizeof(mark)*n); int n1,c1,m1; for(i=0;i<n;i++) { scanf("%d %d %d",&n1,&c1,&m1); num[i].ID =n1; num[i].chinese =c1; num[i].math=m1; num[i].sum=c1+m1; } for(i=0;...
14
6758
main() { int n,i; struct student { int num; int yuwen; int shuxue; int zongfen; } stu[100000]; struct qiansan { int num; int zongfen; }st[3]={{0,0},{0,0},{0,0}}; scanf("%d",&n); for...
14
6759
struct student { char id[20]; int chinese; int math; int score; struct student *next; }; int n; struct student *create(int m) { struct student *head; struct student *p1,*p2; n=0; p1=p2=(struct student *)malloc(length); head=null; while(n<m) { scanf("%s %d %d",p1->id,&p1->chinese,&p1->math); n=n+1; ...
14
6760
struct student { int num; int score1; int score2; int total; }stu[100000]; int main() { int n,i,j,k,t; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d %d",&stu[i].num,&stu[i].score1,&stu[i].score2); stu[i].total=stu[i].score1+stu[i].score2; } for(i=0;i<3;i++) { k=i; for(j=i+1;j<n;j++) if(stu...
14
6761
struct student { int ID; int chi; int math; }student[100000]; int main() { int n,i,j,k; scanf("%d",&n); int a[n]; for(i=0;i<n;i++) { scanf("%d %d %d",&student[i].ID,&student[i].chi,&student[i].math); a[i]=student[i].chi+student[i].math; } for(k=0;k<3;k++) { ...
14
6762
void main() { struct student { int id; int chi; int mat; int sum; }stu[100000],t; int i,j,n,student_num; scanf("%d",&student_num); n=student_num; for(i=0;i<n;i++) scanf("%d%d%d",&stu[i].id,&stu[i].chi,&stu[i].mat); for(i=0;i<n;i++) stu[i].sum=stu[i].chi+stu[i].mat; for(i=0;i<n;i++) if(stu[0].su...
14
6763
int main(int argc, char* argv[]) { struct grades{ int id; int yuwen,shuxue; int zongfen ; }grades[100007]; int i,n,j,t,s; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&grades[i].id,&grades[i].yuwen,&grades[i].shuxue); grades[i].zongfen=grades[i].yuwen+grades[i].shuxue; } for(i=0;i<3;i++) { f...
14
6764
struct Student { int ID; int chinese; int maths; int sum; }; int main() { struct Student stu[3],t; //???????? stu[0].sum =stu[1].sum =stu[2].sum =0; //???????0 int i, n; cin >> n; for (i = 0; i < n; i++) { cin >> t.ID >> t.c...
14
6765
struct student { long id; int chinese; int math; int score; struct student *next; }; struct student *creat(void) { int num; struct student *head,*p,*q; q=NULL; head=(struct student *)malloc(len); p=head; scanf("%d",&num); while(num>0) { q=p; scanf("%ld%d%d",&p->id,&p->chinese,&p->math); p->score=p-...
14
6766
struct student { int num; int ch; int ma; int sum; struct student *next; }; int N; int n; struct student *creat(void) { struct student *head; struct student *p1,*p2; n=0; p1=p2=(struct student *)malloc(LEN); scanf("%d %d %d",&p1->num,&p1->ch,&p1->ma); p1->sum=p1->ch+p1->ma; head=null; while(n<N-1) { n=...
14
6767
int main() { int n,i,b,c,d; struct{ int sn; int chi; int mat; int sum; }a[100000]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d %d %d",&a[i].sn,&a[i].chi,&a[i].mat); a[i].sum=a[i].chi+a[i].mat; } b=n; c=n; d=n; a[n].sum=-100; for(i=0;i<n;i++){ if(a[b].sum>=a[i].sum)b=b; else b=i; } for(i=0;...
14
6768
struct student { int num; int yuwen; int shuxue; int total; struct student *next; }; void main() { struct student *head,*p1,*p2,*P; int n,i=0,j=0; scanf("%d\n",&n); p1=p2=head=(struct student *)malloc(LEN); for(i=0;i<n;i++) { p2=p1; scanf("%d%d%d",&p1->num,&p1->yuwen,&p1->shuxue); p1->total=p1->...
14
6769
/* Note:Your choice is C IDE */ void main() { struct student { int a; int b; int c; int d; int h; }s[100000]; int i,j,k,n,max; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d%d%d",&s[i].a,&s[i].b,&s[i].c); s[i].d=s[i].b+s[i].c; s[i].h=-1; } for(i...
14
6770
int main() { int n,i,j,p,q,t; int a[100000][3]; scanf("%d",&n); for(i=0;i<n;i++){ for(j=0;j<3;j++) scanf("%d",&a[i][j]); a[i][1]=a[i][1]+a[i][2]; } for(p=0;p<3;p++){ for(q=n-2;q>=0;q--){ if(a[q][1]<a[q+1][1]){ for(i=0;i<2;i++){ t=a[q][i]; a[q][i]=a[q+1][i]; a[q+1][i]=t; } } }...
14
6771
struct stu { int id; int chn; int math; int sum; }; int main() { struct stu indi[100000]; int n,i,j,rank[3]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%d%d",&indi[i].id,&indi[i].chn,&indi[i].math); indi[i].sum=indi[i].chn+indi[i].math; } for(i=0;i<3;i++){ rank[i]=0; for(j=0;j<n;j++){ ...
14
6772
int main() { struct student { int num; int chinese; int math; int sum; }stu[100001],t; int n,i,j; 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=0;j<n-1-i;j++) { if(stu[j]...
14
6773
struct student { int num; int chinese; int math; }; struct student stu[100000]; int sum[100000]; int main(int argc, char* argv[]) { int a,b,c,num1,num2,num3; int i,n; scanf("%d",&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++) { sum[i]=stu[i...
14
6774
int main() { int n = 0, i = 0, j = 0; cin >> n; int sum[n]; struct student { int stuid; int chin; int math; } stu[n], t; for (i = 0; i < n; i++) { cin >> stu[i].stuid >> stu[i].chin >> stu[i].math; sum[i] = stu[i].chin + stu[i].math; } for (i = 0; i < 3; i++) for (j = 0; j < n -1; j++) if ((stu[j...
14
6775
struct student//????? { int NO; int chinese; int math; }; int main() { struct student a[100001]; int n,i,j; cin>>n; for(i=1;i<=n;i++) cin>>a[i].NO>>a[i].chinese>>a[i].math;//?? for(i=1;i<=3;i++) for(j=n-1;j>=i;j--) if(a[j].chinese+a[j].math<a[j+1].chinese+a[j+1].math)//?????????? { a[0]=a[j]; ...
14
6776
main() { int n,i; struct h { int mun; int chinese; int math; struct h *p; } ; struct h *a,*b,*lily; scanf("%d",&n); a=len; lily=a; for(i=0;i<n;i++) { scanf("%d %d %d",&a->mun,&a->chinese,&a->math); b=len; a->p=b; a=b; } b=NULL; a=lily; int a1=0,a2=0,a3=0,b1=0,b2=0,b3=0,c; for(i=0;i<n;i++) { ...
14
6777
main() { int i,j,k,m=0,n,e,f,g,h; int *a,*b,*c; scanf("%d",&n); a=(int*)malloc(n*sizeof(int)); b=(int*)malloc(n*sizeof(int)); c=(int*)malloc(n*sizeof(int)); for(i=0;i<n;i++) scanf("%d %d %d",&a[i],&b[i],&c[i]); for(i=0;i<n;i++) a[i]=b[i]+c[i]; for(i=0;i<...
14
6778
// ????STUDENT_NUM????????“????”???? //?????????ID??????????????????? //??????????????????????? int n; struct student { int num; int chn; int math; int ovr; struct student *next; }; struct student *creat() { int i; struct student *head; struct student *p1,*p2; head=(struct student *)malloc(sizeof(struct stu...
14
6779
struct student { int name; int ch; int math; }stu[100000]; main() { int n;int sum[100000];int max[3];int i,j,k,m,o;int s; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %d %d",&stu[i].name,&stu[i].ch,&stu[i].math); for(i=0;i<n;i++) { sum[i]=stu[i].ch+stu[i].math; } max[0]=0; ...
14
6780
struct student { int number; int chinese; int math; int num; }stu[100001]; int main ( ) { int n, i, j, max[3][2] = {0}; cin >> n; for(i = 0;i < n;i++)//?????????? { cin >> stu[i].number >> stu[i].chinese >> stu[i].math; stu[i].num = stu[i].chinese + stu[i].math; } for(j = 0;j < 3;j++)//??3?????? { for(...
14
6781
struct stu { char num[15]; int chi; int math; int sum; struct stu *next; }; int n; struct stu *creat(void) { struct stu *head,*p,*g,*h; int i,j; p=(struct stu*)malloc(LEN); scanf ("%s %d %d",p->num,&p->chi,&p->math); p->sum=p->chi+p->math; for (i=0;;i++) { if (i==0) {head=p;head->next=NULL;} else if (i<...
14
6782
int main() { struct Stu { int num; int sco[2]; int sum; }; struct Stu stu[5]; struct Stu temp; int i,j,n,m,k; scanf("%d",&n); if(n>=3) { for(i=0;i<3;i++) { scanf("%d%d%d",&stu[i].num,&stu[i].sco[0],&stu[i].sco[1]); stu[i].sum=stu[i].sco[...
14
6783
struct stu {long num; int Chi; int Math; int Sum; struct stu *next; }*p1,*p2; //???? struct stu * creat(int n) {struct stu *head=NULL; int i; for(i=0;i<n;i++) { p1=(struct stu *)malloc(sizeof(struct stu)); scanf("%d %d %d",&p1->num,&p1->Chi,&p1->Math); p1->Sum=p1->Chi+p1->Math; if(i==0){ head=p1; p2=p1;} else ...
14
6784
int main(int argc, char* argv[]) { int n,i,j,a,zf[100000]; struct student { int name; int yw; int sx; }stu[100000]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%d%d",&stu[i].name,&stu[i].yw,&stu[i].sx); zf[i]=stu[i].yw+stu[i].sx; } for(j=1;j<4;j++){ for(i=0;i<n-j;i++){ if(zf[i]>=zf[i+1]){ a=...
14
6785
struct student{ int No; int Chinese; int math; int score; }stu[100000]; int main(){ int n,i,j,a,b; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d %d %d",&stu[i].No,&stu[i].Chinese,&stu[i].math); stu[i].score=stu[i].Chinese+stu[i].math; } for(j=n-1;j>n-4;j--){ for(i=0;i<j;i++){ if(...
14
6786
void main() { struct stu {int a,b,c;}; int i,n,j=0;scanf("%d",&n); struct stu *hd,*p; hd=p=(struct stu*)malloc(100000*sizeof(struct stu)); for(i=0;i<n;i++,p++) {scanf("%d %d %d",&p->a,&p->b,&p->c);} int max=0; nxt: for(p=hd,i=0;i<n;i++,p++) { if(p->b+p->c>max) {max=p->b+p->c;} } for(p=hd,i=0;i<n;i++,p++) ...
14
6787
int main() { int n,i,j,k,z,x; scanf("%d",&n); struct Student { int num; int yuwen; int shuxue; int zongfen; }stu[n]; for(i=0;i<n;i++) { scanf("%d%d%d",&stu[i].num,&stu[i].yuwen,&stu[i].shuxue); stu[i].zongfen=stu[i].yuwen+stu[i]....
14
6788
struct student { int id; int china; int math; int total; }stu[M],temp; int main() { int n,i,j,count; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&stu[i].id,&stu[i].china,&stu[i].math); stu[i].total=stu[i].china+stu[i].math; } for(i=0;i<3;i++) { temp=stu[i]; count=i; for(j=i+1;j<n;j++) { ...
14
6789
struct student { int num; int score1; int score2; int sum; struct student *next; }; struct student *creat(int m) { int i=0; struct student *head,*p1,*p2; p1=p2=(struct student *)malloc(LEN); scanf("%d %d %d",&p1->num,&p1->score1,&p1->score2); p1->sum=(p1->score1)+(p1->score2); head=NULL; while(p1->...
14
6790
struct student { int num; int score1; int score2; int sum; }stu[100000],max,secondmax,thirdmax; int main() { max.sum=secondmax.sum=thirdmax.sum=0; int i,n; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%d %d %d",&stu[i].num,&stu[i].score1,&stu[i].score2); stu[i].sum=stu[i].score1+stu[i].score2; } for (i=0;i...
14
6791
struct student { int num; int yuwen; int math; int total; struct student *next; }; long m,n; struct student *creat(void) { struct student *head; struct student *p1,*p2; m=0;head=0; while(m<n) { m=m+1; p1=(struct student *)malloc(sizeof(struct student)); scanf("%d %d %d",&p1->num,&p1->yuwen,&p1->math); ...
14
6792
void main() { int n,i,y,s,z,x,a,b,c,ax,bx,cx; scanf("%d",&n);a=0;b=0;c=0;ax=0;bx=0;cx=0; for(i=1;i<=n;i++) { scanf("%d %d %d",&x,&y,&s); z=y+s; if(c>=z) continue; else if(b>=z) {c=z; cx=x;} else if(a>=z) {c=b;cx=bx; b=z; bx=x;} else {c=b; cx=bx; b=a; bx=ax; a=z;ax=x;} } printf("%d %d\n...
14
6793
int main() { int n,i,score[100000],max1=0,m1=0,max2=0,m2=0,max3=0,m3=0; scanf("%d",&n); struct stu{ int No; int yw; int math; }s[100000]; for(i=0;i<n;i++){ scanf("%d%d%d",&s[i].No,&s[i].yw,&s[i].math), ...
14
6794
int cmp(const void *a,const void *b) { return(*(int*)a-*(int*)b); } int main() { struct student { int num; int chinese; int maths; int amount; }; struct student stu[100000]; int a[100000],n,l,j,k; scanf("%d",&n); for (int i=0;i<n;i...
14
6795
int main() { struct ss{ int num,yu,sh; int sum; }; int n,i; struct ss *stu; scanf("%d",&n); stu=(struct ss *)malloc(sizeof(ss)*n); for(i=0;i<n;i++) {int num1,yu1,sh1; (stu+i)->num=0; (stu+i)->yu=0; (stu+i)->sh=0; (stu+i)->sum=0; scanf("%d %d %d",&num1,&yu1,&sh1); (stu+i)->num=num1; (stu+i)->...
14
6796
struct s { int a; int sc[2]; }; void main() { struct s st[100000]; int t=0,j=0,max=0,p[3]={-1,-1}; long n,i; scanf("%ld",&n); for(i=0;i<n;i++) { scanf("%d%d%d",&st[i].a,&st[i].sc[0],&st[i].sc[1]); st[i].sc[0]=st[i].sc[0]+st[i].sc[1]; } i=0; while(t<3) { if(i<n&&i!=p[0]&&i!=p[1]) { j=(st[i].sc...
14
6797
int pfCompare(const void* elem1,const void* elem2) { int d; d=*((int*)elem2)-*((int*)elem1); return d; } struct student { long int ID; long int c; long int m; }; int main() { long int n,i,j,k; int b[100000]; int e[3]; scanf("%d",&n); struct stud...
14
6798
struct student { int a; int b; int c; int d; struct student *next; }; int n; struct student *creat(int i) { struct student *head,*p1,*p2; n=0; p1=p2=(struct student *)malloc(sizeof(struct student)); scanf("%d %d %d",&p1->a,&p1->b,&p1->c); p1->d=p1->c+p1->b; head=NULL; while(n<i-1) { n=n+1;...
14
6799
struct student { int num; int chi; int math; int total; struct student *next; }; struct student* creat(int n) { struct student *p1,*p2,*head; int i; p1=p2=(struct student*) malloc(len); head=NULL; i=0; while(i<n) { scanf("%d %d %d",&p1->num,&p1->chi,&p1->math); i=i+1; if(i==1) head=p1; else p2-...