id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
19,400 | struct student
{
char name[21];
int score;
int point;
char s1[2];
char s2[2];
int paper;
}stu[100];
void main()
{
int n,i,total=0,t[100]={0},max=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{scanf("%s%d%d%s%s%d",stu[i].name,&stu[i].score,&stu[i].point,stu[i].s1,stu[i].s2,&stu[i].paper);}
for(i=0;i<n;i++)
{
if(stu[i].score>80)
{
if(stu[i].paper!=0)
t[i]+=8000;
if(stu[i].score>85&&stu[i].point>80)
t[i]+=4000;
if(stu[i].score>85&&stu[i].s2[0]=='Y')
t[i]+=1000;
if(stu[i].score>90)
t[i]+=2000;
}
if(stu[i].point>80&&stu[i].s1[0]=='Y')
t[i]+=850;
}
for(i=0;i<n;i++)
{ max=max>t[i]?max:t[i];}
for(i=0;i<n;i++)
{
if(max==t[i])
{
printf("%s\n%d\n",stu[i].name,max);break;
}
}
for(i=0;i<n;i++)
{ total+=t[i];
}
printf("%d\n",total);
}
| 39 |
19,401 | struct student
{
char name[100];
int ascore;
int bscore;
char leader;
char xibu;
int papernum;
int money;
struct student *next;
};
int n;
int num;
int total=0;
int main()
{
int i;
scanf("%d",&num);
struct student *creat();
struct student *pt,*p,*flagp;
pt=creat();
p=pt;
int max=pt->money;
for(;;)
{
if(max<=p->money)
{max=p->money;}
if(p->next==NULL)
{goto part2;}
p=p->next;
}
part2:
p=pt;
for(;;)
{
if(max==p->money)
{flagp=p;goto part1;}
if(p->next==NULL)
{goto part1;}
p=p->next;
}
part1:;
printf("%s\n%d\n%d",flagp->name,flagp->money,total);
return 0;
}
struct student *creat()
{
struct student *head,*p1,*p2;
n=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->ascore,&p1->bscore,&p1->leader,&p1->xibu,&p1->papernum);
head=NULL;
p1->money=0;
if(p1->ascore>80&&p1->papernum>=1)
p1->money+=8000;
if(p1->ascore>85&&p1->bscore>80)
p1->money+=4000;
if(p1->ascore>90)
p1->money+=2000;
if(p1->ascore>85&&p1->xibu=='Y')
p1->money+=1000;
if(p1->bscore>80&&p1->leader=='Y')
p1->money+=850;
total=p1->money;
while(n!=num-1)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
p1->money=0;
scanf("%s %d %d %c %c %d",p1->name,&p1->ascore,&p1->bscore,&p1->leader,&p1->xibu,&p1->papernum);
if(p1->ascore>80&&p1->papernum>=1)
p1->money+=8000;
if(p1->ascore>85&&p1->bscore>80)
p1->money+=4000;
if(p1->ascore>90)
p1->money+=2000;
if(p1->ascore>85&&p1->xibu=='Y')
p1->money+=1000;
if(p1->bscore>80&&p1->leader=='Y')
p1->money+=850;
total=total+p1->money;
}
p2->next=p1;
p1->next=NULL;
return (head);
} | 39 |
19,402 | struct student{
char name[20];
int t1;
int t2;
char gan;
char west;
int wen;
int sum;
};
void main()
{
int n,i,j,whole=0;
struct student stu[100];
struct student temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c %d",stu[i].name,&stu[i].t1,&stu[i].t2,&stu[i].gan,&stu[i].west,&stu[i].wen);
stu[i].sum=0;
if(stu[i].t1>80&&stu[i].wen>=1)
stu[i].sum=stu[i].sum+8000;
if(stu[i].t1>85&&stu[i].t2>80)
stu[i].sum=stu[i].sum+4000;
if(stu[i].t1>90)
stu[i].sum=stu[i].sum+2000;
if(stu[i].t1>85&&stu[i].west=='Y')
stu[i].sum=stu[i].sum+1000;
if(stu[i].t2>80&&stu[i].gan=='Y')
stu[i].sum=stu[i].sum+850;
}
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
{
if(stu[i].sum<stu[i+1].sum)
{
temp=stu[i];
stu[i]=stu[i+1];
stu[i+1]=temp;
}
}
for(i=0;i<n;i++)
whole=whole+stu[i].sum;
printf("%s\n%d\n%d",stu[0].name,stu[0].sum,whole);
} | 39 |
19,403 | struct stu
{
char str[30];
int a,b;
char s1,s2;
int c;
int e;
}sm[1000];
void main()
{
int t,i,max,sum;
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%s%d%d %c %c%d",sm[i].str,&sm[i].a,&sm[i].b,&sm[i].s1,&sm[i].s2,&sm[i].c);
sm[i].e=0;
}
for(i=0;i<t;i++)
{ if((sm[i].a)>80&&(sm[i].c)>=1)
{
(sm[i].e)=(sm[i].e)+8000;
}
if((sm[i].a)>85&&(sm[i].b)>80)
{
(sm[i].e)=(sm[i].e)+4000;
}
if((sm[i].a)>90)
{
(sm[i].e)=(sm[i].e)+2000;
}
if((sm[i].a)>85&&(sm[i].s2)=='Y')
{
(sm[i].e)=(sm[i].e)+1000;
}
if((sm[i].b)>80&&(sm[i].s1)=='Y')
{
(sm[i].e)=(sm[i].e)+850;
}
}
max=sm[0].e;
sum=sm[0].e;
for(i=1;i<t;i++)
{
if(max<sm[i].e)
max=sm[i].e;
sum=sum+sm[i].e;
}
for(i=0;i<t;i++)
{
if(sm[i].e==max)
{
printf("%s\n%d\n",sm[i].str,sm[i].e);
break;
}
}
printf("%d",sum);
}
| 39 |
19,404 | struct student
{
char name[20];
int g;
int e;
char m;
char w;
int p;
}stu[N];
void main()
{
int award[N];
int AWARD(struct student stu);
int n;
int i,j;
int sum=0,max=0,maxi=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].g,&stu[i].e,&stu[i].m,&stu[i].w,&stu[i].p);
for(i=0;i<n;i++)
{
award[i]=AWARD(stu[i]);
sum=sum+award[i];
if(award[i]>max)
{
max=award[i];
maxi=i;
}
}
printf("%s\n%d\n",stu[maxi].name,max);
printf("%d",sum);
}
int AWARD(struct student stu)
{
int sum=0;
if(stu.g>80&&stu.p>0)
sum=sum+8000;
if(stu.g>85&&stu.e>80)
sum=sum+4000;
if(stu.g>90)
sum=sum+2000;
if(stu.g>85&&stu.w=='Y')
sum=sum+1000;
if(stu.e>80&&stu.m=='Y')
sum=sum+850;
return(sum);
} | 39 |
19,405 | void main()
{
int i,n,a=0,b=0,c=0,d=0,e=0,max=0,k=0,sum=0;
struct student
{
char name[20];
int qm;
int bj;
char gb;
char xb;
int lw;
int money;
}stu[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qm,&stu[i].bj,&stu[i].gb,&stu[i].xb,&stu[i].lw);
}
for(i=0;i<n;i++)
{
if(stu[i].qm>80&&stu[i].lw>0)
a=8000;
if(stu[i].qm>85&&stu[i].bj>80)
b=4000;
if(stu[i].qm>90)
c=2000;
if(stu[i].qm>85&&stu[i].xb=='Y')
d=1000;
if(stu[i].bj>80&&stu[i].gb=='Y')
e=850;
stu[i].money=a+b+c+d+e;
a=b=c=d=e=0;
}
max=stu[0].money;
for(i=0;i<n;i++)
{
if(stu[i].money>max)
{ max=stu[i].money;
k=i;
}
}
for(i=0;i<n;i++)
{
sum=sum+stu[i].money;
}
printf("%s\n",stu[k].name);
printf("%d\n",stu[k].money);
printf("%d",sum);
}
| 39 |
19,406 | void main()
{
int n,i,s=0,max;
double A[200],sum;
struct student
{
char name[50];
int AP;
int EP;
char L;
char D;
int paper;
};
struct student stu[200];
scanf("%d",&n);
for(i=0;i<n;i++)
{
s=0;
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].AP,&stu[i].EP,&stu[i].L,&stu[i].D,&stu[i].paper);
if(stu[i].AP>80&&stu[i].paper>0)
s=s+8000;
if(stu[i].AP>85&&stu[i].EP>80)
s=s+4000;
if(stu[i].AP>90)
s=s+2000;
if(stu[i].AP>85&&stu[i].D=='Y')
s=s+1000;
if(stu[i].EP>80&&stu[i].L=='Y')
s=s+850;
A[i]=s;
}
for(i=0,max=0,sum=0;i<n;i++)
{
if(A[i]>A[max]) max=i;
sum=sum+A[i];
}
printf("%s\n%.lf\n%.lf\n",stu[max].name,A[max],sum);
}
| 39 |
19,407 | struct student
{
char name[20];
int score;
int pingyi;
char ganbu;
char west;
int paper;
};
int main()
{
int n,i,t,x,y=0,a[100]={0};
struct student stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].score,&stu[i].pingyi,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++)
{if(stu[i].score>80&&stu[i].paper>0) {a[i]=a[i]+8000;}
if(stu[i].score>85&&stu[i].pingyi>80) {a[i]=a[i]+4000;}
if(stu[i].score>90){a[i]=a[i]+2000;}
if(stu[i].score>85&&stu[i].west=='Y'){a[i]=a[i]+1000;}
if(stu[i].pingyi>80&&stu[i].ganbu=='Y'){a[i]=a[i]+850;}
}
t=a[0];x=0;
for(i=0;i<n;i++)
{if(a[i]>t) {t=a[i];x=i;}
y=y+a[i];}
printf("%s\n%d\n%d\n",stu[x].name,a[x],y);
} | 39 |
19,408 | struct student
{
char name[100];
short int score1;
short int score2;
char x;
char y;
short int num;
int sum;
struct student *next;
};
void main()
{
struct student *p1,*p2,*head;
char name2[100];
int max=0,s=0,i,n;
p1=p2=head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct student *)malloc(sizeof(struct student));
scanf("%s %d %d %c %c %d",p1->name,&p1->score1,&p1->score2,&p1->x,&p1->y,&p1->num);
p1->sum=0;
if(p1->score1>90)
{
p1->sum=2000;
if(p1->score2>80)
{
p1->sum=p1->sum+4000;
if(p1->x=='Y')p1->sum=p1->sum+850;
if(p1->y=='Y')p1->sum=p1->sum+1000;
if(p1->num>=1)p1->sum=p1->sum+8000;
}
else
{
if(p1->num>=1)p1->sum=p1->sum+8000;
if(p1->y=='Y')p1->sum=p1->sum+1000;
}
}
else if(p1->score1>85)
{
if(p1->score2>80)
{
p1->sum=p1->sum+4000;
if(p1->x=='Y')p1->sum=p1->sum+850;
if(p1->y=='Y')p1->sum=p1->sum+1000;
if(p1->num>=1)p1->sum=p1->sum+8000;
}
else
{
if(p1->y=='Y')p1->sum=p1->sum+1000;
if(p1->num>=1)p1->sum=p1->sum+8000;
}
}
else if(p1->score1>80)
{
if(p1->num>=1)p1->sum=p1->sum+8000;
if(p1->score2>80&&p1->x=='Y')p1->sum=p1->sum+850;
}
else if(p1->score2>80&&p1->x=='Y')p1->sum=p1->sum+850;
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
}
p2->next=NULL;
max=head->sum;
p1=head;
while(p1!=NULL)
{
if(p1->sum>max){max=p1->sum;strcpy(name2,p1->name);}
s=s+p1->sum;
p1=p1->next;
}
printf("%s\n%d\n%d\n",name2,max,s);
}
| 39 |
19,409 | int main()
{
struct person
{char name[20];
int pro1;
int pro2;
char c1;
char c2;
int papers;
int money;
}//stu[1]={"aA",87,82,'Y','N',0,0}//"bB",88,78,'N','Y',1,0,"cC",92,88,'N','N',0,0,"dD",83,87,'Y','N',1,0,"bb",92,80,'Y','Y',1,0}
;
long int i,N,max=0;
long int all=0;
scanf("%d\n",&N);
struct person *stu=(struct person *)malloc(N*sizeof(struct person));
for(i=0;i<N;i++){
scanf("%s%d%d %c %c %d\n",&stu[i].name,&stu[i].pro1,&stu[i].pro2,&stu[i].c1,&stu[i].c2,&stu[i].papers);
stu[i].money=0;
if(stu[i].papers>=1&&stu[i].pro1>80)stu[i].money=stu[i].money+8000;
if(stu[i].pro1>85&&stu[i].pro2>80)stu[i].money=stu[i].money+4000;
if(stu[i].pro1>90)stu[i].money=stu[i].money+2000;
if(stu[i].pro1>85&&stu[i].c2=='Y')stu[i].money=stu[i].money+1000;
if(stu[i].pro2>80&&stu[i].c1=='Y')stu[i].money=stu[i].money+850;
if(max<stu[i].money) max=stu[i].money;
all=all+stu[i].money;}
for(i=0;i<N;i++)
{if(stu[i].money==max)
{printf("%s\n%d\n%d",stu[i].name,stu[i].money,all);
break;}
}
return(0);
}
| 39 |
19,410 |
struct l
{
char a[22];
int x;
int y;
char m;
char n;
int h;
};
int main()
{
int n,i;
cin>>n;
struct l s[101];
int f=0,j,c=0;
for(i=1;i<=n;i++)
{
int p=0;
cin>>s[i].a;
cin>>s[i].x;
cin>>s[i].y;
cin>>s[i].m;
cin>>s[i].n;
cin>>s[i].h;
if(s[i].x>80&&s[i].h>=1)
p+=8000;
if(s[i].x>85&&s[i].y>80)
p+=4000;
if(s[i].x>90)
p+=2000;
if(s[i].x>85&&s[i].n=='Y')
p+=1000;
if(s[i].y>80&&s[i].m=='Y')
p+=850;
c+=p;
if(p>f)
{
f=p;
j=i;
}
}
cout<<s[j].a<<endl;
cout<<f<<endl;
cout<<c<<endl;
return 0;
}
| 39 |
19,411 | struct stu
{
char xingming[21];
int qimchengji;
int pingychengji;
char ganbu[2];
char xibu[2];
int lunwenshu;
int jiangxuejin;
}stum[101];
void main()
{
char s[2]={"Y"};
int n,i,j,jiangjinzongshu;
jiangjinzongshu=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
stum[i].jiangxuejin=0;
}
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",stum[i].xingming,&stum[i].qimchengji,
&stum[i].pingychengji,stum[i].ganbu,stum[i].xibu,&stum[i].lunwenshu);
}
for(i=0;i<n;i++)
{
if(stum[i].qimchengji>80&&stum[i].lunwenshu>=1)
{
stum[i].jiangxuejin+=8000;
}
if(stum[i].qimchengji>85&&stum[i].pingychengji>80)
{
stum[i].jiangxuejin+=4000;
}
if(stum[i].qimchengji>90)
{
stum[i].jiangxuejin+=2000;
}
if(stum[i].qimchengji>85&&strcmp(stum[i].xibu,s)==0)
{
stum[i].jiangxuejin+=1000;
}
if(stum[i].pingychengji>80&&strcmp(stum[i].ganbu,s)==0)
{
stum[i].jiangxuejin+=850;
}
}
for(i=0;i<100;i++)
{
for(j=0;j<=100-i-1;j++)
{
if(stum[j].jiangxuejin<stum[j+1].jiangxuejin)
{
stum[100]=stum[j];
stum[j]=stum[j+1];
stum[j+1]=stum[100];
}
}
}
printf("%s\n",stum[0].xingming);
printf("%d\n",stum[0].jiangxuejin);
for(i=0;i<n;i++)
{
jiangjinzongshu+=stum[i].jiangxuejin;
}
printf("%d\n",jiangjinzongshu);
}
| 39 |
19,412 | struct member{
char name[100];
int a;
int b;
char O;
char W;
int x;};
int money(struct member p)
{
int m=0;
if(p.a>80&&p.x>=1)m+=8000;
if(p.a>85&&p.b>80)m+=4000;
if(p.a>90)m+=2000;
if(p.a>85&&p.W=='Y')m+=1000;
if(p.b>80&&p.O=='Y')m+=850;
return m;
}
int main()
{
struct member p[100];
int N,i,m[100],max=0,co;
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%s %d %d %c %c %d",p[i].name,&p[i].a,&p[i].b,&p[i].O,&p[i].W,&p[i].x);
m[i]=money(p[i]);}
for(i=0;i<N;i++)
if(m[i]>max){max=m[i];co=i;}
int sum=0;
for(i=0;i<N;i++)sum+=m[i];
printf("%s\n%d\n%d\n",p[co].name,m[co],sum);
} | 39 |
19,413 | struct student
{
char name[20];
int grade_1;
int grade_2;
char a;
char b;
int paper;
int sum; /*the money one get */
int flag; /*1 means the most abudant one*/
struct student *next;
};
int n,k;
int j;
struct student *creat(void)
{
struct student *head;
struct student *p1,*p2;
int i;
j=0;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->grade_1,&p1->grade_2,&p1->a,&p1->b,&p1->paper);
p1->sum = 0;
p1->flag = 0;
if(p1->grade_1>80&&p1->paper>0)
p1->sum+=8000;
if(p1->grade_1>85&&p1->grade_2>80)
p1->sum+=4000;
if(p1->grade_1>90)
p1->sum+=2000;
if(p1->grade_1>85&&p1->b=='Y')
p1->sum+=1000;
if(p1->grade_2>80&&p1->a=='Y')
p1->sum+=850;
// printf("%s %d %d %c %c %d %d",p1->name,p1->grade_1,p1->grade_2,p1->a,p1->b,p1->paper,p1->sum);
head=NULL;
for(i=0;;i++)
{
//printf("i = %d\n",i);
j=j+1;
if(j==1)
{
head=p1;
}
else
{
p2->next=p1;
}
p2=p1;
if(i>=n-1)
{
break;
}
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->grade_1,&p1->grade_2,&p1->a,&p1->b,&p1->paper);
p1->sum = 0;
p1->flag = 0;
if(p1->grade_1>80&&p1->paper>0)
p1->sum+=8000;
if(p1->grade_1>85&&p1->grade_2>80)
p1->sum+=4000;
if(p1->grade_1>90)
p1->sum+=2000;
if(p1->grade_1>85&&p1->b=='Y')
p1->sum+=1000;
if(p1->grade_2>80&&p1->a=='Y')
p1->sum+=850;
// printf("%s %d %d %c %c %d %d",p1->name,p1->grade_1,p1->grade_2,p1->a,p1->b,p1->paper,p1->sum);
}
p2->next=NULL;
return(head);
}
void output(struct student *p)
{
int total; /* total is all they get*/
int i,max; /* max is the most one -> flag ==1*/
struct student *tmp;
tmp = p;
max = 0;
total = 0;
tmp = p;
while(tmp!=NULL)
{
total+=tmp->sum;
// printf("again\n");
if(tmp->flag == 1)
{
tmp = tmp->next;
continue;
}
if(max<tmp->sum)
{
max = tmp->sum;
}
tmp = tmp->next;
}
// printf("%d\n",max);
tmp = p;
while(tmp!=NULL)
{
if(tmp->flag == 1)
{
tmp = tmp->next;
continue;
}
if(max!=tmp->sum)
{
tmp=tmp->next;
}
else
{
tmp->flag = 1;
break;
}
}
if (tmp->flag==1)
printf("%s\n",tmp->name);
printf("%d\n%d",max,total);
}
int main()
{
scanf("%d",&n);
struct student *p = creat();
output(p);
}
| 39 |
19,414 | int main () {
long int n,i,k,t,c,j,s=0,max=0,a[800]={0};
char b[200][500],y,x;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("\n%s %d %d %c %c %d",b[i],&k,&t,&y,&x,&c);
if (k>80 && c>0) a[i]+=8000;
if (k>85 && t>80) a[i]+=4000;
if (k>90) a[i]+=2000;
if (k>85 && x=='Y') a[i]+=1000;
if (t>80 && y=='Y') a[i]+=850;
s+=a[i];
}
for (i=0;i<n;i++)
{
if (a[i]>max){
max=a[i];
j=i;}
}
printf ("%s\n%d\n%d",b[j],max,s);
return 0;
} | 39 |
19,415 | int main(){
int n,k,t,i,q,s[100],cm[100],atl[100],a[100],b,m;
char name[100][20],e[100][2],f[100][2],final[20];
scanf("%d",&n);
for(k=0;k<n;k++){
scanf("%s %d %d %s %s %d",&name[k],&s[k],&cm[k],&e[k],&f[k],&atl[k]);
}
b=0;
for(t=0;t<n;t++){
a[t]=0;
if(s[t]>80&&atl[t]>=1){
a[t]=a[t]+8000;
}
if(s[t]>85&&cm[t]>80){
a[t]=a[t]+4000;
}
if(s[t]>90){
a[t]=a[t]+2000;
}
if(s[t]>85&&strcmp(f[t],"Y")==0){
a[t]=a[t]+1000;
}
if(cm[t]>80&&strcmp(e[t],"Y")==0){
a[t]=a[t]+850;
}
}
b=0;
for(q=0;q<n;q++){
b=b+a[q];
}
m=0;
for(i=0;i<n;i++){
if(a[i]>m){
m=a[i];
strcpy(final,name[i]);
}
}
printf("%s\n%d\n%d",final,m,b);
return 0;
} | 39 |
19,416 | void main()
{
char str[100][20],a[100],b[100];
int i,j,c[100],d[100],f[100],sum[100]={0};
int l=0,m=0,max;
int n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",str[i],&c[i],&d[i],&a[i],&b[i],&f[i]);
for(i=0;i<n;i++)
{
if(c[i]>80 && f[i]>=1) sum[i]=sum[i]+8000;
if(c[i]>85 && d[i]>80) sum[i]=sum[i]+4000;
if(c[i]>90) sum[i]=sum[i]+2000;
if(c[i]>85 && b[i]=='Y') sum[i]=sum[i]+1000;
if(d[i]>80 && a[i]=='Y') sum[i]=sum[i]+850;
}
max=0;
for(i=0;i<n;i++)
{
if(max<sum[i]) max=sum[i];
m=m+sum[i];
}
for(i=0;i<n;i++)
if(max==sum[i]){printf("%s\n%d\n%d\n",str[i],max,m);break;}
} | 39 |
19,417 |
int main()
{
//freopen("tt.in","r",stdin);
//freopen("tt.out","w",stdout);
int i,j,n,k,t,max;
char gan,xi;
int g1,g2,lun,r;
char s[333];
char s1[333];
scanf("%d",&n);
r=0;
max=-999;
for (i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",s,&g1,&g2,&gan,&xi,&lun);
t=0;
if ((g1>80) && (lun>=1)) t+=8000;
if ((g1>85) && (g2>80)) t+=4000;
if (g1>90) t+=2000;
if ((g1>85) &&(xi=='Y')) t+=1000;
if ((g2>80) &&(gan=='Y')) t+=850;
r+=t;
if (t>max)
{
max=t;
strcpy(s1,s);
}
}
puts(s1);
printf("%d\n%d\n",max,r);
return 0;
} | 39 |
19,418 | int main()
{
int a,b,e,n,i,max=0,total=0,sum[200];
char s[200][200],maxstudent[200],c,d;
cin>>n;
for(i=0;i<n;i++)
{
sum[i]=0;
cin>>s[i]>>a>>b>>c>>d>>e;
if((a>80)&&(e>0))
sum[i]+=8000;
if((a>85)&&(b>80))
sum[i]+=4000;
if((a>90))
sum[i]+=2000;
if((a>85)&&(d=='Y'))
sum[i]+=1000;
if((b>80)&&(c=='Y'))
sum[i]+=850;
}
for(i=0;i<n;i++)
{
total+=sum[i];
if(sum[i]>max)
{
max=sum[i];
strcpy(maxstudent,s[i]);
}
}
cout<<maxstudent<<"\n"<<max<<"\n"<<total<<endl;
return 0;
} | 39 |
19,419 |
int main()
{
struct data
{
char name[22];
int score1;
int score2;
char mas;
char dis;
int paper;
int sum;
}p[100];
int n;
scanf("%d",&n);
int i = 0 ;
for ( i = 0 ; i < n ; i++ )
{
scanf("%s",p[i].name);
scanf("%d",&(p[i].score1));
scanf("%d",&(p[i].score2));
getchar();
scanf("%c",&(p[i].mas));
getchar();
scanf("%c",&(p[i].dis));
scanf("%d",&(p[i].paper));
}
for ( i = 0 ; i < n ; i++ )
{
p[i].sum = 0;
}
int k = 0;
int max = 0;
int total = 0;
for ( i = 0 ; i < n ; i++ )
{
if ( p[i].score1 > 80 && p[i].paper >= 1 )
{
p[i].sum += 8000;
}
if ( p[i].score1 > 85 && p[i].score2 > 80)
{
p[i].sum += 4000;
}
if ( p[i].score1 > 90 )
{
p[i].sum += 2000;
}
if ( p[i].score1 > 85 && p[i].dis == 'Y' )
{
p[i].sum += 1000;
}
if ( p[i].score2 > 80 && p[i].mas == 'Y' )
{
p[i].sum += 850;
}
total += p[i].sum;
if ( p[i].sum > max )
{
max = p[i].sum;
k = i;
}
}
printf("%s\n",p[k].name);
printf("%d\n",max);
printf("%d\n",total);
return 0;
}
| 39 |
19,420 |
struct student
{
char name[20];
int mark1;
int mark2;
char judge1;
char judge2;
int paper;
double total;
}stu;
double max=0;
void main()
{
void compare(struct student temp);
struct student stu1;
int n,i;
stu1.total=0;
stu.total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",stu1.name,&stu1.mark1,&stu1.mark2,&stu1.judge1,&stu1.judge2,&stu1.paper);
compare(stu1);
//printf("%s\n%d\n%d\n%c\n%c\n%d\n",stu1.name,stu1.mark1,stu1.mark2,stu1.judge1,stu1.judge2,stu1.paper);
}
printf("%s\n%.0lf\n%.0lf\n",stu.name,stu.total,max);
}
void compare(struct student temp)
{
if(temp.mark1>80&&temp.paper>0)temp.total+=8000; //????????8000?
if(temp.mark1>85&&temp.mark2>80)temp.total+=4000; //????????4000?
if(temp.mark1>90)temp.total+=2000; //????????2000?
if(temp.mark1>85&&temp.judge2=='Y')temp.total+=1000;//????????1000?
if(temp.mark2>80&&temp.judge1=='Y')temp.total+=850; //????????850?
max+=temp.total;
if(temp.total>stu.total)stu=temp;
} | 39 |
19,421 |
struct stus
{
char name[25];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int p;
};
void main()
{
int m,n,i,j,k,s=0;
char c[25]={0};
struct stus stu[101]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
if(stu[i].qimo>80&&stu[i].lunwen>=1)
stu[i].p+=8000;
if(stu[i].qimo>85&&stu[i].banji>80)
stu[i].p+=4000;
if(stu[i].qimo>90)
stu[i].p+=2000;
if(stu[i].xibu=='Y'&&stu[i].qimo>85)
stu[i].p+=1000;
if(stu[i].banji>80&&stu[i].ganbu=='Y')
stu[i].p+=850;
s+=stu[i].p;
}
m=stu[0].p;
strcpy(c,stu[0].name);
for(i=1;i<n;i++)
if(stu[i].p>m)
{
strcpy(c,stu[i].name);
m=stu[i].p;
}
printf("%s\n",c);
printf("%d\n%d",m,s);
} | 39 |
19,422 | int main(int argc, char* argv[])
{
int n,s1,s2,paper,i,money[100],m=0,sum=0,a;
char name[100][20],c1=0,c2=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
money[i]=0;
scanf("%s %d %d %c %c %d\n",name[i],&s1,&s2,&c1,&c2,&paper);
if(s1>80&&paper>=1)
{
money[i]=money[i]+8000;
}
if(s1>85&&s2>80)
{
money[i]=money[i]+4000;
}
if(s1>90)
{
money[i]=money[i]+2000;
}
if(s1>85&&c2=='Y')
{
money[i]=money[i]+1000;
}
if(s2>80&&c1=='Y')
{
money[i]=money[i]+850;
}
if(money[i]>m)
{
m=money[i];
a=i;
}
sum=sum+money[i];
}
printf("%s\n%d\n%d",name[a],m,sum);
return 0;
}
| 39 |
19,423 |
int main(int argc, char* argv[])
{
int N,i,sch,msch=0,ssch=0;
char mname[21];
char name[21];
int aver;
int ping;
char lead;
char west;
int essay;
scanf("%d",&N);
for(i=1;i<=N;i++)
{
sch=0;
scanf("%s%d%d %c %c%d",name,&aver,&ping,&lead,&west,&essay);
if((aver>80)&&(essay>=1))sch=sch+8000;
if((aver>85)&&(ping>80))sch=sch+4000;
if(aver>90)sch=sch+2000;
if((aver>85)&&(west=='Y'))sch=sch+1000;
if((ping>80)&&(lead=='Y'))sch=sch+850;
ssch=ssch+sch;
if(sch>msch)
{
msch=sch;
strcpy(mname,name);
}
}
printf("%s\n%d\n%d\n",mname,msch,ssch);
return 0;
}
| 39 |
19,424 | struct student
{
char name[22];
int qimo;
int banji;
char gan;
char sheng;
int num;
};
void main()
{
int n,i,j=0,sum,tol=0,max=0;
struct student t,*s;
scanf("%d",&n);
s=(struct student *)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{ sum=0;
scanf("%s %d %d %c %c %d",(*(s+i)).name,&(*(s+i)).qimo,&(*(s+i)).banji,&(*(s+i)).gan,&(*(s+i)).sheng,&(*(s+i)).num);
if (((*(s+i)).qimo>80)&&((*(s+i)).num>=1)) sum=sum+8000;
if (((*(s+i)).qimo>85)&&((*(s+i)).banji>80)) sum=sum+4000;
if ((*(s+i)).qimo>90) sum=sum+2000;
if (((*(s+i)).qimo>85)&&((*(s+i)).sheng=='Y')) sum=sum+1000;
if (((*(s+i)).banji>80)&&((*(s+i)).gan=='Y')) sum=sum+850;
if(sum>max) {max=sum;j=i;}
tol=tol+sum;
}
printf("%s\n%d\n%d\n",(*(s+j)).name,max,tol);
} | 39 |
19,425 | int main()
{struct student
{char name[20],o,w;
int score,cla,paper;
}n[100];
int t=0,N,i,j,m[100],e[100],k;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",n[i].name,&n[i].score,&n[i].cla,&n[i].o,&n[i].w,&n[i].paper);}
for(i=0;i<N;i++)
{m[i]=0;
if(n[i].cla>80&&n[i].o=='Y') m[i]+=850;
if(n[i].score>85&&n[i].w=='Y') m[i]+=1000;
if(n[i].score>90) m[i]+=2000;
if(n[i].score>85&&n[i].cla>80) m[i]+=4000;
if(n[i].score>80&&n[i].paper) m[i]+=8000;}
for(i=0;i<N;i++)
e[i]=i;
for(i=0;i<N;i++)
for(j=i;j<N;j++)
{if(m[e[i]]<m[e[j]]) {k=e[i];e[i]=e[j];e[j]=k;}}
printf("%s\n%d\n",n[e[0]].name,m[e[0]]);
for(i=0;i<N;i++)
t+=m[i];
printf("%d",t);
return 0;} | 39 |
19,426 |
int main()
{
int N,i,g=0,n[100]={0},h,sum=0;
scanf("%d",&N);
struct student{
char name[20];
int x,y;
char p,q;
int z;
}s[100];
for(i=0;i<N;i++){
scanf("%s %d %d %c %c %d",s[i].name,&s[i].x,&s[i].y,&s[i].p,&s[i].q,&s[i].z);
if((s[i].x>80)&&(s[i].z>0))
n[i]+=8000;
if((s[i].x>85)&&(s[i].y>80))
n[i]+=4000;
if(s[i].x>90)
n[i]+=2000;
if((s[i].x>85)&&(s[i].q=='Y'))
n[i]+=1000;
if((s[i].y>80)&&(s[i].p=='Y'))
n[i]+=850;
}
for(i=0;i<N;i++){
if(n[i]>g){
g=n[i];
h=i;
}
sum += n[i];
}
printf("%s\n",s[h].name);
printf("%d\n",g);
printf("%d",sum);
} | 39 |
19,427 | void main()
{
int i,n,k;
long a[100]={0},ss,m;
struct student
{
char name[20];
int score1,score2;
char leader;
char western;
int essay;
}st[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",st[i].name,&st[i].score1,&st[i].score2,&st[i].leader,&st[i].western,&st[i].essay);
for(i=0;i<n;i++)
{
if(st[i].score1>80&&st[i].essay!=0) a[i]=a[i]+8000;
if(st[i].score1>85&&st[i].score2>80) a[i]=a[i]+4000;
if(st[i].score1>90) a[i]=a[i]+2000;
if(st[i].score1>85&&st[i].western=='Y') a[i]=a[i]+1000;
if(st[i].score2>80&&st[i].leader=='Y') a[i]=a[i]+850;
}
m=a[0]; k=0; ss=a[0];
for(i=1;i<n;i++)
{
if(m<a[i])
{
m=a[i];
k=i;
}
ss=ss+a[i];
}
printf("%s\n%ld\n%ld\n",st[k].name,a[k],ss);
}
| 39 |
19,428 |
int main(int argc, char* argv[])
{
char name[100][100];
char s[2], w[2];
int a, b, c;
int n, sum[100], sum1=0, i, f=-1, g=0, j;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d", name[i], &a, &b, s, w, &c);
sum[i] = 0;
if(a>80 && c!=0)
{
sum[i] += 8000;
sum1 += 8000;
}
if(a>85 && b>80)
{
sum[i] += 4000;
sum1 += 4000;
}
if(a>90)
{
sum[i] += 2000;
sum1 += 2000;
}
if(a>85 && w[0]=='Y')
{
sum[i] += 1000;
sum1 += 1000;
}
if(b>80 && s[0]=='Y')
{
sum[i] += 850;
sum1 += 850;
}
}
for(j=0;j<n;j++)
{
if(sum[j]>f)
{
f=sum[j];
g=j;
}
}
printf("%s\n", name[g]);
printf("%d\n", f);
printf("%d\n", sum1);
return 0;
} | 39 |
19,429 | struct Student{
char name[20];
int Academy;
int Class;
char Stujob;
char west;
int paper;
};
void main()
{
int N,i,j,scolar[100][6],max;
long int sum=0;
struct Student stu[100];
struct Student* p;
scanf("%d",&N);
for(i=0;i<N;i++)
for(j=0;j<6;j++)
scolar[i][j]=0;
for(p=stu;p<stu+N;p++)
scanf("%s %d %d %c %c %d",p->name,&p->Academy,&p->Class,&p->Stujob,&p->west,&p->paper);
for(i=0;i<N;i++)
{
if(stu[i].Academy>80&&stu[i].paper>=1)
scolar[i][0]=8000;
if(stu[i].Academy>85&&stu[i].Class>80)
scolar[i][1]=4000;
if(stu[i].Academy>90)
scolar[i][2]=2000;
if(stu[i].Academy>85&&stu[i].west=='Y')
scolar[i][3]=1000;
if(stu[i].Class>80&&stu[i].Stujob=='Y')
scolar[i][4]=850;
}
for(i=0;i<N;i++)
for(j=4;j>=0;j--)
scolar[i][5]=scolar[i][5]+scolar[i][j];
max=scolar[0][5];j=0;
for(i=0;i<N;i++)
if(scolar[i][5]>max)
{ max=scolar[i][5];j=i;}
printf("%s\n%d\n",stu[j].name,scolar[j][5]);
for(i=0;i<N;i++)
sum=sum+scolar[i][5];
printf("%ld",sum);
} | 39 |
19,430 | int main()
{
int n, a, b, c, i, sum=0, max=0, m[100]={0}, result[100];
char p, q, name[20], s[20];
scanf("%d\n", &n);
for(i=0;i<n;i++)
{
result[i] = scanf("%s %d %d %c %c %d\n", s, &a, &b, &p, &q, &c);
if(a>80 && c>0) m[i]+=8000;
if(a>85 && b>80) m[i]+=4000;
if(a>90) m[i]+=2000;
if(a>85 && q=='Y') m[i]+=1000;
if(b>80 && p=='Y') m[i]+=850;
if(m[i]>max)
{
max=m[i];
strcpy(name,s);
}
sum+=m[i];
}
printf("%s\n%d\n%d\n", name, max, sum);
return 0;
} | 39 |
19,431 |
void main()
{ int i,n,b[100]={0},c[100]={0},f[100]={0},s[100]={0},v,k=0,max=0;
char a[100][21]={'\0'},d[100],e[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",a[i],&b[i],&c[i],&d[i],&e[i],&f[i]);}
for(i=0;i<n;i++)
{
if(b[i]>80 && f[i]>0)
{s[i]=s[i]+8000;}
if(b[i]>85 && c[i]>80)
{s[i]=s[i]+4000;}
if(b[i]>90)
{s[i]=s[i]+2000;}
if(b[i]>85 && e[i]=='Y')
{s[i]=s[i]+1000;}
if(c[i]>80 && d[i]=='Y')
{s[i]=s[i]+850;}
k=k+s[i];
if(s[i]>max)
{v=i;
max=s[i];
}
}
printf("%s\n",a[v]);
printf("%d\n",s[v]);
printf("%d\n",k);
}
| 39 |
19,432 | void main()
{
struct student
{
char name[100];
int num1,num2;
char c1,c2;
int paper;
}stu[100];
int N,sum=0,i,m,b[100],max=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].num1,&stu[i].num2,&stu[i].c1,&stu[i].c2,&stu[i].paper);
b[i]=0;
if(stu[i].num1>80&&stu[i].paper>0)b[i]+=8000;
if(stu[i].num1>85&&stu[i].num2>80)b[i]+=4000;
if(stu[i].num1>90)b[i]+=2000;
if(stu[i].num1>85&&stu[i].c2=='Y')b[i]+=1000;
if(stu[i].num2>80&&stu[i].c1=='Y')b[i]+=850;
sum+=b[i];
if(b[i]>max)
{
max=b[i];
m=i;
}
}
printf("%s\n%d\n%d",stu[m].name,b[m],sum);
}
| 39 |
19,433 | int main(int argc, char* argv[])
{
int n,sum[100],i,j;
scanf("%d",&n);
struct{
char name[20];
int average;
int clas;
char gan;
char xi;
int lun;
}a[100];
for(i=0;i<n;i++){
sum[i]=0;
scanf("%s %d %d %c %c %d",a[i].name,&a[i].average,&a[i].clas,&a[i].gan,&a[i].xi,&a[i].lun);
}
for(i=0;i<n;i++)
{
if(a[i].average > 80 && a[i].lun >= 1)
sum[i]+=8000;
if(a[i].average > 85 && a[i].clas > 80 )
sum[i]+=4000;
if(a[i].average > 90)
sum[i]+=2000;
if(a[i].average > 85 && a[i].xi=='Y' )
sum[i]+=1000;
if(a[i].clas > 80 && a[i].gan=='Y')
sum[i]+=850;
}
int s=sum[0],d=sum[0];
for(i=1;i<n;i++)
{ d+=sum[i];
if(sum[i]>s)
{s=sum[i];
j=i;}
}
printf("%s\n",a[j].name);
printf("%d\n",sum[j]);
printf("%d\n",d);
return 0;
}
| 39 |
19,434 | int main()
{
int n,i;
scanf("%d",&n);
struct f
{
char str[21];
int score1,score2,article;//score1???????? score2??????
char a,b;
int prize;
}*p;
p=(struct f*)malloc(n*sizeof(struct f));
for(i=0;i<n;i++)
{ (p+i)->prize=0;
scanf("%s %d %d %c %c %d",(p+i)->str,&((p+i)->score1),&((p+i)->score2),&((p+i)->a),&((p+i)->b),&((p+i)->article));
if((p+i)->score1>80&&(p+i)->article>0) (p+i)->prize+=8000;
if((p+i)->score1>85&&(p+i)->score2>80) (p+i)->prize+=4000;
if((p+i)->score1>90) (p+i)->prize+=2000;
if((p+i)->score1>85&&(p+i)->b=='Y') (p+i)->prize+=1000;
if((p+i)->score2>80&&(p+i)->a=='Y') (p+i)->prize+=850;
}
long int sum=0;
for(i=0;i<n;i++)
{
sum+=(p+i)->prize;
}
char *p1;
int max=0;
for(i=0;i<n;i++)//????????????max?
if((p+i)->prize>max)
{
max=(p+i)->prize;
p1=(p+i)->str;
}
printf("%s\n%d\n%ld",p1,max,sum);
}
| 39 |
19,435 | struct stu
{
char name[25];
int sco;
int scob;
int gb;
int xb;
int lw;
int mon;
};
int main()
{
int n;
int i;
int max=0;
int zh;
long int all=0;
char du1,du2;
scanf("%d",&n);
struct stu a[100];
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].sco,&a[i].scob,&du1,&du2,&a[i].lw);
if(du1=='Y')
a[i].gb=1;
else
a[i].gb=0;
if(du2=='Y')
a[i].xb=1;
else
a[i].xb=0;
a[i].mon=0;
}
for(i=0;i<n;i++)
{
if(a[i].sco>80&&a[i].lw>=1)
a[i].mon+=8000;
if(a[i].sco>85&&a[i].scob>80)
a[i].mon+=4000;
if(a[i].sco>90)
a[i].mon+=2000;
if(a[i].sco>85&&a[i].xb==1)
a[i].mon+=1000;
if(a[i].scob>80&&a[i].gb==1)
a[i].mon+=850;
if(a[i].mon>max)
{
max=a[i].mon;
zh=i;
}
all+=a[i].mon;
}
printf("%s\n%d\n%lu",a[zh].name,a[zh].mon,all);
} | 39 |
19,436 |
struct student
{
char name[35];
int final;
int score;
char leader;
char west;
int paper;
int money;
struct student *next;
};
struct student *creat(void)
{
struct student *p,*q,*head;
int n,i=0;
scanf("%d",&n);
head=(struct student*)malloc(sizeof (struct student));
scanf("%s %d %d %c %c %d",&head->name,&head->final,&head->score,&head->leader,&head->west,&head->paper);
q=head;
p=head;
for(i=0;i<n;i++)
{
q=p;
q->money=0;
if ((q->final>80)&&(q->paper>0)) q->money=q->money+8000;
if ((q->final>85)&&(q->score>80)) q->money=q->money+4000;
if (q->final>90) q->money=q->money+2000;
if ((q->final>85)&&(q->west=='Y')) q->money=q->money+1000;
if ((q->score>80)&&(q->leader=='Y')) q->money=q->money+850;
if(i<n-1)
{p=(struct student*)malloc(sizeof (struct student));
scanf("%s %d %d %c %c %d",&p->name,&p->final,&p->score,&p->leader,&p->west,&p->paper);
q->next=p;}
}
q->next=NULL;
return(head);
}
void main()
{
struct student *p,*q,*r;
int sum=0,max=0;
p=creat();
for(q=p;q!=NULL;)
{if (q->money>max) {max=q->money; r=q;}
sum=sum+q->money;
q=q->next;
}
printf("%s\n%d\n",r->name,r->money);
printf("%d",sum);
}
| 39 |
19,437 | struct student
{
char name[25];
int qimo;
int pingshi;
char ganbu;
char xibu;
int lunwen;
int money;
};
int jiangxuejin(struct student s);
int main(int argc, char* argv[])
{
struct student a[101];
int N,sum,max,MAX;
scanf("%d",&N);
for(int i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].qimo,&a[i].pingshi,&a[i].ganbu,&a[i].xibu,&a[i].lunwen);
a[i].money=jiangxuejin(a[i]);
}
sum=max=0;
MAX=0;
for(int j=0;j<N;j++)
{
if(a[j].money>max)
{
max=a[j].money;
MAX=j;
}
sum+=a[j].money;
}
printf("%s\n",a[MAX].name);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
int jiangxuejin(struct student s)
{
int sum=0;
if((s.qimo>80)&&(s.lunwen>=1))
{
sum+=8000;
}
if((s.qimo>85)&&(s.pingshi>80))
{
sum+=4000;
}
if(s.qimo>90)
{
sum+=2000;
}
if((s.xibu=='Y')&&(s.qimo>85))
{
sum+=1000;
}
if((s.pingshi>80)&&(s.ganbu=='Y'))
{
sum+=850;
}
return sum;
} | 39 |
19,438 | struct stu
{
char name[25];
int qimo;
int banji;
char ganbu[1];
char xibu[1];
int lunwen;
}a[150];
void main()
{
int n,s[150]={0},i,sum=0,max=0;
char name[25];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",a[i].name,&a[i].qimo,&a[i].banji,a[i].ganbu,a[i].xibu,&a[i].lunwen);
}
for(i=0;i<n;i++)
{
if((a[i].qimo>80)&&(a[i].lunwen>=1))
s[i]+=8000;
if((a[i].qimo>85)&&(a[i].banji>80))
s[i]+=4000;
if(a[i].qimo>90)
s[i]+=2000;
if((a[i].qimo>85)&&(a[i].xibu[0]=='Y'))
s[i]+=1000;
if((a[i].banji>80)&&(a[i].ganbu[0]=='Y'))
s[i]+=850;
}
for(i=0;i<n;i++)
{
if(max<s[i])
{
max=s[i];
strcpy(name,a[i].name);
}
sum+=s[i];
}
printf("%s\n%d\n%d\n",name,max,sum);
} | 39 |
19,439 | void main ()
{
struct stu
{
char name[20];
int final;
int argue;
char leader;
char west;
int art;
}stu[100];
struct stu term;
int n,i,sum[100]={0},t=0,m,j;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].final,&stu[i].argue,&stu[i].leader,&stu[i].west,&stu[i].art);
for(i=0;i<=n-1;i++)
{
if(stu[i].final>80&&stu[i].art>=1)
sum[i]=sum[i]+8000;
if(stu[i].final>85&&stu[i].argue>80)
sum[i]=sum[i]+4000;
if(stu[i].final>90)
sum[i]=sum[i]+2000;
if(stu[i].final>85&&stu[i].west=='Y')
sum[i]=sum[i]+1000;
if(stu[i].argue>80&&stu[i].leader=='Y')
sum[i]=sum[i]+850;
}
for (i=0;i<n-1;i++)
for (j=0;j<n-1-i;j++)
if(sum[j]<sum[j+1])
{
term=stu[j];
stu[j]=stu[j+1];
stu[j+1]=term;
m=sum[j];
sum[j]=sum[j+1];
sum[j+1]=m;
}
for(i=0;i<=n-1;i++)
t=t+sum[i];
printf ("%s\n",stu[0].name);
printf("%d\n",sum[0]);
printf("%d\n",t);
}
| 39 |
19,440 | int main()
{
char name[20],name1[20],gb,xb;
int n,aver,py,lw,max=0,i,j;
long int total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
int sum=0;
scanf("%s %d %d %c %c %d",name,&aver,&py,&gb,&xb,&lw);
if(aver>80&&lw>=1) sum+=8000;
if(aver>85&&py>80) sum+=4000;
if(aver>90) sum+=2000;
if(aver>85&&xb=='Y') sum+=1000;
if(py>80&&gb=='Y') sum+=850; total+=sum;
if(sum>max)
{
max=sum;
for(j=0;j<20;j++)
{
name1[j]=name[j];
}}
}
printf("%s\n%d\n%d\n",name1,max,total);
return 0;
}
| 39 |
19,441 | struct
{
char name[21];
int test,grade,paper,sum;
char monitor,west;
}stu[100];
int main()
{
int n,i,j,s=0,a,b=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",
stu[i].name,
&stu[i].test,
&stu[i].grade,
&stu[i].monitor,
&stu[i].west,
&stu[i].paper);
stu[i].sum=0;
if(stu[i].test>80&&stu[i].paper>=1) stu[i].sum+=8000;
if(stu[i].test>85&&stu[i].grade>80) stu[i].sum+=4000;
if(stu[i].test>90) stu[i].sum+=2000;
if(stu[i].test>85&&stu[i].west=='Y') stu[i].sum+=1000;
if(stu[i].grade>80&&stu[i].monitor=='Y') stu[i].sum+=850;
s+=stu[i].sum;
}
a=stu[0].sum;
for(i=1;i<n;i++){
if(stu[i].sum>a){
a=stu[i].sum;
b=i;
}
}
printf("%s\n%d\n%d",stu[b].name,stu[b].sum,s);
return 0;
}
| 39 |
19,442 | int main(){
int i,n,m,a,b,k,max;
char c1,c2;
char na[100][100];
long sum,s[1000]={0};
scanf("%d",&n);
sum=0;max=0;
for (i=0;i<n;i++){
s[i]=0;
scanf("%s %d %d %c %c %d",na[i],&a,&b,&c1,&c2,&k);
if (a>80&&k>=1) s[i]+=8000;
if (a>85&&b>80) s[i]+=4000;
if (a>90) s[i]+=2000;
if (a>85&&c2=='Y') s[i]+=1000;
if (b>80&&c1=='Y') s[i]+=850;
sum+=s[i];
if (max<s[i]) {max=s[i];m=i;}
}
printf("%s\n",na[m]);
printf("%d\n",s[m]);
printf("%d\n",sum);
return 0;
}
| 39 |
19,443 | int main()
{
int n,maxmoney,i;
char maxname[20];
struct
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int paper;
}student[101];
int money[101];
scanf("%d", &n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&student[i].name, &student[i].qimo,&student[i].banji,
&student[i].ganbu,&student[i].xibu,&student[i].paper);
}
int total=0;
for(i=1;i<=n;i++)
{
money[i]=0;
//printf("%d %d\n",student[i].qimo,student[i].paper);
if((student[i].qimo>80) && (student[i].paper>=1))
{
money[i] += 8000;
//printf("%d\n",money[i]);
}
if((student[i].qimo>85) && (student[i].banji>80))
{
money[i] += 4000;
//printf("%d\n",money[i]);
}
if(student[i].qimo>90)
money[i] += 2000;
//printf("%d\n",money[i]);
if((student[i].qimo>85) && (student[i].xibu=='Y'))
money[i] += 1000;
//printf("%d\n",money[i]);
if((student[i].banji>80) && (student[i].ganbu=='Y'))
money[i] += 850;
//printf("%d\n",money[i]);*/
total = total + money[i];
}
maxmoney = money[1];
strcpy(maxname , student[1].name);
for(i=2;i<=n;i++)
{
if(money[i] > maxmoney)
{
maxmoney=money[i];
strcpy(maxname,student[i].name);
}
}
printf("%s\n%d\n%d\n",maxname,maxmoney,total);
return 0;
} | 39 |
19,444 | int main()
{
struct stu
{
char name[20];
int a;
int b;
char c[1];
char d[1];
int e;
int m;
}s[100];
int n,i,max=0,t,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %s %s %d\n",s[i].name,&s[i].a,&s[i].b,s[i].c,s[i].d,&s[i].e);
for(i=0;i<n;i++)
s[i].m=0;
for(i=0;i<n;i++)
{
if(((s[i].a)>80)&&((s[i].e)>0))
s[i].m+=8000;
if(((s[i].a)>85)&&((s[i].b)>80))
s[i].m+=4000;
if((s[i].a)>90)
s[i].m+=2000;
if(((s[i].a)>85)&&((s[i].d[0])=='A'+24))
s[i].m+=1000;
if(((s[i].b)>80)&&((s[i].c[0])=='A'+24))
s[i].m+=850;
}
for(i=0;i<n;i++)
{
if(s[i].m>max)
{
max=s[i].m;
t=i;
}
}
for(i=0;i<n;i++)
sum+=s[i].m;
printf("%s\n",s[t].name);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
| 39 |
19,445 |
int main()
{
int n;
scanf("%d",&n);
struct student
{
char name[20];
int scores1,scores2,paper;
char a,b;
}s[100];
int p[100];
int i;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&s[i].name,&s[i].scores1,&s[i].scores2,&s[i].a,&s[i].b,&s[i].paper);
}
int sum;
for(i=0;i<n;i++)
{
sum=0;
if(s[i].scores1>80&&s[i].paper>=1)
{
sum+=8000;
}
if(s[i].scores1>85&&s[i].scores2>80)
{
sum+=4000;
}
if(s[i].scores1>90)
{
sum+=2000;
}
if(s[i].scores1>85&&s[i].b=='Y')
{
sum+=1000;
}
if(s[i].scores2>80&&s[i].a=='Y')
{
sum+=850;
}
p[i]=sum;
}
int max=0,c=0;
for(i=0;i<n;i++)
{
if(p[i]>=max)
{
max=p[i];
}
c+=p[i];
}
for(i=0;i<n;i++)
{
if(p[i]==max)
{
printf("%s\n%d\n%d\n",s[i].name,p[i],c);
break;
}
}
return 0;
}
| 39 |
19,446 | void main ( )
{
int n,i,j;
char name[100][20],c[100],d[100];
int a[100],b[100],e[100],t[100],p=0,tot=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&name[i],&a[i],&b[i],&c[i],&d[i],&e[i]);
for(i=0;i<n;i++)
{
t[i]=0;
if(a[i]>80 && e[i]>0)
t[i]=t[i]+8000;
if(a[i]>85 && b[i]>80)
t[i]=t[i]+4000;
if(a[i]>90)
t[i]=t[i]+2000;
if(a[i]>85 && d[i]==89)
t[i]=t[i]+1000;
if(b[i]>80 && c[i]==89)
t[i]=t[i]+850;
if(t[i]>p)
p=t[i];
tot=tot+t[i];
}
j=0;
while(t[j]<p)
j++;
printf("%s\n",name[j]);
printf("%d\n",p);
printf("%d\n",tot);
}
| 39 |
19,447 |
struct stu
{
char name[20];
int final;
int assess;
char leader;
char west;
int paper;
};
int main(int argc, char* argv[])
{int k,n,i,total[100],tota=0,max=0;
struct stu ppl[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",ppl[i].name,&ppl[i].final,&ppl[i].assess,&ppl[i].leader,&ppl[i].west,&ppl[i].paper);
}
for(i=0;i<n;i++)
{total[i]=8000*(ppl[i].final>80&&ppl[i].paper>=1)+
4000*(ppl[i].final>85&&ppl[i].assess>80)+
2000*(ppl[i].final>90)+
1000*(ppl[i].final>85&&ppl[i].west=='Y')+
850*(ppl[i].assess>80&&ppl[i].leader=='Y');
tota=tota+total[i];
if(total[i]>max)
{
max=total[i];
k=i;
}
}
printf("%s\n%d\n%d\n",ppl[k].name,max,tota);
return 0;
}
| 39 |
19,448 | int n;
struct stu{char name[21];int g1;int g2;char y1;char y2;int g3;int g;struct stu *next;};
struct stu *cr(void)
{struct stu *head;
struct stu *p1,*p2;
int i;
p1=p2=(struct stu*)malloc(LEN);
for(i=0;i<n;i++)
{if(i==0) head=p1;
else p2->next=p1;
p2=p1;
scanf("%s %d %d %c %c %d",&p1->name,&p1->g1,&p1->g2,&p1->y1,&p1->y2,&p1->g3);
p1->g=(p1->g1/81)*((p1->g3+10)/11)*8000+(p1->g1/86)*(p1->g2/81)*4000+(p1->g1/91)*2000+(p1->g1/86)*(p1->y2/81)*1000+(p1->g2/81)*(p1->y1/81)*850;
p1=(struct stu*)malloc(LEN);
}
p2->next=NULL;
return (head);
}
int main()
{int i,max=0,sum=0;
struct stu *p,*q;
scanf("%d",&n);
p=q=cr();
for(i=0;i<n;i++)
{if((p->g)>max) max=p->g;
sum=sum+p->g;
p=p->next;}
for(i=0;i<n;i++)
{if((q->g)==max) {printf("%s\n%d\n%d\n",q->name,q->g,sum); break;}
q=q->next;}
}
| 39 |
19,449 | struct student
{
char name[20];
int a;
int b;
char c1;
char c2;
int d;
}stu[100];
int main()
{
int n,i,p[100]={0},sum=0,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].name);
scanf("%d %d %c %c %d",&stu[i].a,&stu[i].b,&stu[i].c1,&stu[i].c2,&stu[i].d);
}
for(i=0;i<n;i++)
{
if((stu[i].a>80)&&(stu[i].d>0))
p[i]=p[i]+8000;
if((stu[i].a>85)&&(stu[i].b>80))
p[i]=p[i]+4000;
if(stu[i].a>90)
p[i]=p[i]+2000;
if((stu[i].a>85)&&(stu[i].c2=='Y'))
p[i]=p[i]+1000;
if((stu[i].b>80)&&(stu[i].c1=='Y'))
p[i]=p[i]+850;
sum=sum+p[i];
}
max=p[0];
for(i=0;i<n;i++)
{
if(p[i]>max)
max=p[i];
}
for(i=0;i<n;i++)
{
if(p[i]==max)
{
printf("%s\n",stu[i].name);
printf("%d\n",p[i]);
break;
}
}
printf("%d\n",sum);
return 0;
} | 39 |
19,450 | void main()
{
int n,i,r;
char a[101][50],b[101],c[101];
int d[101],e[101],f[101],g[150];
scanf("%d",&n);
for (i=0;i<n;i++)
{
g[i]=0;
scanf("%s %d %d %c %c %d",a[i],&d[i],&e[i],&b[i],&c[i],&f[i]);
if (d[i]>80&&f[i]>=1)
g[i]=g[i]+8000;
if (d[i]>85&&e[i]>80)
g[i]=g[i]+4000;
if (d[i]>90)
g[i]=g[i]+2000;
if (d[i]>85&&c[i]=='Y')
g[i]=g[i]+1000;
if (e[i]>80&&b[i]=='Y')
g[i]=g[i]+850;
}
g[101]=0;g[102]=0;
for (i=0;i<n;i++)
{
g[102]=g[102]+g[i];
if (g[i]>g[101])
{
g[101]=g[i];r=i;
}
}
printf("%s\n",a[r]);
printf("%d\n",g[101]);
printf("%d\n",g[102]);
} | 39 |
19,451 | void main()
{
struct information
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int money;
}info[100];
int n,max,sum=0,i;
char scholar[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",info[i].name,&info[i].qimo,&info[i].banji,&info[i].ganbu,&info[i].xibu,&info[i].lunwen);
info[i].money=0;
}
for(i=0;i<n;i++)
{
if(info[i].qimo>80&&info[i].lunwen>0)
info[i].money+=8000;
if(info[i].qimo>85&&info[i].banji>80)
info[i].money+=4000;
if(info[i].qimo>90)
info[i].money+=2000;
if(info[i].qimo>85&&info[i].xibu=='Y')
info[i].money+=1000;
if(info[i].banji>80&&info[i].ganbu=='Y')
info[i].money+=850;
sum+=info[i].money;
}
strcpy(scholar,info[0].name);
max=info[0].money;
for(i=0;i<n;i++)
{
if(max<info[i].money)
{
max=info[i].money;
strcpy(scholar,info[i].name);
}
}
printf("%s\n%d\n%d\n",scholar,max,sum);
}
| 39 |
19,452 |
struct Scholarship
{
char name[20];
int final;
int classmate;
char leader;
char westerner;
int paper;
double sum;
}a[100];
int main()
{
int n;
int i,j;
int count=0;
double max=0,total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].final,&a[i].classmate,&a[i].leader,&a[i].westerner,&a[i].paper);
}
for(i=0;i<n;i++)
{
a[i].sum=0;
if(a[i].final>80 && a[i].paper>=1)
a[i].sum=a[i].sum+8000;
if(a[i].final>85 && a[i].classmate>80)
a[i].sum=a[i].sum+4000;
if(a[i].final>90)
a[i].sum=a[i].sum+2000;
if(a[i].final>85 && a[i].westerner=='Y')
a[i].sum=a[i].sum+1000;
if(a[i].classmate>80 && a[i].leader=='Y')
a[i].sum=a[i].sum+850;
total=total+a[i].sum;
}
for(i=0;i<n;i++)
{
if(a[i].sum>max)
{
max=a[i].sum;
count=i;
}
}
printf("%s\n",a[count].name);
printf("%.0lf\n",a[count].sum);
printf("%.lf\n",total);
return 0;
} | 39 |
19,453 | //#include<stdafx.h>
struct stu
{
char name[20];
int final;
int rate;
char leader;
char west;
int paper;
int money;
struct stu *next;
};
struct stu *max;
struct stu *p1,*p2,*head;
int prize(struct stu *p)
{
p->money=0;
if(p->final>80&&p->paper>0)
p->money+=8000;
if(p->final>85&&p->rate>80)
p->money+=4000;
if(p->final>90)
p->money+=2000;
if(p->final>85&&p->west=='Y')
p->money+=1000;
if(p->rate>80&&p->leader=='Y')
p->money+=850;
return(p->money);
}
struct stu *create(int n)
{
int i=0;
p1=p2=(struct stu *)malloc(sizeof(struct stu));
head=0;
max=p2;
while(i<n)
{
if(i==0)
head=p1;
else p2->next=p1;
p2=p1;
scanf("%s %d %d %c %c %d",p2->name,&p2->final,&p2->rate,
&p2->leader,&p2->west,&p2->paper);
p2->money=prize(p2);
if(p2->money>max->money)
max=p2;
p1=(struct stu *)malloc(sizeof(struct stu));
i++;
}
p2->next=0;
return(head);
}
int sum(struct stu *head)
{
struct stu *p;
int sum;
p=head;
sum=p->money;
while(p->next!=0)
{
p=p->next;
sum+=p->money;
}
return(sum);
}
void main()
{
int n;
scanf("%d",&n);
p1=create(n);
printf("%s\n%d\n",max->name,max->money);
printf("%d",sum(p1));
} | 39 |
19,454 | int main()
{
char name[100][20]={'\0'};
int qimo[100]={0};
int ban[100]={0};
char xue[100]={'\0'};
char xi[100]={'\0'};
int lun[100]={0};
int n;
int sum[100]={0};
int max=0;
char ma[100]={'\0'};
int i,j,k;
int zong=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",name[i],&qimo[i],&ban[i],&xue[i],&xi[i],&lun[i]);
}
for (i=0;i<n;i++)
{
if(qimo[i]>80&&lun[i]>=1) sum[i]=sum[i]+8000;
if (qimo[i]>85&&ban[i]>80) sum[i]=sum[i]+4000;
if (qimo[i]>90) sum[i]=sum[i]+2000;
if (qimo[i]>85&&xi[i]=='Y') sum[i]=sum[i]+1000;
if (ban[i]>80&&xue[i]=='Y') sum[i]=sum[i]+850;
}
for (i=0;i<n;i++)
{
if (max<sum[i])
{
max=sum[i];
strcpy(ma,name[i]);
}
zong=zong+sum[i];
}
printf("%s\n%d\n%d",ma,max,zong);
return 0;
}
| 39 |
19,455 | void main()
{
struct student
{
char name[30];
int num1;
int num2;
char isstu;
char iswest;
int paper;
}stu[100];
int n,i,max,all=0;
int reward[100];
scanf("%d",&n);
for(i=0;i<n;i++)
reward[i]=0;
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].num1,&stu[i].num2,&stu[i].isstu,&stu[i].iswest,&stu[i].paper);
for(i=0;i<n;i++)
{
if(stu[i].num1>80&&stu[i].paper>=1)
reward[i]=reward[i]+8000;
if(stu[i].num1>85&&stu[i].num2>80)
reward[i]=reward[i]+4000;
if(stu[i].num1>90)
reward[i]=reward[i]+2000;
if(stu[i].num1>85&&stu[i].iswest=='Y')
reward[i]=reward[i]+1000;
if(stu[i].num2>80&&stu[i].isstu=='Y')
reward[i]=reward[i]+850;
}
for(i=0;i<n;i++)
all=all+reward[i];
max=reward[0];
for(i=1;i<n;i++)
if(max<reward[i])
max=reward[i];
for(i=0;i<n;i++)
if(max==reward[i])
break;
printf("%s\n%d\n%d\n",stu[i].name,reward[i],all);
}
| 39 |
19,456 |
struct student
{
char name[20];
int scorefinal;
int scoreclass;
char gan;
char xi;
int lun;
int money;
struct student *next;
};
main()
{
int n,j,sum=0,flag=0;
struct student *head;
struct student *p1,*p2,*p5,*p4,*p;
scanf("%d",&n);
p1=p2=(struct student*)malloc(LEN);
p1->money=0;
scanf("%s %d %d %c %c %d",p1->name,&p1->scorefinal,&p1->scoreclass,&p1->gan,&p1->xi,&p1->lun);
head=p1;
for(j=0;j<n-1;j++)
{
p1=(struct student*)malloc(LEN);
p1->money=0;
p2->next=p1;
p2=p1;
scanf("%s %d %d %c %c %d",p1->name,&p1->scorefinal,&p1->scoreclass,&p1->gan,&p1->xi,&p1->lun);
}
p2->next=NULL;
p5=head;
for(;p5!=NULL;p5=p5->next)
{ if(p5->scorefinal>80&&p5->lun>=1) p5->money=p5->money+8000;
if(p5->scorefinal>85&&p5->scoreclass>80) p5->money=p5->money+4000;
if(p5->scorefinal>90) p5->money=p5->money+2000;
if(p5->scorefinal>85&&p5->xi=='Y') p5->money=p5->money+1000;
if(p5->scoreclass>80&&p5->gan=='Y') p5->money=p5->money+850;
sum=sum+p5->money;
}
for(p4=head;p4!=NULL;p4=p4->next)
{
if(p4->money>flag)
{flag=p4->money;p=p4;}
}
printf("%s\n%d\n%d",p->name,flag,sum);
} | 39 |
19,457 | struct stu
{
char a[21];
int b[2];
char c;
char d;
int e;
int sum;
};
int main()
{
struct stu h[100];
int n,i,j,k,sum1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d%d %c %c%d",h[i].a,&h[i].b[0],&h[i].b[1],&h[i].c,&h[i].d,&h[i].e);
h[i].sum=0;
if(h[i].b[0]>80&&h[i].e>=1)
h[i].sum=h[i].sum+8000;
if(h[i].b[0]>85&&h[i].b[1]>80)
h[i].sum=h[i].sum+4000;
if(h[i].b[0]>90)
h[i].sum=h[i].sum+2000;
if(h[i].b[0]>85&&h[i].d=='Y')
h[i].sum=h[i].sum+1000;
if(h[i].b[1]>80&&h[i].c=='Y')
h[i].sum=h[i].sum+850;
}
// for(i=0;i<n;i++)
// printf("%d\n",h[i].sum);
k=0;
sum1=h[0].sum;
for(i=1;i<n;i++)
{
if(h[k].sum<h[i].sum)
k=i;
sum1=sum1+h[i].sum;
}
printf("%s\n%d\n%d\n",h[k].a,h[k].sum,sum1);
return 0;
}
| 39 |
19,458 | int main()
{
char s[20],q[20];
char a,b;
int k,m,n,p,i,amount,max,sum;
max=0;
sum=0;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%s",s);
scanf("%d%d ",&m,&n);
scanf("%c %c",&a,&b);
scanf("%d",&p);
amount=0;
if((m>80) && (p>=1))
amount+=8000;
if((m>85) && (n>80))
amount+=4000;
if(m>90)
amount+=2000;
if((m>85) && (b=='Y'))
amount+=1000;
if((n>80) && (a=='Y'))
amount+=850;
sum+=amount;
if(amount>max)
{
strcpy(q,s);
max=amount;
}
}
printf("%s\n",q);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
| 39 |
19,459 |
struct stu
{
char name[21];
int s1;
int s2;
char g;
char x;
int l;
int m;
}stu[101];
int main(int argc, char* argv[])
{
int n,i,j,sum=0,len,max=0,num;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].g,&stu[i].x,&stu[i].l);
stu[i].m=0;
if(stu[i].s1>80&&stu[i].l>=1){
stu[i].m+=8000;
}
if(stu[i].s1>85&&stu[i].s2>80){
stu[i].m+=4000;
}
if(stu[i].s1>90){
stu[i].m+=2000;
}
if(stu[i].s1>85&&stu[i].x=='Y'){
stu[i].m+=1000;
}
if(stu[i].s2>80&&stu[i].g=='Y'){
stu[i].m+=850;
}
sum+=stu[i].m;
if(stu[i].m>max){
max=stu[i].m;
num=i;
}
}
printf("%s\n%d\n%d",stu[num].name,stu[num].m,sum);
return 0;
}
| 39 |
19,460 |
struct sch
{
char name[21];
int finalg;
int classg;
char leader;
char west;
int paper;
int tot;
};
int TOTAL=0;
int money(struct sch *stu)
{ stu->tot=0;
if(stu->finalg>80)
{ if(stu->paper>=1)stu->tot+=yuanshi;
if(stu->finalg>85)
{
if(stu->classg>80) stu->tot+=wusi;
if(stu->west=='Y') stu->tot+=xibu;
if(stu->finalg>90) stu->tot+=chengyou;
}
}
if((stu->classg>80)&&(stu->leader=='Y'))
stu->tot+=bangong;
TOTAL+=stu->tot;
return stu->tot;
}
void main()
{
struct sch *head,*stu;
int N,i;
scanf("%d",&N);
stu=(struct sch *)malloc(LEN);
head=stu;
scanf("%s %d %d %c %c %d",&stu->name,&stu->finalg,&stu->classg,&stu->leader,&stu->west,&stu->paper);
stu->tot=money(stu);
for(i=1;i<N;i++)
{ stu=(struct sch *)malloc(LEN);
scanf("%s %d %d %c %c %d",&stu->name,&stu->finalg,&stu->classg,&stu->leader,&stu->west,&stu->paper);
stu->tot=money(stu);
if(stu->tot>head->tot)
head=stu;
}
printf("%s\n",head->name);
printf("%d\n",head->tot);
printf("%d\n",TOTAL);
}
| 39 |
19,461 | void main()
{
struct student
{
char s[20];
int m1;
int m2;
char c1;
char c2;
int n;
int t;
}stu[100],tr;
int i,j,m,t1=0;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%s%d%d %c %c%d",stu[i].s,&stu[i].m1,&stu[i].m2,&stu[i].c1,&stu[i].c2,&stu[i].n);stu[i].t=0;
if(stu[i].m1>80&&stu[i].n>0)
stu[i].t+=8000;
if(stu[i].m1>85&&stu[i].m2>80)
stu[i].t+=4000;
if(stu[i].m1>90)
stu[i].t+=2000;
if(stu[i].m2>80&&stu[i].c1=='Y')
stu[i].t+=850;
if(stu[i].m1>85&&stu[i].c2=='Y')
stu[i].t+=1000;
}
for(i=0;i<m-1;i++)
{
for(j=i+1;j<m;j++)
if(stu[i].t<stu[j].t)
{
tr=stu[i];
stu[i]=stu[j];
stu[j]=tr;
}
}
for(i=0;i<m;i++)
{
t1+=stu[i].t;
}
printf("%s\n%d\n%d\n",stu[0].s,stu[0].t,t1);
}
| 39 |
19,462 | int yuanshi(int a,int b)
{
if(a>80&&b>=1)
return(8000);
else return(0);
}
int wusi(int a,int b)
{
if(a>85&&b>80)
return(4000);
else return(0);
}
int chengji(int a)
{
if(a>90)
return(2000);
else return(0);
}
int xibu(int a,char b)
{
if(a>85&&b=='Y')
return(1000);
else return(0);
}
int gongxian(int a,char b)
{
if(a>80&&b=='Y')
return(850);
else return(0);
}
void main()
{
struct award
{
char name[20];
int qimocj;
int banpingcj;
char ynganbu;
char ynxibu;
int lunwen;
int jiangjin;
}aw[100],temp;
int N,i,j,k,sum;
scanf("%d",&N);
for(i=0;i<N;i++)
{
aw[i].jiangjin=0;
scanf("%s %d %d %c %c %d",&aw[i].name,&aw[i].qimocj,&aw[i].banpingcj,&aw[i].ynganbu,&aw[i].ynxibu,&aw[i].lunwen);
aw[i].jiangjin=yuanshi(aw[i].qimocj,aw[i].lunwen)
+wusi(aw[i].qimocj,aw[i].banpingcj)
+chengji(aw[i].qimocj)
+xibu(aw[i].qimocj,aw[i].ynxibu)
+gongxian(aw[i].banpingcj,aw[i].ynganbu);
}
for(k=0;k<N-1;k++)
{
for(j=0;j<N-1-k;j++)
{
if(aw[j].jiangjin<aw[j+1].jiangjin)
{
temp=aw[j];
aw[j]=aw[j+1];
aw[j+1]=temp;
}
}
}
sum=0;
for(i=0;i<N;i++)
{
sum=sum+aw[i].jiangjin;
}
printf("%s\n%d\n%d",aw[0].name,aw[0].jiangjin,sum);
} | 39 |
19,463 | struct stu
{
char name[25];
int s1;
int s2;
char y1;
char y2;
int t;
int sum;
struct stu *next;
};
struct stu *creat(int n)
{
int i;
struct stu *head;
struct stu *p1,*p2;
p1=p2=(struct stu *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->y1,&p1->y2,&p1->t);
head=NULL;
for(i=0;i<n-1;i++)
{
if(i==0)head=p1;
p1=(struct stu*)malloc(sizeof(struct stu));
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->y1,&p1->y2,&p1->t);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return (head);
}
void print(struct stu*head)
{
struct stu*p;
p=head;
if(head!=NULL)
do
{
printf("%s %d %d %c %c %d\n",p->name,p->s1,p->s2,p->y1,p->y2,p->t);
p=p->next;
}while(p!=NULL);
}
main()
{
int n,i,s,max;
struct stu *head,*p1,*p2,*p3,*p;
scanf("%d",&n);
head=creat(n);
p3=p2=p1=head;
for(i=0;i<n;i++)
{
p1->sum=0;
if((p1->t>0)&&(p1->s1>80))p1->sum=p1->sum+8000;
if((p1->s2>80)&&(p1->s1>85))p1->sum=p1->sum+4000;
if(p1->s1>90)p1->sum=p1->sum+2000;
if((p1->y2=='Y')&&(p1->s1>85))p1->sum=p1->sum+1000;
if((p1->y1=='Y')&&(p1->s2>80))p1->sum=p1->sum+850;
p1=p1->next;
}
max=0;
p1=head;
for(i=0;i<n;i++)
{
if(p1->sum>max)
{
max=p1->sum;
p2=p1;
}
p1=p1->next;
}
s=0;
p1=head;
for(i=0;i<n;i++)
{
s=s+p1->sum;
p1=p1->next;
}
printf("%s\n%d\n%d\n",p2->name,p2->sum,s);
}
| 39 |
19,464 |
struct scholarship
{
char name[20];
int avscore;
int clscore;
char ganbu;
char xibu;
int paper;
}stu[100];
void main()
{
int n,i,b[100]={0},c=0,d=0,all=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].avscore,&stu[i].clscore,&stu[i].ganbu,&stu[i].xibu,&stu[i].paper);
if(stu[i].avscore>80&&stu[i].paper>0)
b[i]=b[i]+8000;
if(stu[i].avscore>85&&stu[i].clscore>80)
b[i]=b[i]+4000;
if(stu[i].avscore>90)
b[i]=b[i]+2000;
if(stu[i].avscore>85&&stu[i].xibu=='Y')
b[i]=b[i]+1000;
if(stu[i].ganbu=='Y'&&stu[i].clscore>80)
b[i]=b[i]+850;
if(i>0&&b[i]>c)
{
c=b[i];
d=i;
}
else if(i==0)
c=b[0];
}
for(i=0;i<n;i++)
all=all+b[i];
printf("%s\n%d\n%d\n",stu[d].name,c,all);
} | 39 |
19,465 | int main()
{
struct stu
{
char name[21];
int qm;
int cm;
char xs[21];
char west[21];
int paper;
int sp;
};
struct stu a[101];
int i,n;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",&a[i].name);
scanf("%d",&a[i].qm);
scanf("%d",&a[i].cm);
scanf("%s",&a[i].xs);
scanf("%s",&a[i].west);
scanf("%d",&a[i].paper);
a[i].sp=0;
if ((a[i].qm>80)&&(a[i].paper>0)) a[i].sp+=8000;
if ((a[i].qm>85)&&(a[i].cm>80)) a[i].sp+=4000;
if (a[i].qm>90) a[i].sp+=2000;
if ((a[i].qm>85)&&(a[i].west[0]=='Y')) a[i].sp+=1000;
if ((a[i].cm>80)&&(a[i].xs[0]=='Y')) a[i].sp+=850;
}
int max,total;
max=0;
total=0;
for (i=0;i<n;i++)
{
if (a[i].sp>a[max].sp) max=i;
total=total+a[i].sp;
}
printf("%s\n",a[max].name);
printf("%d\n",a[max].sp);
printf("%d\n",total);
return 0;
}
| 39 |
19,466 | struct student
{
char name[20];
int ave;
int cla;
char g;
char x;
int num;
int qian;
struct student *next;
};
void main()
{
int zong,max=0,i,j;
zong=0;
struct student *p,*head,*p2;
p2=p=head=(struct student *)malloc(sizeof(struct student));
int N;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->ave,&p->cla,&p->g,&p->x,&p->num);
p->qian=0;
if(p->ave>80&&p->num>=1)
p->qian+=8000;
if(p->ave>85&&p->cla>80)
p->qian+=4000;
if(p->ave>90)
p->qian+=2000;
if(p->x=='Y'&&p->ave>85)
p->qian+=1000;
if(p->g=='Y'&&p->cla>80)
p->qian+=850;
zong+=p->qian;
if(i==0)
head=p;
p2->next=p;
p2=p;
p=(struct student *)malloc(sizeof(struct student));
}
p2=NULL;
p=head;
for(i=0;i<N;i++)
{
j=p->qian;
max=j>max?j:max;
p=p->next;
}
p=head;
for(i=0;i<N;i++)
{
if(p->qian==max)
{printf("%s\n",p->name);
break; }
p=p->next;
}
printf("%d\n",max);
printf("%d",zong);
}
| 39 |
19,467 | struct student
{
char name[20];
int score;
int ping;
char gan;
char xi;
int lun;
int jiang;
}stu[100];
void main()
{
int n,i,t,h=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].score,
&stu[i].ping,&stu[i].gan,&stu[i].xi,&stu[i].lun);
stu[i].jiang=0;
if(stu[i].score>80&&stu[i].lun>0)
stu[i].jiang+=8000;
if(stu[i].score>85&&stu[i].ping>80)
stu[i].jiang+=4000;
if(stu[i].score>90)
stu[i].jiang+=2000;
if(stu[i].score>85&&stu[i].xi=='Y')
stu[i].jiang+=1000;
if(stu[i].ping>80&&stu[i].gan=='Y')
stu[i].jiang+=850;
}
for(i=0,t=stu[0].jiang;i<n-1;i++)
{
h=h+stu[i].jiang;
if(stu[i+1].jiang>t)
t=stu[i+1].jiang;
}
for(i=0;i<n;i++)
if(stu[i].jiang==t)
{
printf("%s\n%d\n%d",stu[i].name,t,h+stu[n-1].jiang);
break;
}
}
| 39 |
19,468 | int main()
{
struct student
{
char name[20];
int a,b,lunwen;
char ganbu,xibu;
int jiangjin;
}stu[100];
int n,i,t=0;
long int sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d %c %c%d",&stu[i].name,&stu[i].a,&stu[i].b,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);}
for(i=0;i<n;i++){stu[i].jiangjin=0;
if(stu[i].a>80&&stu[i].lunwen>0){stu[i].jiangjin=stu[i].jiangjin+8000;}
if(stu[i].a>85&&stu[i].b>80){stu[i].jiangjin=stu[i].jiangjin+4000;}
if(stu[i].a>90){stu[i].jiangjin=stu[i].jiangjin+2000;}
if(stu[i].a>85&&stu[i].xibu=='Y'){stu[i].jiangjin=stu[i].jiangjin+1000;}
if(stu[i].b>80&&stu[i].ganbu=='Y'){stu[i].jiangjin=stu[i].jiangjin+850;}}
for(i=0;i<n;i++){
if(stu[i].jiangjin>stu[t].jiangjin){t=i;}}
for(i=0;i<n;i++){
sum=sum+stu[i].jiangjin;}
printf("%s\n%d\n%ld",stu[t].name,stu[t].jiangjin,sum);
return 0;
} | 39 |
19,469 | main()
{
struct scholarship{
char name[200];
int gpa,mate,paper;
char official,west;
}stu[100];
int n,sch[100],i,max;
long sum=0;
char num[4];
for(i=0;i<100;i++){
sch[i]=0;
}
gets(num);
n=atoi(num);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].gpa,&stu[i].mate,&stu[i].official,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++){
if(stu[i].gpa>80&&stu[i].paper>=1){
sch[i]+=8000;
}
if(stu[i].gpa>85&&stu[i].mate>80){
sch[i]+=4000;
}
if(stu[i].gpa>90){
sch[i]+=2000;
}
if(stu[i].gpa>85&&stu[i].west=='Y'){
sch[i]+=1000;
}
if(stu[i].mate>80&&stu[i].official=='Y'){
sch[i]+=850;
}
}
max=0;
for(i=0;i<n;i++){
if(sch[i]>max)
max=sch[i];
}
for(i=0;i<n;i++){
sum+=sch[i];
}
for(i=0;i<n;i++){
if(sch[i]==max)
break;
}
printf("%s\n%d\n%ld\n",stu[i].name,sch[i],sum);
return 0;
}
| 39 |
19,470 | struct file
{
char name[100];
int scoreq;
int scorec;
char m,w;
int ati;
int money;
};
int main()
{
struct file f[101];
int n,sum=0;
int i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
f[i].money=0;
}
for(i=0;i<n;i++)
{
scanf("%s",f[i].name);
scanf("%d",&f[i].scoreq);
scanf("%d",&f[i].scorec);
getchar();
f[i].m=getchar();
getchar();
f[i].w=getchar();
getchar();
scanf("%d",&f[i].ati);
}
for(i=0;i<n;i++)
{
if(f[i].scoreq>80&&f[i].ati>=1)
f[i].money+=8000;
if(f[i].scoreq>85&&f[i].scorec>80)
f[i].money+=4000;
if(f[i].scoreq>90)
f[i].money+=2000;
if(f[i].scoreq>85&&f[i].w=='Y')
f[i].money+=1000;
if(f[i].scorec>80&&f[i].m=='Y')
f[i].money+=850;
}
for(i=0;i<n;i++)
sum+=f[i].money;
k=f[0].money;
for(i=0;i<n;i++)
{
if(f[i].money>k)
k=f[i].money;
}
for(i=0;i<n;i++)
{
if(f[i].money==k)
{
printf("%s\n",f[i].name);
printf("%d\n",f[i].money);
break;
}
}
printf("%d",sum);
return 0;
}
| 39 |
19,471 | main()
{
struct{
char name[20];
int qimo,pingyi;
char ban,xi;
int lun,sum;
}num[100];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",num[i].name,&num[i].qimo,&num[i].pingyi,&num[i].ban,&num[i].xi,&num[i].lun);
}
int zong=0;
for(i=0;i<n;i++){
num[i].sum=0;
if(num[i].qimo>80&&num[i].lun>=1)
num[i].sum+=8000;
if(num[i].qimo>85&&num[i].pingyi>80)
num[i].sum+=4000;
if(num[i].qimo>90)
num[i].sum+=2000;
if(num[i].qimo>85&&num[i].xi=='Y')
num[i].sum+=1000;
if(num[i].pingyi>80&&num[i].ban=='Y')
num[i].sum+=850;
zong+=num[i].sum;
}
int w=0,e;
for(i=0;i<n;i++){
if(num[i].sum>w){
w=num[i].sum;
e=i;
}
}
printf("%s\n",num[e].name);
printf("%d\n",w);
printf("%d",zong);
return 0;
} | 39 |
19,472 | struct student
{
char name[25];
int s1;
int s2;
char yn1;
char yn2;
int t;
int sum;
struct student*next;
};
struct student *creat(int n)
{
struct student *head;
struct student *p1,*p2;
int i;
p1=p2=(struct student *)malloc(sizeof (struct student));
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->yn1,&p1->yn2,&p1->t);
head=NULL;
for(i=0;i<n-1;i++)
{
if(i==0)head=p1;
p1=(struct student*)malloc(sizeof(struct student));
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->yn1,&p1->yn2,&p1->t);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return (head);
}
void print(struct student*head)
{
struct student*p;
p=head;
if(head!=NULL)
do
{
printf("%s %d %d %c %c %d\n",p->name,p->s1,p->s2,p->yn1,p->yn2,p->t);
p=p->next;
}while(p!=NULL);
}
main()
{
int n,i,j,k,t,s,max,r=0;
struct student *p1,*p2,*p3,*p;
struct student g;
scanf("%d",&n);
p=creat(n);
//print(p);
p1=p;p2=p;p3=p;
for(i=0;i<n;i++)
{
p1->sum=0;
if((p1->s1>80)&&(p1->t>=1)) p1->sum=p1->sum+8000;
if((p1->s1>85)&&(p1->s2>80)) p1->sum=p1->sum+4000;
if(p1->s1>90) p1->sum=p1->sum+2000;
if((p1->yn2=='Y')&&(p1->s1>85)) p1->sum=p1->sum+1000;
if((p1->yn1=='Y')&&(p1->s2>80)) p1->sum=p1->sum+850;
p1=p1->next;
}
/* for(i=0,p1=p;i<n;i++)
{
printf("\n%s %d\n",p1->name,p1->sum);
p1=p1->next;
}*/
for(max=0,p1=p,p2=p,i=0;i<n;i++)
{
if(p1->sum>max) {max=p1->sum;p2=p1;}
p1=p1->next;
}
/*for(i=0,p1=p->next,p2=p;i<n;i++)
{
if(p1->sum==max) break;
p2=p2->next;
p1=p1->next;
}*/
for(i=0,p1=p,s=0;i<n;i++)
{
s=s+p1->sum;
p1=p1->next;
}
printf("%s\n%d\n%d\n",p2->name,p2->sum,s);
for(i=0,p1=p;i<n;i++)
{
p=p->next;
free(p1);
p1=p;
}
}
| 39 |
19,473 | struct student
{
char name[20];
int end;
int clas;
char leader;
char west;
int paper;
struct student *next;
};
int main()
{
struct student *p,*q,*head;
char *a;
int *b,*c;
int n,i,max=0;
long int sum=0;
scanf("%d\n",&n);
head=p=q=(struct student *)malloc(LEN);
a=(char*)malloc(20*sizeof(char));
b=c=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d\n",p->name,&p->end,&p->clas,&p->leader,&p->west,&p->paper);
p=(struct student *)malloc(LEN);
q->next=p;
q=p;
}
q->next=NULL;
q=p=head;
for(i=0;i<n;i++)
{
if(((p->end)>80)&&((p->paper)>0))*b+=8000;
if(((p->end)>85)&&((p->clas)>80))*b+=4000;
if((p->end)>90)*b+=2000;
if(((p->end)>85)&&((p->west)=='Y'))*b+=1000;
if(((p->clas)>80)&&((p->leader)=='Y'))*b+=850;
b++;
p=q->next;
q=p;
}
q=p=head;
b=c;
for(i=0;i<n;i++)
{
if(*b>max)
{
max=*b;
strcpy(a,p->name);
}
sum+=*b;
b++;
p=q->next;
q=p;
}
printf("%s\n%d\n%ld\n",a,max,sum);
}
| 39 |
19,474 | struct student
{
char name[21];
int final;
int cla;
char stu;
char west;
int paper;
int sch;
};
int award(struct student *p)
{
int total=0;
if(p->final>80&&p->paper>0)
total+=8000;
if(p->final>85&&p->cla>80)
total+=4000;
if(p->final>90)
total+=2000;
if(p->final>85&&p->west=='Y')
total+=1000;
if(p->cla>80&&p->stu=='Y')
total+=850;
return total;
}
int main()
{
int n,i,j;
long int all=0;
struct student s[100],*p[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&s[i].name,&s[i].final,&s[i].cla,&s[i].stu,&s[i].west,&s[i].paper);
p[i]=&s[i];
s[i].sch=award(p[i]);
all+=s[i].sch;
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(s[j].sch>s[i].sch)
{
struct student temp;
temp=s[i];
s[i]=s[j];
s[j]=temp;
}
}
}
printf("%s\n%d\n%ld",s[0].name,s[0].sch,all);
return 0;
}
/*????????8000??????????80??>80???????????1??1?????????????
2) ????????4000??????????85??>85????????????80??>80?????????
3) ????????2000??????????90??>90?????????
4) ????????1000??????????85??>85?????????????
5) ????????850??????????80??>80???????????
???????????N?1 ? N ? 100??????????????N????????????
???????????????????????????????????????????????????*/
| 39 |
19,475 | struct student
{
char name[20];
int final;
int cla;
char west;
char cadre;
int eas;
int sum;
}stu[100];
void main()
{
int n,i;
int all=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].cla,&stu[i].cadre,&stu[i].west,&stu[i].eas);
if((stu[i].final>80)&&(stu[i].eas>=1))
stu[i].sum=stu[i].sum+8000;
if((stu[i].final>85)&&(stu[i].cla>80))
stu[i].sum=stu[i].sum+4000;
if(stu[i].final>90)
stu[i].sum=stu[i].sum+2000;
if((stu[i].final>85)&&(stu[i].west=='Y'))
stu[i].sum=stu[i].sum+1000;
if((stu[i].cla>80)&&(stu[i].cadre=='Y'))
stu[i].sum=stu[i].sum+850;
}
for(i=0;i<n;i++)
{
all=all+stu[i].sum;
}
int most=0;
for(i=1;i<n;i++)
{
if(stu[i].sum>stu[most].sum)
most=i;
}
printf("%s\n%d\n%d\n",stu[most].name,stu[most].sum,all);
} | 39 |
19,476 | struct stu
{
char name[25];
int score;
int clas;
char job;
char west;
int paper;
int sum;
struct stu*next;
};
void main()
{
int n,m=0,max=0,all=0;
char c[25]={'\0'};
scanf("%d",&n);
struct stu*p1,*p2,*head;
struct stu*p;
p1=(struct stu*)malloc(LEN);
scanf("%s%d%d %c %c %d",p1->name,&p1->score,&p1->clas,&p1->job,&p1->west,&p1->paper);
p1->sum=0;
head=NULL;
while(n)
{
m+=1;
if(m==1)
head=p1;
else p2->next=p1;
p2=p1;
p1=(struct stu*)malloc(LEN);
scanf("%s%d%d %c %c %d",p1->name,&p1->score,&p1->clas,&p1->job,&p1->west,&p1->paper);
p1->sum=0;
n--;
}
p2->next=NULL;
p=head;
while(p)
{
if(p->clas>80)
{
if(p->job=='Y')
p->sum+=850;
if(p->score>85)
p->sum+=4000;
}
if(p->score>80)
{
if(p->paper)
p->sum+=8000;
if(p->score>85)
{
if(p->west=='Y')
p->sum+=1000;
if(p->score>90)
p->sum+=2000;
}
}
if(p->sum>max)
{
max=p->sum;
strcpy(c,p->name);
}
all+=p->sum;
p=p->next;
}
puts(c);
printf("%d\n%d",max,all);
}
| 39 |
19,477 | int main()
{ int n,i,k,many[120],wen,qimo,banji,all,who,max,q;
char name[120][50],gan,xi;
scanf("%d",&n);
max=0;q=0;
for(i=1;i<=n;i++){
scanf("%s",&name[i]);
scanf("%d %d %c %c %d",&qimo,&banji,&gan,&xi,&wen);
all=0;
if((qimo>80)&&(wen>=1)) all=all+8000;
if((qimo>85)&&(banji>80)) all=all+4000;
if(qimo>90) all=all+2000;
if((qimo>85)&&(xi=='Y')) all=all+1000;
if((banji>80)&&(gan=='Y')) all=all+850;
q=q+all;
if(all>max){
max=all;
who=i;
}
}
printf("%s\n",name[who]);
printf("%d\n",max);
printf("%d\n",q);
return 0;
}
| 39 |
19,478 | struct student
{
char Name[20];
int agrades;
int bgrades;
char a;
char b;
int n;
};
int main(int argc, char* argv[])
{
struct student *p;
int i,j,num;
scanf("%d",&num);
p=(struct student*)malloc(num*sizeof(struct student));
for(i=0;i<num;i++)
{
scanf("%s%d%d %c %c%d",p[i].Name,&p[i].agrades,&p[i].bgrades,&p[i].a,&p[i].b,&p[i].n);
//printf("%s %d %d %c %c %d",p[i].Name,p[i].agrades,p[i].bgrades,p[i].a,p[i].b,p[i].n);
}
int *p1,*p2;
p1=(int*)malloc(num*sizeof(int));
p2=(int*)malloc(num*sizeof(int));
for(i=0;i<num;i++)
{
p1[i]=0;
p2[i]=0;
if(p[i].agrades>80&&p[i].n>=1)
{
p1[i]++;
p2[i]+=8000;
}
if(p[i].agrades>85&&p[i].bgrades>80)
{
p1[i]++;
p2[i]+=4000;
}
if(p[i].agrades>90)
{
p1[i]++;
p2[i]+=2000;
}
if(p[i].agrades>85&&p[i].b=='Y')
{
p1[i]++;
p2[i]+=1000;
}
if(p[i].bgrades>80&&p[i].a=='Y')
{
p1[i]++;
p2[i]+=850;
}
}
int sum=0;
for(i=0;i<num;i++)
{
sum+=p2[i];
}
int max;
max=p2[0];
for(i=0;i<num;i++)
{
if(max<p2[i])
max=p2[i];
}
for(i=0;i<num;i++)
{
if(max==p2[i])
break;
}
printf("%s\n",p[i].Name);
printf("%d\n",p2[i]);
printf("%d",sum);
return 0;
} | 39 |
19,479 | main()
{
int n,i,k,sut=0,sum=0;
struct
{
char na[21];
int sc;
int op;
char ga;
char we;
int nu;
int su;
}stu[100];
for (i=0;i<100;i++)
{
stu[i].su=0;
}
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",stu[i].na);
scanf("%d",&stu[i].sc);
scanf("%d ",&stu[i].op);
scanf("%c ",&stu[i].ga);
scanf("%c",&stu[i].we);
scanf("%d",&stu[i].nu);
}
for (i=0;i<n;i++)
{
if ((stu[i].sc>80)&&(stu[i].nu>0))
stu[i].su+=8000;
if ((stu[i].sc>85)&&(stu[i].op>80))
stu[i].su+=4000;
if (stu[i].sc>90)
stu[i].su+=2000;
if ((stu[i].sc>85)&&(stu[i].we=='Y'))
stu[i].su+=1000;
if ((stu[i].op>80)&&(stu[i].ga=='Y'))
stu[i].su+=850;
}
for (i=0;i<n;i++)
{
if (sut<stu[i].su)
{
k=i;
sut=stu[i].su;
}
}
for (i=0;i<n;i++)
sum+=stu[i].su;
printf("%s\n%d\n%d\n",stu[k].na,sut,sum);
} | 39 |
19,480 | struct student
{
char name[20];
int ave;
int cla;
char leader;
char west;
int paper;
};
void main()
{
struct student stu[200];
int n,i,count[200],count2[200],k,j,temp,l,all,max;
all=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
count[i]=0;
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].ave,&stu[i].cla,&stu[i].leader,&stu[i].west,&stu[i].paper);
if(stu[i].ave>80&&stu[i].paper>=1)
count[i]=count[i]+8000;
if(stu[i].ave>85&&stu[i].cla>80)
count[i]=count[i]+4000;
if(stu[i].ave>90)
count[i]=count[i]+2000;
if(stu[i].ave>85&&stu[i].west=='Y')
count[i]=count[i]+1000;
if(stu[i].cla>80&&stu[i].leader=='Y')
count[i]=count[i]+850;
all=all+count[i];
}
for(k=0;k<n;k++)
count2[k]=count[k];
max=count[0];
for(j=0;j<n;j++)
if(count[j]>max)
max=count[j];
for(l=0;l<n;l++)
if(count2[l]==max)
break;
printf("%s\n%d\n%d\n",stu[l].name,max,all);
}
| 39 |
19,481 | int main()
{
struct s{
char n[20];
int p1,p2,p3;
char a,b;
}st[100];
int money[100]={0};
int i,num;
int sum=0,m,h;
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%s %d %d %c %c %d",st[i].n,&st[i].p1,&st[i].p2,&st[i].a,&st[i].b,&st[i].p3);
}
for(i=0;i<num;i++)
{
if(st[i].p1>80&&st[i].p3>=1)
{
money[i]+=8000;
}
if(st[i].p1>85&&st[i].p2>80)
{
money[i]+=4000;
}
if(st[i].p1>90)
{
money[i]+=2000;
}
if(st[i].p1>85&&(int)st[i].b=='Y')
{
money[i]+=1000;
}
if(st[i].p2>80&&(int)st[i].a=='Y')
{
money[i]+=850;
}
}
m=money[0];
h=0;
for(i=1;i<num;i++)
{
if(money[i]>m)
{
m=money[i];
h=i;
}
}
for(i=0;i<num;i++)
{
sum+=money[i];
}
printf("%s\n",st[h].n);
printf("%d\n",m);
printf("%d\n",sum);
return 0;
} | 39 |
19,482 | void main()
{
int n,all=0,i,j;
struct student
{
char name[20];
int score1;
int score2;
char ganbu;
char west;
int article;
int money;
}stu[100],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,
&stu[i].score1,&stu[i].score2,&stu[i].ganbu,&stu[i].west,
&stu[i].article);
}//?????????
//???????????????????
for(i=0;i<n;i++)
{
stu[i].money=0;
if(stu[i].score1>80&&stu[i].article>=1)
stu[i].money+=8000;
if(stu[i].score1>85&&stu[i].score2>80)
stu[i].money+=4000;
if(stu[i].score1>90)
stu[i].money+=2000;
if(stu[i].score1>85&&stu[i].west=='Y')
stu[i].money+=1000;
if(stu[i].score2>80&&stu[i].ganbu=='Y')
stu[i].money+=850;
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(stu[j].money<stu[j+1].money)
{
temp=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp;
}
}
}
printf("%s\n",stu[0].name);
printf("%d\n",stu[0].money);
for(i=0;i<n;i++)
all+=stu[i].money;
printf("%d\n",all);
}
| 39 |
19,483 |
struct student
{char name[20];
int test;
int judge;
char leader;
char west;
int paper;
};struct student stu[100];
void main()
{int m=0,n,i;
long sum,t=0,a[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].test,&stu[i].judge,&stu[i].leader,&stu[i].west,&stu[i].paper);
}
for(sum=0,i=0;i<n;i++)
{if(stu[i].test>80&&stu[i].paper>0) {a[i]=a[i]+8000;}
if(stu[i].test>85&&stu[i].judge>80) {a[i]=a[i]+4000;}
if(stu[i].test>90) {a[i]=a[i]+2000;}
if(stu[i].test>85&&(stu[i].west=='Y')) {a[i]=a[i]+1000;}
if(stu[i].judge>80&&(stu[i].leader=='Y') ) {a[i]=a[i]+850;}
sum=sum+a[i];
if(a[i]>t) {t=a[i];m=i;}
}
printf("%s\n",stu[m].name);
printf("%ld\n",t);
printf("%ld\n",sum);
} | 39 |
19,484 | void main()
{
struct s
{
char a[20];
int b;
int c;
char d;
char e;
int f;
int g;
struct s *next;
};
int m,n,i,j,k,t,max,sum;
struct s *p1,*p2,*head;
scanf("%d",&n);
head=0;
p1=p2=(struct s *)malloc(sizeof(struct s));
head=p1;
scanf("%s %d %d %c %c %d",p1->a,&p1->b,&p1->c,&p1->d,&p1->e,&p1->f);
for(i=0;i<n-1;i++)
{
p1=(struct s *)malloc(sizeof(struct s));
p2->next=p1;
p2=p1;
scanf("%s %d %d %c %c %d",p1->a,&p1->b,&p1->c,&p1->d,&p1->e,&p1->f);
}
p2->next=0;
p1=p2=head;
for(i=0;i<n;i++)
{
p1->g=0;
if(p1->b>80&&p1->f>0)
p1->g=p1->g+8000;
if(p1->b>85&&p1->c>80)
p1->g=p1->g+4000;
if(p1->b>90)
p1->g=p1->g+2000;
if(p1->b>85&&p1->e=='Y')
p1->g=p1->g+1000;
if(p1->c>80&&p1->d=='Y')
p1->g=p1->g+850;
p2=p1->next;
p1=p2;
}
p1=p2=head;
max=p1->g;
for(i=0;i<n-1;i++)
{
p2=p1->next;
p1=p2;
if(p1->g>max)
{
max=p1->g;
m=i;
}
}
p1=head;
for(i=0;i<m+1;i++)
p1=p1->next;
printf("%s\n%d\n",p1->a,p1->g);
p1=head;
sum=0;
for(i=0;i<n;i++)
{
sum=sum+p1->g;
p1=p1->next;
}
printf("%d",sum);
} | 39 |
19,485 |
struct Student{
char name[21];
int avg;
int cls;
char off;
char west;
int paper;
};
int main()
{
int i,j,N,high;
long sch[100]={0};
long schtot=0;
char c;
struct Student ptcpt[100];
struct Student tmp;
scanf("%d",&N);
for (i=0;i<N-1;i++){
j=0;
while (j<22&&(c=getchar())!=' '){
ptcpt[i].name[j]=c;
j++;
}
ptcpt[i].name[j]='\0';
scanf(" %d %d %c %c %d\n",&ptcpt[i].avg,&ptcpt[i].cls,&ptcpt[i].off,&ptcpt[i].west,&ptcpt[i].paper);
if (ptcpt[i].avg>80&&ptcpt[i].paper>=1){
sch[i]=sch[i]+8000;}
if (ptcpt[i].avg>85&&ptcpt[i].cls>80){
sch[i]=sch[i]+4000;}
if (ptcpt[i].avg>90){
sch[i]=sch[i]+2000;}
if (ptcpt[i].avg>85&&ptcpt[i].west=='Y'){
sch[i]=sch[i]+1000;}
if (ptcpt[i].cls>80&&ptcpt[i].off=='Y'){
sch[i]=sch[i]+850;}
schtot=schtot+sch[i];
}
j=0;
while (j<22&&(c=getchar())!=' '){
ptcpt[N-1].name[j]=c;
j++;
}
ptcpt[N-1].name[j]='\0';
scanf(" %d %d %c %c %d",&ptcpt[N-1].avg,&ptcpt[N-1].cls,&ptcpt[N-1].off,&ptcpt[N-1].west,&ptcpt[N-1].paper);
if (ptcpt[N-1].avg>80&&ptcpt[N-1].paper>=1) {
sch[N-1]=sch[N-1]+8000;
}
if (ptcpt[N-1].avg>85&&ptcpt[N-1].cls>80){
sch[N-1]=sch[N-1]+4000;}
if (ptcpt[N-1].avg>90){
sch[N-1]=sch[N-1]+2000;}
if (ptcpt[N-1].avg>85&&ptcpt[N-1].west=='Y'){
sch[N-1]=sch[N-1]+1000;}
if (ptcpt[N-1].cls>80&&ptcpt[N-1].off=='Y'){
sch[N-1]=sch[N-1]+850;}
schtot=schtot+sch[N-1];
strcpy(tmp.name,ptcpt[N-1].name);
high=sch[N-1];
for (i=N-1;i>-1;i--){
if (high<=sch[i]){
strcpy(tmp.name,ptcpt[i].name);
high=sch[i];
}
else continue;
}
printf("%s\n%d\n%ld",tmp.name,high,schtot);
return 0;
} | 39 |
19,486 |
int main()
{
struct student
{
char name[21];
int score1;
int score2;
char leader;
char west;
int essay;
struct student *next,*last;
};
struct student *p;
int n,i,sum=0,scholar,max=0;
char goodstudent[21];
scanf("%d",&n);
for(i=0;i<n;i++)
{
p=(struct student*)malloc(sizeof(struct student));
scanf("%s%d%d %c %c%d",p->name,&p->score1,&p->score2,&p->leader,&p->west,&p->essay);
scholar=0;
if(p->score1>80&&p->essay>=1) scholar+=8000;
if(p->score1>85&&p->score2>80) scholar+=4000;
if(p->score1>90) scholar+=2000;
if(p->score1>85&&p->west=='Y') scholar+=1000;
if(p->score2>80&&p->leader=='Y') scholar+=850;
sum+=scholar;
if(scholar>max)
{
max=scholar;
strcpy(goodstudent,"");
strcpy(goodstudent,p->name);
}
free(p);
}
printf("%s\n%d\n%d",goodstudent,max,sum);
return 0;
} | 39 |
19,487 | int main()
{
struct student{
char name[20];
int qimo;
int banji;
char xibu;
char ganbu;
int lunwen;
int fee;
}stu[102];
int i,sum=0,n,max;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d\n",stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
}
for(i=0;i<102;i++)
{
stu[i].fee=0;
}
for(i=0;i<n;i++)
{
if(stu[i].qimo>80&&stu[i].lunwen>0)
stu[i].fee+=8000;
if(stu[i].qimo>85&&stu[i].banji>80)
stu[i].fee+=4000;
if(stu[i].qimo>90)
stu[i].fee+=2000;
if(stu[i].qimo>85&&stu[i].xibu=='Y')
stu[i].fee+=1000;
if(stu[i].banji>80&&stu[i].ganbu=='Y')
stu[i].fee+=850;
sum+=stu[i].fee;
}
max=stu[0].fee;
for(i=1;i<n;i++)
{
if(stu[i].fee>max)
max=stu[i].fee;
}
for(i=0;i<n;i++)
{
if(stu[i].fee==max)
{printf("%s\n%d\n%d",stu[i].name,stu[i].fee,sum);
break;}
}
return 0;
}
| 39 |
19,488 | int main()
{
struct student
{
char name[21];
int final;
int cla;
char l;
char w;
int paper;
int total;
};
int k,i,t,max;
t=max=0;
struct student stu[100];
scanf("%d",&k);
for(i=0;i<=k-1;i++)
{
scanf("%s %d%d %c %c %d",stu[i].name,&stu[i].final,&stu[i].cla,&stu[i].l,&stu[i].w,&stu[i].paper);
stu[i].total=0;
if(stu[i].final>80&&stu[i].paper>=1) stu[i].total=stu[i].total+8000;
if(stu[i].final>85&&stu[i].cla>80) stu[i].total=stu[i].total+4000;
if(stu[i].final>90) stu[i].total=stu[i].total+2000;
if(stu[i].final>85&&stu[i].w=='Y') stu[i].total=stu[i].total+1000;
if(stu[i].cla>80&&(stu[i].l=='Y')) stu[i].total=stu[i].total+850;
}
for(i=0;i<=k-1;i++)
{
if(stu[i].total>max)
max=stu[i].total;
t=t+stu[i].total;
}
for(i=0;i<=k-1;i++)
{
if(stu[i].total==max)
{
printf("%s\n",stu[i].name);
printf("%d\n",stu[i].total);
break;
}
}
printf("%d\n",t);
return 0;
} | 39 |
19,489 |
struct student
{
char name[20];
int a;
int b;
char cla;
char west;
int paper;
int total;
}s[100];
int main()
{
int n,i,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",s[i].name);
scanf("%d%d %c %c%d",&s[i].a,&s[i].b,&s[i].cla,&s[i].west,&s[i].paper);
s[i].total=0;
if(s[i].a>80&&s[i].paper>=1)
s[i].total+=8000;
if(s[i].a>85&&s[i].b>80)
s[i].total+=4000;
if(s[i].a>90)
s[i].total+=2000;
if(s[i].a>85&&s[i].west=='Y')
s[i].total+=1000;
if(s[i].b>80&&s[i].cla=='Y')
s[i].total+=850;
sum+=s[i].total;
}
for(i=1;i<n;i++)
{
if(s[i].total>s[0].total)
s[0]=s[i];
}
printf("%s\n",s[0].name);
printf("%d\n",s[0].total);
printf("%d",sum);
return 0;
}
| 39 |
19,490 |
int sch(int e,int test,char mon,char reg,int art)
{
int total=0;
if(e>80&&art>=1) total+=8000;
if(e>85&&test>80) total+=4000;
if(e>90) total+=2000;
if(e>85&®=='Y') total+=1000;
if(test>80&&mon=='Y') total+=850;
return total;
}
int main()
{
int peoplenumber,i,g,c,a,sum=0,most=0;
char name[100],top[100],m,r;
scanf("%d",&peoplenumber);
for(i=0;i<peoplenumber;i++)
{
scanf("%s%d %d %c %c %d",name,&g,&c,&m,&r,&a);
if(sch(g,c,m,r,a)>most)
{
strcpy(top,name);
most=sch(g,c,m,r,a);
}
sum+=sch(g,c,m,r,a);
}
printf("%s\n%d\n%d",top,most,sum);
//scanf("%d %d %c %c %d",&g,&c,&m,&r,&a);
//printf("%d",sch(g,c,m,r,a));
return 0;
}
| 39 |
19,491 | void main()
{
int i,n,max=0;
unsigned long sum=0;
struct student
{
char name[21]; //??
int mark; //??????
int evaluation; //??????
char cadre; //????
char west; //??????
int thesis; //???
int scholarship; //???
};
scanf("%d",&n);
struct student *p = (struct student*)malloc(n * sizeof(struct student));
for(i=0; i<n; i++)
{
struct student *q;
q = p + i;
q->scholarship = 0;
scanf("%s %d %d %c %c %d",&(q->name),&(q->mark),&(q->evaluation),&(q->cadre),&(q->west),&(q->thesis));
if(q->mark>80 && q->thesis>0)
q->scholarship += 8000; //?????
if(q->mark>85 && q->evaluation>80)
q->scholarship += 4000; //?????
if(q->mark>90)
q->scholarship += 2000; //?????
if(q->mark>85 && q->west=='Y')
q->scholarship += 1000; //?????
if(q->evaluation>80 && q->cadre=='Y')
q->scholarship += 850; //?????
sum += q->scholarship;
}
for(i=1; i<n; i++)
{
if((p+i)->scholarship > (p+max)->scholarship)
max = i;
}
printf("%s\n%d\n%d",(p+max)->name,(p+max)->scholarship,sum);
} | 39 |
19,492 | struct student
{
char name[20];
int score1;
int score2;
char leader[2];
char west[2];
int paper;
int money;
struct student *next;
};
struct student *creat(int n)
{
struct student *head;
struct student *p1,*p2;
int i;
p1=p2=(struct student *)malloc(sizeof(struct student));
head=p1;
for(i=0;i<n;i++)
{
p2=p1;
scanf("%s%d%d%s%s%d",p1->name,&p1->score1,&p1->score2,&p1->leader,&p1->west,&p1->paper);
{
p1->money=0;
if(p1->score1>80&&p1->paper!=0)
p1->money=p1->money+8000;
if(p1->score1>85&&p1->score2>80)
p1->money=p1->money+4000;
if(p1->score1>90)
p1->money=p1->money+2000;
if(p1->score1>85&&(strcmp(p1->west,"Y")==0))
p1->money=p1->money+1000;
if(p1->score2>80&&(strcmp(p1->leader,"Y")==0))
p1->money=p1->money+850;
}
p1=(struct student *)malloc(sizeof(struct student));
p2->next=p1;
}
p2->next=NULL;
return(head);
}
void print(struct student *head)
{
struct student *p1;
int max,all=0;
p1=head;
max=p1->money;
do
{
if(p1->money>max)
max=p1->money;
all=all+p1->money;
p1=p1->next;
}
while(p1->next!=NULL);
if(p1->money>max)
max=p1->money;
all=all+p1->money;
p1=head;
for(;p1->next!=NULL;)
{
if(p1->money==max)
{
printf("%s\n%d\n",p1->name,p1->money);
break;
}
p1=p1->next;
}
printf("%d",all);
}
void print1(struct student *head)
{
struct student *p1;
p1=head;
do
{
printf("%s %d %d %s %s %d %d\n",p1->name,p1->score1,p1->score2,p1->leader,p1->west,p1->paper,p1->money);
p1=p1->next;
}
while(p1!=NULL);
}
void main()
{
int n;
struct student *head;
scanf("%d",&n);
head=creat(n);
/*print1(head);*/
print(head);
} | 39 |
19,493 |
struct stu
{
char name[20];
int mark1;
int mark2;
char position;
char hometown;
int paper;
int fund;
struct stu *next;
};
struct stu *creat(int n)
{
int i=1;
struct stu *head;
struct stu *p1,*p2;
p1=(struct stu *)malloc(sizeof(struct stu));
scanf(A,p1->name,&p1->mark1,&p1->mark2,&p1->position,&p1->hometown,&p1->paper);
p1->fund=0;
if(n==1)
{
head=p1;
p1->next=NULL;
free(p1);
return head;
}
else
{
head=p1;
p2=p1;
do
{
p1=(struct stu *)malloc(sizeof(struct stu));
scanf(A,p1->name,&p1->mark1,&p1->mark2,&p1->position,&p1->hometown,&p1->paper);
p1->fund=0;
i++;
if(i==n)
{
p1->next=NULL;
p2->next=p1;
break;
}
else
{
p2->next=p1;
p2=p1;
}
}while(1);
return head;
}
}
int main(void)
{
int n,i,j=0,max=0;
struct stu *head;
struct stu *p;
scanf("%d",&n);
head=creat(n);
p=head;
while(p)
{
if(p->mark1>80&&p->paper>0)
p->fund+=8000;
if(p->mark1>85&&p->mark2>80)
p->fund+=4000;
if(p->mark1>90)
p->fund+=2000;
if(p->mark1>85&&p->hometown=='Y')
p->fund+=1000;
if(p->mark2>80&&p->position=='Y')
p->fund+=850;
p=p->next;
}
p=head;
while(p)
{
/*printf("%d %d\n",p->fund,i);*/
j+=p->fund;
if(p->fund>max)
max=p->fund;
p=p->next;
}
p=head;
while(p)
if(max==p->fund)
{
printf("%s\n%d\n%d\n",p->name,p->fund,j);
break;
}
else p=p->next;
} | 39 |
19,494 | int main()
{
int n,i;
int p[100]={0};
int sum=0;
struct{
char name[20];
int exscore;
int clscore;
char ganbu;
char west;
int lunwen;
}st[100];
int max=p[0],k;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",st[i].name,&st[i].exscore,&st[i].clscore,&st[i].ganbu,&st[i].west,&st[i].lunwen);
if(st[i].exscore>80 && st[i].lunwen>=1) p[i]+=8000;
if(st[i].exscore>85 && st[i].clscore>80) p[i]+=4000;
if(st[i].exscore>90 ) p[i]+=2000;
if(st[i].exscore>85 && st[i].west=='Y') p[i]+=1000;
if(st[i].clscore>80 && st[i].ganbu=='Y') p[i]+=850;
sum+=p[i];
if(p[i]>max)
{
max=p[i];
k=i;
}
}
printf("%s\n",st[k].name);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
| 39 |
19,495 | //???????
struct data{
char a[20];
int b;
int c;
char d[10];
char e[10];
int f;
int g;
struct data *next;
};
int main() {
struct data *head,*p,*pp;
head=(struct data*)malloc(sizeof(struct data));
p=head;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++) {
pp=(struct data*)malloc(sizeof(struct data));
pp->g=0;
scanf("%s %d %d %s %s %d",pp->a,&pp->b,&pp->c,pp->d,pp->e,&pp->f);
if(pp->b>80&&pp->f>0) pp->g=pp->g+8000;
if(pp->b>85&&pp->c>80) pp->g=pp->g+4000;
if(pp->b>90) pp->g=pp->g+2000;
if(pp->b>85&&pp->e[0]=='Y') pp->g=pp->g+1000;
if(pp->c>80&&pp->d[0]=='Y') pp->g=pp->g+850;
p->next=pp;
p=pp;
}
p=head->next;
struct data *x;
int max=0,zz=0;
for(i=0;i<n;i++) {
if(p->g>max) {
max=p->g;
x=p;
}
zz=zz+p->g;
p=p->next;
}
printf("%s\n",x->a);
printf("%d\n",x->g);
printf("%d\n",zz);
} | 39 |
19,496 |
struct stu
{
char n[20];
int f;
int p;
char g;
char x;
int l;
int m;
};
void main()
{
struct stu a[100];
int n,i,j,t,sum;
char c[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",&a[i].n,&a[i].f,&a[i].p,&a[i].g,&a[i].x,&a[i].l);}
for(i=0;i<n;i++)
{ a[i].m=0;}
for(i=0;i<n;i++)
{
if(a[i].f>80&&a[i].l>=1)
a[i].m+=8000;
if(a[i].f>85&&a[i].p>80)
a[i].m+=4000;
if(a[i].f>90)
a[i].m+=2000;
if(a[i].f>85&&a[i].x=='Y')
a[i].m+=1000;
if(a[i].p>80&&a[i].g=='Y')
a[i].m+=850;
}
sum=0;
for(i=0;i<n;i++)
{sum+=a[i].m;}
for(i=0;i<n;i++)
for(j=0;j<n-i;j++)
{
if(a[j].m<a[j+1].m)
{t=a[j].m;a[j].m=a[j+1].m;a[j+1].m=t;
strcpy(c,a[j].n);
strcpy(a[j].n,a[j+1].n);
strcpy(a[j+1].n,c);
}
}
printf("%s\n",a[0].n);
printf("%d\n",a[0].m);
printf("%d",sum);
}
| 39 |
19,497 | int main()
{
int N,i;
int Endmark[100],Classmark[100],Essay[100],award[100]={0},sum=0,BP,X;
char Name[100][21],Zone[100],Leader[100];
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%s %d %d %c %c %d",Name[i],&Endmark[i],&Classmark[i],&Leader[i],&Zone[i],&Essay[i]);
if(Endmark[i]>80&&Essay[i]>0){
award[i]+=8000;
}
if(Endmark[i]>85&&Classmark[i]>80){
award[i]+=4000;
}
if(Endmark[i]>90){
award[i]+=2000;
}
if(Endmark[i]>85&&Zone[i]=='Y'){
award[i]+=1000;
}
if(Classmark[i]>80&&Leader[i]=='Y'){
award[i]+=850;
}
sum+=award[i];
}
BP=award[0];
X=0;
for(i=0;i<N;i++){
if(award[i]>BP){
BP=award[i];
X=i;
}
}
printf("%s\n",Name[X]);
printf("%d\n",award[X]);
printf("%d\n",sum);
return 0;
}
| 39 |
19,498 | struct student
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int paper;
}stu[100];
void main()
{
int n,i,s[100]={0},sum=0,k,max;
struct student *p;
scanf("%d",&n);
for(p=stu,i=0;p<stu+n;p++,i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->qimo,&p->banji,&p->ganbu,&p->xibu,&p->paper);
if(p->qimo>80&&p->paper>=1)
s[i]+=8000;
if(p->qimo>85&&p->banji>80)
s[i]+=4000;
if(p->qimo>90)
s[i]+=2000;
if(p->qimo>85&&p->xibu=='Y')
s[i]+=1000;
if(p->banji>80&&p->ganbu=='Y')
s[i]+=850;
}
max=s[0];
for(i=0;i<n;i++)
{
sum+=s[i];
if(s[i]>max)
{
max=s[i];
k=i;
}
}
printf("%s\n%d\n%d\n",stu[k].name,s[k],sum);
}
| 39 |
19,499 | struct student
{
char name[20];
int aver;
int bj;
char a;
char b;
int lunwen;
int sum;
struct student *next;
};
struct student *creat(int n)
{
int i;
struct student *head,*p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->aver,&p1->bj,&p1->a,&p1->b,&p1->lunwen);
head=p1;
for(i=1;i<n;i++)
{
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->aver,&p1->bj,&p1->a,&p1->b,&p1->lunwen);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
int main()
{
int n;
scanf("%d",&n);
struct student *head,*pt1,*pt2;
head=creat(n);
pt1=head;
while(pt1!=NULL)
{
pt1->sum=0;
if((pt1->aver>80)&&(pt1->lunwen>=1)) pt1->sum=pt1->sum+8000;
if((pt1->aver>85)&&(pt1->bj>80)) pt1->sum=pt1->sum+4000;
if(pt1->aver>90) pt1->sum=pt1->sum+2000;
if((pt1->aver>85)&&(pt1->b=='Y')) pt1->sum=pt1->sum+1000;
if((pt1->bj>80)&&(pt1->a=='Y')) pt1->sum=pt1->sum+850;
pt1=pt1->next;
}
pt1=head;
pt2=pt1->next;
while(pt2!=NULL)
{
if((pt2->sum)>(pt1->sum)) pt1=pt2;
pt2=pt2->next;
}
printf("%s\n",pt1->name);
printf("%d\n",pt1->sum);
pt1=head;
long s=0;
while(pt1!=NULL)
{
s=s+pt1->sum;
pt1=pt1->next;
}
printf("%ld",s);
return 0;
}
| 39 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.