id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
19,100 | struct student
{
char name[21];
int term;
int access;
char ganbu;
char west;
int paper;
int all;
}stu[100];
main()
{
int N;
scanf("%d",&N);
int i;
for(i=0;i<N;i++){
scanf("%s%d%d%s%s%d",&stu[i].name,&stu[i].term,&stu[i].access,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
for(i=0;i<N;i++){
stu[i].all=0;
if(stu[i].term>80&&stu[i].paper>=1){
stu[i].all=stu[i].all+8000;
}
if(stu[i].term>85&&stu[i].access>80){
stu[i].all=stu[i].all+4000;
}
if(stu[i].term>90){
stu[i].all=stu[i].all+2000;
}
if(stu[i].term>85&&stu[i].west=='Y'){
stu[i].all=stu[i].all+1000;
}
if(stu[i].ganbu=='Y'&&stu[i].access>80){
stu[i].all=stu[i].all+850;
}
}
int max=0;
int total=0,k;
for(i=0;i<N;i++){
total+=stu[i].all;
if(max<stu[i].all){
max=stu[i].all;
k=i;
}
}
printf("%s\n%d\n%d\n",stu[k].name,stu[k].all,total);
} | 39 |
19,101 | struct student
{
char name[20];
int aver;
int judge;
char a;
char b;
int punish;
int prize;
struct student *next;
};
int stu_num;
struct student *creat(void)
{
struct student *head,*p1,*p2;
int n;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->aver,&p1->judge,&p1->a,&p1->b,&p1->punish);
head=NULL;
n=0;
while(n<stu_num-1)
{
n++;
if(n==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->aver,&p1->judge,&p1->a,&p1->b,&p1->punish);
}
p2->next=p1;
p1->next=NULL;
return(head);
}
void main()
{
struct student *head,*q1,*q2;
int sum=0;
scanf("%d",&stu_num);
head=creat();
q1=head;
q2=head;
while(q1!=NULL)
{
q1->prize=0;
if(q1->aver>80&&q1->punish>0)
q1->prize+=8000;
if(q1->aver>85&&q1->judge>80)
q1->prize+=4000;
if(q1->aver>90)
q1->prize+=2000;
if(q1->aver>85&&q1->b=='Y')
q1->prize+=1000;
if(q1->judge>80&&q1->a=='Y')
q1->prize+=850;
sum+=q1->prize;
if(q2->prize<q1->prize)
q2=q1;
q1=q1->next;
}
printf("%s\n%d\n%d\n",q2->name,q2->prize,sum);
}
| 39 |
19,102 | int main(int argc, char* argv[])
{
int n,sum=0,i,mon=0,max=0;
char name[20],c1,c2,maxname[20];
int m1,m2,m3;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",name,&m1,&m2,&c1,&c2,&m3);
mon=0;
if(m1>80&&m3>0)
mon+=8000;
if(m1>85&&m2>80)
mon+=4000;
if(m1>90)
mon+=2000;
if('Y'==c2&&m1>85)
mon+=1000;
if('Y'==c1&&m2>80){
mon+=850;}
sum+=mon;
if(mon>max){
max=mon;
strcpy(maxname,name);}}
printf("%s\n%d\n%d\n",maxname,max,sum);
return 0;
} | 39 |
19,103 | struct student
{
char name[20];
int grade1;
int grade2;
char gb;
char xb;
int lunwen;
};
struct student stu[100],t;
void main()
{
int n,i,jj[100]={0},maxjj,sum=0,j,k;
char maxname[20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].grade1,&stu[i].grade2,&stu[i].gb,&stu[i].xb,&stu[i].lunwen);
for(i=0;i<n;i++)
{
if(stu[i].grade1>80&&stu[i].lunwen>=1)
jj[i]=jj[i]+8000;
if(stu[i].grade1>85&&stu[i].grade2>80)
jj[i]=jj[i]+4000;
if(stu[i].grade1>90)
jj[i]=jj[i]+2000;
if(stu[i].grade1>85&&stu[i].xb=='Y')
jj[i]=jj[i]+1000;
if(stu[i].grade2>80&&stu[i].gb=='Y')
jj[i]=jj[i]+850;
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1-j;i++)
{
if(jj[i]<jj[i+1])
{
t=stu[i];
stu[i]=stu[i+1];
stu[i+1]=t;
k=jj[i];
jj[i]=jj[i+1];
jj[i+1]=k;
}
}
}
maxjj=jj[0];
strcpy(maxname,stu[0].name);
for(i=0;i<n;i++)
sum=sum+jj[i];
printf("%s\n",maxname);
printf("%d\n",maxjj);
printf("%d\n",sum);
}
| 39 |
19,104 |
void main()
{
struct student
{
char name[100];
int marka;
int markb;
char ganbu;
char xibu;
int c;
}stu[100];
int n,i,j,max,sum=0;
int money[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].marka,&stu[i].markb,&stu[i].ganbu,&stu[i].xibu,&stu[i].c);
}
for(i=0;i<n;i++)
{
if(stu[i].marka>80&&stu[i].c>0)
{
money[i]=money[i]+8000;
}
if(stu[i].marka>85&&stu[i].markb>80)
{
money[i]=money[i]+4000;
}
if(stu[i].marka>90)
{
money[i]=money[i]+2000;
}
if(stu[i].marka>85&&stu[i].xibu=='Y')
{
money[i]=money[i]+1000;
}
if(stu[i].markb>80&&stu[i].ganbu=='Y')
{
money[i]=money[i]+850;
}
}
max=0;
for(i=1;i<n;i++)
{
if(money[i]>money[max])
max=i;
}
for(i=0;i<n;i++)
sum=sum+money[i];
printf("%s\n",stu[max].name);
printf("%d\n",money[max]);
printf("%d\n",sum);
} | 39 |
19,105 | struct stu
{
char name[20];
int chengji;
int pingyi;
char ganbu[1];
char xibu[1];
int lunwen;
int scholarship;
struct stu *next;
};
struct stu *creat(void)
{
int i,n;
struct stu *head;
struct stu *p1,*p2;
p1=p2=(struct stu*)malloc(LEN);
head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %s %s %d",p1->name,&p1->chengji,&p1->pingyi,p1->ganbu,p1->xibu,&p1->lunwen);
if(i==0)head=p1;
else p2=p1;
if(i!=(n-1))p1=p2->next=(struct stu*)malloc(LEN);
else {p2->next=NULL;}
}
return(head);
}
struct stu *px(struct stu *head)
{
struct stu *p1,*p2,*p3,*p4;
int k,add=0,max=0;
for(p2=head;p2!=NULL;p2=p2->next)
{
p2->scholarship=0;
}
for(p1=head;p1!=NULL;p1=p1->next)
{
if((p1->chengji>80)&&(p1->lunwen>=1))
p1->scholarship=p1->scholarship+8000;
if((p1->chengji>85)&&(p1->pingyi>80))
p1->scholarship=p1->scholarship+4000;
if(p1->chengji>90)
p1->scholarship=p1->scholarship+2000;
if((p1->chengji>85)&&(p1->xibu[0]=='Y'))
p1->scholarship=p1->scholarship+1000;
if((p1->pingyi>80)&&(p1->ganbu[0]=='Y'))
p1->scholarship=p1->scholarship+850;
}
for(p3=head;p3!=NULL;p3=p3->next)
{
k=0;
for(p4=head;p4!=NULL;p4=p4->next)
{
if(p3->scholarship<p4->scholarship)
k++;
}
if(k==0)
{
printf("%s\n%d\n",p3->name,p3->scholarship);
break;
}
}
for(p1=head;p1!=NULL;p1=p1->next)
{
add=add+p1->scholarship;
}
printf("%d\n",add);
return head;
}
void main()
{
struct stu *a,*b;
a=creat();
b=px(a);
} | 39 |
19,106 | struct data
{
char name[21];
int final;
int assess;
char servant;
char west;
int pub;
int bonus;
}student[100], *medium;
void yuanshi(struct data *student)
{
if(student->final>80&&student->pub>0)
student->bonus=student->bonus+8000;
}
void wusi(struct data *student)
{
if(student->final>85&&student->assess>80)
student->bonus=student->bonus+4000;
}
void chengji(struct data *student)
{
if(student->final>90)
student->bonus=student->bonus+2000;
}
void xibu(struct data *student)
{
if(student->final>85&&student->west=='Y')
student->bonus=student->bonus+1000;
}
void banji(struct data *student)
{
if(student->assess>80&&student->servant=='Y')
student->bonus=student->bonus+850;
}
int main()
{
int n;
int i, j, index;
int max=0, sum=0;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%s %d %d %c %c %d", student[i].name, &student[i].final, &student[i].assess, &student[i].servant, &student[i].west, &student[i].pub);
student[i].bonus=0;
}
medium=student;
for(i=0; i<n; i++)
{
banji(medium+i);
xibu(medium+i);
chengji(medium+i);
yuanshi(medium+i);
wusi(medium+i);
}
for(i=0; i<n; i++)
{
if(max<student[i].bonus)
{
max=student[i].bonus;
index=i;
}
sum=sum+student[i].bonus;
}
printf("%s\n%d\n%d", student[index].name, max, sum);
return 0;
}
| 39 |
19,107 | struct Student{
char name[20];
int mark;
int classpoint;
char leader;
char west;
int paper;
int money;
};
void main(){
int i,n,maxnum,tot=0;
struct Student stu[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].mark,&stu[i].classpoint,&stu[i].leader,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++)
{if(stu[i].mark>80&&stu[i].paper>0) stu[i].money=stu[i].money+8000;
if(stu[i].mark>85&&stu[i].classpoint>80) stu[i].money=stu[i].money+4000;
if(stu[i].mark>90) stu[i].money=stu[i].money+2000;
if(stu[i].mark>85&&(stu[i].west=='Y')) stu[i].money=stu[i].money+1000;
if( stu[i].leader=='Y'&&(stu[i].classpoint>80) )stu[i].money=stu[i].money+850;
}
maxnum=0;
for(i=1;i<n;i++)
if(stu[maxnum].money<stu[i].money) maxnum=i;
for(i=0;i<n;i++)
tot=tot+stu[i].money;
printf("%s\n%d\n%d",stu[maxnum].name,stu[maxnum].money,tot);
}
| 39 |
19,108 | void main()
{
int m,n,x,y,a,b,c,d,e,i,total1=0,hu=0;
long int total2=0;
char name[20],j[20],ch1,ch2;
scanf("%d\n",&x);
for(i=1;i<=x;i++)
{
scanf("%s %d %d %c %c %d",name,&m,&n,&ch1,&ch2,&y);
if(m>80&&y>=1)
a=8000;
else a=0;
if(m>85&&n>80)
b=4000;
else b=0;
if(m>90)
c=2000;
else c=0;
if(m>85&&ch2=='Y')
d=1000;
else d= 0;
if(n>80&&ch1=='Y')
e=850;
else e= 0;
total1=a+b+c+d+e;
if(total1>hu)
{
hu=total1;
strcpy(j,name);
}
total2+=total1;
}
printf("%s\n%d\n%ld\n",j,hu,total2);
}
| 39 |
19,109 | int main()
{
int N,i,sum=0;
int x[100]={0};
int total=0;
struct c{
char p[20];
int m1,m2;
char a,b;
int n;
}q[100];
scanf("%d",&N);
for(i=0;i<N;i++)
{
char y[20];
int m11,m22,n11;
char a1,b1;
scanf("%s %d %d %c %c %d",y,&m11,&m22,&a1,&b1,&n11);
strcpy(q[i].p,y);
q[i].m1=m11;
q[i].m2=m22;
q[i].a=a1;
q[i].b=b1;
q[i].n=n11;
}
for(i=0;i<N;i++)
{
if(q[i].m1>80&&q[i].n>0)
{
x[i]=x[i]+8000;
}
if(q[i].m1>85&&q[i].m2>80)
{
x[i]=x[i]+4000;
}
if(q[i].m1>90)
{
x[i]=x[i]+2000;
}
if(q[i].m1>85&&q[i].b=='Y')
{
x[i]=x[i]+1000;
}
if(q[i].m2>80&&q[i].a=='Y')
{
x[i]=x[i]+850;
}
}
for(i=N-1;i>=0;i--)
{
if(x[i]>=sum)
{
sum=x[i];
}
total=total+x[i];
}
for(i=0;i<N;i++)
{
if(sum==x[i])
{
printf("%s\n",q[i].p);
printf("%d\n",sum);
printf("%d\n",total);
break;
}
}
return 0;
}
| 39 |
19,110 | int main()
{
int n,i,total=0;
struct point
{
char s[20];
int end;
int class_marks;
char c1;
char c2;
int com_num;
int sum;
}
stu[100],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].s);
scanf("%d%d",&(stu[i].end),&(stu[i].class_marks));
getchar();
scanf("%c",&(stu[i].c1));
getchar();
scanf("%c",&(stu[i].c2));
getchar();
scanf("%d",&(stu[i].com_num));
}
for(i=0;i<n;i++)
{
stu[i].sum=0;
if(stu[i].end>80&&stu[i].com_num>=1)
stu[i].sum=8000+stu[i].sum;
if(stu[i].end>85&&stu[i].class_marks>80)
stu[i].sum=4000+stu[i].sum;
if(stu[i].end>90)
stu[i].sum=2000+stu[i].sum;
if(stu[i].end>85&&stu[i].c2=='Y')
stu[i].sum=1000+stu[i].sum;
if(stu[i].class_marks>80&&stu[i].c1=='Y')
stu[i].sum=850+stu[i].sum;
}
for(i=0;i<n;i++)
total=stu[i].sum+total;
max.sum=0;
for(i=0;i<n;i++)
{
if(max.sum<stu[i].sum)
max=stu[i];
}
printf("%s\n%d\n%d",max.s,max.sum,total);
return 0;
}
| 39 |
19,111 |
struct student
{
char name[21];
int qimo;
int pingyi;
char ganbu;
char xibu;
int paper;
int money;
};
int main()
{
int n,i,j,e,moneyzong=0;
char name1[21];
scanf("%d",&n);
struct student*a=(struct student*)malloc(sizeof(struct student)*n);
for(i=0;i<n;i++)
{
a[i].money=0;
}
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].qimo,&a[i].pingyi,&a[i].ganbu,&a[i].xibu,&a[i].paper);
if(a[i].qimo>80&&a[i].paper>=1)
a[i].money+=8000;
if(a[i].qimo>85&&a[i].pingyi>80)
a[i].money+=4000;
if(a[i].qimo>90)
a[i].money+=2000;
if(a[i].qimo>85&&a[i].xibu=='Y')
a[i].money+=1000;
if(a[i].pingyi>80&&a[i].ganbu=='Y')
a[i].money+=850;
}
for(i=0;i<n;i++)
{
moneyzong+=a[i].money;
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1;j++)
{
if(a[i].money>=a[i+1].money)
{
e=a[i].money;
a[i].money=a[i+1].money;
a[i+1].money=e;
strcpy(name1,a[i].name);
strcpy(a[i].name,a[i+1].name);
strcpy(a[i+1].name,name1);
}
}
}
printf("%s\n%d\n%d\n",a[n-1].name,a[n-1].money,moneyzong);
return 0;
}
| 39 |
19,112 | struct stu
{char name[20];
int s1;
int s2;
char a1;
char a2;
int pa;
}stu[100];
void main()
{int n,i,sumt,j;
int sum[100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].a1,
&stu[i].a2,&stu[i].pa);
for(i=0;i<n;i++)
{sum[i]=0;
if(stu[i].s1>80&&stu[i].pa>0)
sum[i]=(sum[i]+8000);
if(stu[i].s1>85&&stu[i].s2>80)
sum[i]=(sum[i]+4000);
if(stu[i].s1>90)
sum[i]=(sum[i]+2000);
if(stu[i].s1>85&&stu[i].a2=='Y')
sum[i]=(sum[i]+1000);
if(stu[i].s2>80&&stu[i].a1=='Y')
sum[i]=(sum[i]+850);
}
sumt=sum[0];
for(i=1;i<n;i++)
sumt=sumt+sum[i];
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
if(sum[i]<sum[j])
break;
if(j==n)
break;}
printf("%s\n%d\n%d",stu[i].name,sum[i],sumt);
} | 39 |
19,113 |
int main()
{
int N,i,sum,max,k,total=0;
int t[100];
struct student
{
char name[40];
int grade1;
int grade2;
char monitor;
char western;
int num;
};
struct student stu[100];
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s%d%d%s%s%d",stu[i].name,&stu[i].grade1,&stu[i].grade2,&stu[i].monitor,&stu[i].western,&stu[i].num);
}
for(i=0;i<N;i++)
{
sum=0;
if(stu[i].grade1>80 && stu[i].num>=1)
sum+=8000;
if(stu[i].grade1>85 && stu[i].grade2>80)
sum+=4000;
if(stu[i].grade1>90)
sum+=2000;
if(stu[i].grade1>85 && stu[i].western=='Y')
sum+=1000;
if(stu[i].grade2>80 && stu[i].monitor=='Y')
sum+=850;
t[i]=sum;
}
max=0;
for(i=0;i<N;i++)
{
if(t[i]>max)
{
max=t[i];
k=i;
}
}
for(i=0;i<N;i++)
total+=t[i];
printf("%s\n%d\n%d\n",stu[k].name,max,total);
return 0;
} | 39 |
19,114 |
int main()
{
char x[20],y[20],k,l;
int n,a,b,c,sum,i,j,max=0,max2=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",x,&a,&b,&k,&l,&c);
sum=0;
if ((a>80) && (c!=0))
sum=sum+8000;
if ((a>85) && (b>80))
sum=sum+4000;
if (a>90)
sum=sum+2000;
if ((a>85) && (l=='Y'))
sum=sum+1000;
if ((b>80) && (k=='Y'))
sum=sum+850;
if (sum>max)
{
max=sum;
for(j=0;j<20;j++)
y[j]=x[j];
}
max2=max2+sum;
}
printf("%s\n%d\n%d\n",y,max,max2);
return 0;
} | 39 |
19,115 | int main()
{
int i,n,smax=0;
struct s{
char name[21];
int qimo;
int banji;
char bangan;
char xibu;
int lunwen;
int sum;}s[101];
scanf("%d",&n);
for(i=0;i<n;i++){
s[i].sum=0;
scanf("%s %d %d %c %c %d",s[i].name,&s[i].qimo,&s[i].banji,&s[i].bangan,&s[i].xibu,&s[i].lunwen);
}
for(i=0;i<n;i++){
if((s[i].qimo>80)&&(s[i].lunwen>0))
s[i].sum=s[i].sum+8000;
if((s[i].qimo>85)&&(s[i].banji>80))
s[i].sum=s[i].sum+4000;
if(s[i].qimo>90)
s[i].sum=s[i].sum+2000;
if((s[i].qimo>85)&&(s[i].xibu=='Y'))
s[i].sum=s[i].sum+1000;
if((s[i].banji>80)&&(s[i].bangan=='Y'))
s[i].sum=s[i].sum+850;}
for(i=0;i<n;i++)
{smax+=s[i].sum;
if(s[i].sum>s[0].sum){
s[0].sum=s[i].sum;
s[0]=s[i]; }
}
printf("%s\n",s[0].name);
printf("%d\n",s[0].sum);
printf("%d",smax);
return 0;
}
| 39 |
19,116 | void main()
{
struct stu
{char name[20];
int fen;
int pin;
char gan;
char sheng;
int lun;
int jiang;
}a[100];
int n,i,max,k,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].fen,&a[i].pin,&a[i].gan,&a[i].sheng,&a[i].lun);
a[i].jiang=0;
if(a[i].fen>80&&a[i].lun>0)
a[i].jiang=a[i].jiang+8000;
if(a[i].fen>85&&a[i].pin>80)
a[i].jiang=a[i].jiang+4000;
if(a[i].fen>90)
a[i].jiang=a[i].jiang+2000;
if(a[i].fen>85&&a[i].sheng=='Y')
a[i].jiang=a[i].jiang+1000;
if(a[i].pin>80&&a[i].gan=='Y')
a[i].jiang=a[i].jiang+850;
sum=sum+a[i].jiang;
}
for(i=1,k=0,max=a[0].jiang;i<n;i++)
if(a[i].jiang>max)
{
max=a[i].jiang;
k=i;
}
printf("%s\n%d\n%d",a[k].name,a[k].jiang,sum);
} | 39 |
19,117 | int main()
{
struct Student{
char name[50];
int cj,py,lw,sum;
char gb,xb;
}stu[100],temp;
int n,i,sum=0,j,k;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s%d%d %c %c%d",&stu[i].name,&stu[i].cj,&stu[i].py,&stu[i].gb,&stu[i].xb,&stu[i].lw);
}
for (i=0;i<n;i++){
stu[i].sum=0;
if (stu[i].cj>80&&stu[i].lw>=1) stu[i].sum+=8000;
if (stu[i].py>80&&stu[i].gb=='Y') stu[i].sum+=850;
if (stu[i].cj>85&&stu[i].py>80) stu[i].sum+=4000;
if (stu[i].cj>85&&stu[i].xb=='Y') stu[i].sum+=1000;
if (stu[i].cj>90) stu[i].sum+=2000;
}
for (i=0;i<n;i++){
sum+=stu[i].sum;
}
for (i=0;i<n;i++){
for (j=i+1;j<n;j++){
if (stu[j].sum>stu[i].sum){
temp=stu[j];
for (k=j;k>i;k--){
stu[k]=stu[k-1];
}
stu[i]=temp;
}
}
}
printf("%s\n%d\n%d",stu[0].name,stu[0].sum,sum);
return 0;
}
| 39 |
19,118 | void main()
{
struct student
{
char name[20];
int final;
int classes;
char duty;
char west;
int text;
};
struct student stu[100];
int n,i,t;
scanf("%d",&n);
int num[100]={0},all=0,a[100];
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].classes,&stu[i].duty,&stu[i].west,&stu[i].text);
for(i=0;i<n;i++)
{
if(stu[i].text>0&&stu[i].final>80)
num[i]=num[i]+8000;
if(stu[i].classes>80&&stu[i].final>85)
num[i]=num[i]+4000;
if(stu[i].final>90)
num[i]=num[i]+2000;
if(stu[i].west=='Y'&&stu[i].final>85)
num[i]=num[i]+1000;
if(stu[i].classes>80&&stu[i].duty=='Y')
num[i]=num[i]+850;
}
for(i=0;i<n;i++)
{
a[i]=num[i];
all=all+num[i];
}
for(i=0;i<n-1;i++)
{
if(a[i]>a[i+1])
a[i+1]=a[i];
}
for(i=0;i<n;i++)
{
if(num[i]==a[n-1])
{t=i;
break;}
}
printf("%s\n%d\n%d\n",stu[t].name,num[t],all);
} | 39 |
19,119 | int main()
{
int n,i,max=0,sum=0,t;
scanf("%d",&n);
struct student
{
char name[20];
int ascore;
int bscore;
char good;
char west;
int work;
int money;
}stu[100];
for(i=0;i<n;i++)
stu[i].money=0;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].ascore,&stu[i].bscore,&stu[i].good,&stu[i].west,&stu[i].work);
}
i=0;
for(i=0;i<n;i++)
{
if(stu[i].ascore>80&&stu[i].work>=1)
stu[i].money=stu[i].money+8000;
if(stu[i].ascore>85&&stu[i].bscore>80)
stu[i].money=stu[i].money+4000;
if(stu[i].ascore>90)
stu[i].money=stu[i].money+2000;
if(stu[i].ascore>85&&stu[i].west=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].bscore>80&&stu[i].good=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0;i<n;i++)
sum=sum+stu[i].money;
i=0;
for(i=0;i<n-1;i++)
{
if(stu[i].money>max)
{
max=stu[i].money;
t=i;
}
}
printf("%s\n%d\n%d\n",stu[t].name,stu[t].money,sum);
}
| 39 |
19,120 | void main()
{
int i,j=0,max,N,mark1[150],mark2[150],p[150],s[150]={0},sum=0;
char name[150][20]={'0'},a[150]={'0'},b[150]={'0'};
scanf("%d",&N);
for (i=0;i<N;i++)
{ scanf("%s %d %d %s %s %d",name[i],&mark1[i],&mark2[i],&a[i],&b[i],&p[i]);}
for (i=0;i<N;i++)
{
if (mark1[i]>80 && p[i]>=1)
{ s[i]=s[i]+8000;}
if (mark1[i]>85 && mark2[i]>80)
{ s[i]=s[i]+4000;}
if (mark1[i]>90)
{ s[i]=s[i]+2000;}
if (mark1[i]>85 && (int)(b[i])==89)
{ s[i]=s[i]+1000;}
if (mark2[i]>80 && (int)(a[i])==89)
{ s[i]=s[i]+850;}
}
for (i=0;i<N;i++)
{ sum=sum+s[i];}
max=s[0];
for (i=0;i<N;i++)
{
if (s[i]>max)
{ max=s[i];
j=i;}
}
printf("%s\n%d\n",name[j],s[j]);
printf("%d\n",sum);
} | 39 |
19,121 | struct student
{char name[20];
int qimo;
int banji;
char xs;
char xb;
int lw;
};
int f(struct student *p)
{
int num=0;
if(((p->qimo)>80)&&((p->lw)>=1))
num=num+8000;
if(((p->qimo)>85)&&((p->banji)>80))
num=num+4000;
if((p->qimo)>90)
num=num+2000;
if(((p->qimo)>85)&&((p->xb)=='Y'))
num=num+1000;
if(((p->banji)>80)&&((p->xs)=='Y'))
num=num+850;
return num;
}
void main()
{
int f(struct student *p);
struct student stu[100],*p;
int n,i,a[100]={0},*ap,b=0,k,m;
p=stu;ap=a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->qimo,&p->banji,&p->xs,&p->xb,&p->lw);
p=p+1;
}
p=stu;
for(i=0;i<n;i++)
{
*(ap+i)=f(p+i);
b=b+(*(ap+i));
}
k=a[0];
for(i=0;i<n;i++)
{
if(a[i]>k)
{ k=a[i];m=i;}
}
printf("%s\n%d\n%d\n",(stu+m)->name,k,b);
} | 39 |
19,122 | struct students
{
char name[21];
int S1;
int S2;
char T1;
char T2;
int P;
int JJ;
};
main()
{
int n,i,max;
struct students stu[NUM];
long int all;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("\n%s %d %d %c %c %d",stu[i].name,&stu[i].S1,&stu[i].S2,&stu[i].T1,&stu[i].T2,&stu[i].P);
}
all=0;
for(i=0;i<n;i++)
{
stu[i].JJ=0;
if ((stu[i].S1>80)&&(stu[i].P>=1))
{
stu[i].JJ+=8000;
}
if((stu[i].S1>85)&&(stu[i].S2>80))
{
stu[i].JJ+=4000;
}
if (stu[i].S1>90)
{
stu[i].JJ+=2000;
}
if((stu[i].S1>85)&&(stu[i].T2=='Y'))
{
stu[i].JJ+=1000;
}
if((stu[i].S2>80)&&(stu[i].T1=='Y'))
{
stu[i].JJ+=850;
}
all =all +stu[i].JJ;
}
max=0;
for (i=1;i<n;i++)
{
if (stu[i].JJ>stu[max].JJ)
{
max=i;
}
}
printf("%s\n%d\n%ld\n",stu[max].name,stu[max].JJ,all);
}
| 39 |
19,123 | void main()
{
struct student
{char name[20];
int qimo;
int banyi;
char ganbu;
char xibu;
int paper;
}stu[100];
int n,i,max,p,sum=0;
int sch[]={8000,4000,2000,1000,850};
int a[100]={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].banyi,&stu[i].ganbu,&stu[i].xibu,&stu[i].paper);
for(i=0;i<n;i++)
{
if(stu[i].qimo>80&&stu[i].paper>=1)
a[i]+=sch[0];
if(stu[i].qimo>85&&stu[i].banyi>80)
a[i]+=sch[1];
if(stu[i].qimo>90)
a[i]+=sch[2];
if(stu[i].qimo>85&&stu[i].xibu=='Y')
a[i]+=sch[3];
if(stu[i].banyi>80&&stu[i].ganbu=='Y')
a[i]+=sch[4];
}
max=a[0];
p=0;
for(i=0;i<n;i++)
{
if(a[i]>max)
{
max=a[i];
p=i;
}
sum+=a[i];
}
printf("%s\n%d\n%d",stu[p].name,max,sum);
}
| 39 |
19,124 | struct student
{
char name[20];
int qipin;
int banpin;
char ganbu;
char xixue;
int lunwen;
int jj;
};
void main()
{
int max(struct student s[100],int n);
struct student stu[100];
int i,m=0,sum=0,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].name);
scanf("%d %d %c %c %d",&stu[i].qipin,&stu[i].banpin,&stu[i].ganbu,&stu[i].xixue,&stu[i].lunwen);
stu[i].jj=0;
if(stu[i].qipin>80&&stu[i].lunwen>0)
stu[i].jj=stu[i].jj+8000;
if(stu[i].qipin>85&&stu[i].banpin>80)
stu[i].jj=stu[i].jj+4000;
if(stu[i].qipin>90)
stu[i].jj=stu[i].jj+2000;
if(stu[i].qipin>85&&stu[i].xixue=='Y')
stu[i].jj=stu[i].jj+1000;
if(stu[i].banpin>80&&stu[i].ganbu=='Y')
stu[i].jj=stu[i].jj+850;
}
for(i=0;i<n;i++)
sum=sum+stu[i].jj;
m=max(stu,n);
puts(stu[0].name);
printf("%d\n%d\n",m,sum);
}
int max(struct student s[100],int n)
{
int i,j;
struct student t;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(s[i].jj<s[j].jj)
{
t=s[j];
s[j]=s[i];
s[i]=t;
}
return (s[0].jj);
}
| 39 |
19,125 | int main()
{
struct stu
{
char name[20];
int a;
int b;
char c[2];
char d[2];
int e;
int m;
};
struct stu *p;
int n,i,max=0,t,sum=0;
scanf("%d",&n);
p=(struct stu *)malloc(n*sizeof(struct stu));
for(i=0;i<n;i++)
scanf("%s%d%d%s%s%d",(p+i)->name,&(p+i)->a,&(p+i)->b,(p+i)->c,(p+i)->d,&(p+i)->e);
for(i=0;i<n;i++)
(p+i)->m=0;
for(i=0;i<n;i++)
{
if((((p+i)->a)>80)&&(((p+i)->e)>0))
(p+i)->m+=8000;
if((((p+i)->a)>85)&&(((p+i)->b)>80))
(p+i)->m+=4000;
if(((p+i)->a)>90)
(p+i)->m+=2000;
if((((p+i)->a)>85)&&(((p+i)->d[0])=='A'+24))
(p+i)->m+=1000;
if((((p+i)->b)>80)&&(((p+i)->c[0])=='A'+24))
(p+i)->m+=850;
}
for(i=0;i<n;i++)
if(((p+i)->m)>max)
{
max=(p+i)->m;
t=i;
}
for(i=0;i<n;i++)
sum+=(p+i)->m;
printf("%s\n",(p+t)->name);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
| 39 |
19,126 |
int main(){
int n , i , p = 0 , sum = 0 , q;
struct student{
char name[200];
int c1 , c2 , wx , wa;
char bg , xb ;
}stu[101];
scanf("%d" , &n);
for( i = 0 ; i <= n - 1; i++){
stu[i].wa = 0 ;
scanf("%s %d %d %c %c %d", stu[i].name , &stu[i].c1 , &stu[i].c2 , &stu[i].bg , &stu[i].xb , &stu[i].wx);
// printf("%s %d %d %c %c %d\n", stu[i].name , stu[i].c1 , stu[i].c2 , stu[i].bg , stu[i].xb , stu[i].wx);
if( stu[i].c1 > 80 && stu[i].wx != 0 ) stu[i].wa = stu[i].wa + 8000 ;
if( stu[i].c1 > 85 && stu[i].c2 > 80 ) stu[i].wa = stu[i].wa + 4000 ;
if( stu[i].c1 > 90 ) stu[i].wa = stu[i].wa + 2000;
if( stu[i].c1 > 85 && stu[i].xb == 'Y' ) stu[i].wa = stu[i].wa + 1000;
if( stu[i].c2 > 80 && stu[i].bg == 'Y' ) stu[i].wa = stu[i].wa + 850 ;
if( stu[i].wa > p ) {p = stu[i].wa ;q = i ;}
sum = sum + stu[i].wa ;
// printf("wa%d\n %d\n" , stu[i].wa , q);
}
printf("%s\n%d\n%d\n" , stu[q].name , stu[q].wa , sum);
return(0);
} | 39 |
19,127 | struct student{
char name[20];
int qimo;
int ping;
char gan;
char xi;
int lun;
}stu[101];
int main(int argc, char* argv[])
{ int n,i;
int jiang[101];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].ping,&stu[i].gan,&stu[i].xi,&stu[i].lun);
jiang[i]=0;
}
int max=0,zong=0;
for(i=0;i<n;i++){
if(stu[i].qimo>80&&stu[i].lun>0)jiang[i]+=8000;
if(stu[i].qimo>85&&stu[i].ping>80)jiang[i]+=4000;
if(stu[i].qimo>90)jiang[i]+=2000;
if(stu[i].qimo>85&&stu[i].xi=='Y')jiang[i]+=1000;
if(stu[i].ping>80&&stu[i].gan=='Y')jiang[i]+=850;
if(max<jiang[i])max=jiang[i];
zong+=jiang[i];
}
for(i=0;i<n;i++){
if(max==jiang[i]){
printf("%s\n%d\n",stu[i].name,jiang[i]);break;
}
}
printf("%d\n",zong);
return 0;
}
| 39 |
19,128 |
struct student
{
char name[20];
int final;
int cla;
char job;
char west;
int essay;
int bonus;
};
int sco1(struct student a);
int sco2(struct student a);
int sco3(struct student a);
int sco4(struct student a);
int sco5(struct student a);
void bubble(struct student *p,int n);
void main()
{
int n,i,total=0;
struct student stu[101]={0,0,0,0,0,0,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].job,&stu[i].west,&stu[i].essay);
stu[i].bonus=sco1(stu[i])+sco2(stu[i])+sco3(stu[i])+sco4(stu[i])+sco5(stu[i]);
total=total+stu[i].bonus;
}
bubble(stu,n);
printf("%s\n%d\n%d",stu[0].name,stu[0].bonus,total);
}
int sco1(struct student a)
{
if(a.final>80&&a.essay>0)
return 8000;
else
return 0;
}
int sco2(struct student a)
{
if(a.final>85&&a.cla>80)
return 4000;
else
return 0;
}
int sco3(struct student a)
{
if(a.final>90)
return 2000;
else
return 0;
}
int sco4(struct student a)
{
if(a.final>85&&a.west=='Y')
return 1000;
else
return 0;
}
int sco5(struct student a)
{
if(a.cla>80&&a.job=='Y')
return 850;
else
return 0;
}
void bubble(struct student * p,int n)
{
int i,j;
struct student t;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
{
if(p[j].bonus<p[j+1].bonus)
{t=p[j];p[j]=p[j+1];p[j+1]=t;}
}
}
} | 39 |
19,129 | struct student
{
char name[20];
int final;
int pingyi;
char leader;
char wester;
int essay;
}stu[200];
void main()
{
int n,i,sum=0,prize,max=0,k=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].pingyi,&stu[i].leader,&stu[i].wester,&stu[i].essay);
for(i=0;i<n;i++)
{
prize=0;
if(stu[i].final>80&&stu[i].essay>=1)
{prize+=8000;sum+=8000;}
if(stu[i].final>85&&stu[i].pingyi>80)
{prize+=4000;sum+=4000;}
if(stu[i].final>90)
{prize+=2000;sum+=2000;}
if(stu[i].final>85 && stu[i].wester=='Y')
{prize+=1000;sum+=1000;}
if(stu[i].pingyi>80&&stu[i].leader=='Y')
{prize+=850;sum+=850;}
if(prize>max)
{max=prize;k=i;}
}
printf("%s\n",stu[k].name);
printf("%d\n%d\n",max,sum);
} | 39 |
19,130 | int main()
{
int n;
scanf("%d",&n);
scanf("\n");
struct student
{
char *name;
int final;
int clas;
char gan;
char west;
int essay;
}a[100];
int i;
for(i=0;i<n;i++)
{
a[i].name=(char *)malloc(20*sizeof(char));
scanf("%s%d%d %c %c%d",a[i].name,&a[i].final,&a[i].clas,&a[i].gan,&a[i].west,&a[i].essay);
if(i<n-1)
scanf("\n");
}
int scholar[100];
for(i=0;i<n;i++)
scholar[i]=0;
for(i=0;i<n;i++)
{
while(a[i].final>80&&a[i].essay>=1)
{
scholar[i]=scholar[i]+8000;
break;
}
while(a[i].final>85&&a[i].clas>80)
{
scholar[i]=scholar[i]+4000;
break;
}
while(a[i].final>90)
{
scholar[i]=scholar[i]+2000;
break;
}
while(a[i].final>85&&a[i].west=='Y')
{
scholar[i]=scholar[i]+1000;
break;
}
while(a[i].clas>80&&a[i].gan=='Y')
{
scholar[i]=scholar[i]+850;
break;
}
}
int k;
for(i=1,k=0;i<n;i++)
{
if(scholar[i]>scholar[k])
k=i;
}
int s;
for(i=0,s=0;i<n;i++)
{
s=s+scholar[i];
}
printf("%s\n%d\n%d",a[k].name,scholar[k],s);
}
| 39 |
19,131 | 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 c)
{
if(a>85&&c=='Y') return 1000;
else return 0;
}
int banji(int b,char d)
{
if(b>80&&d=='Y') return 850;
else return 0;
}
int main()
{
int a[120],b[102],c[120],i,n,qian[102],zong=0,max=0,wei;
char mingzi[102][30],xue[102],xi[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",mingzi[i],&a[i],&b[i],&xue[i],&xi[i],&c[i]);
qian[i]=(yuanshi(a[i],c[i])+wusi(a[i],b[i])+chengji(a[i])+xibu(a[i],xi[i])+banji(b[i],xue[i]));
zong+=qian[i];
if(qian[i]>max) {
max=qian[i];
wei=i;
}
}
printf("%s\n%d\n%d\n",mingzi[wei],qian[wei],zong);
return 0;
} | 39 |
19,132 |
int main()
{
int N,i,price,total=0,max=0,t;
scanf("%d",&N);
struct student
{
char name[21];
int ave;
int comment;
char officer;
char province;
int paper;
}stu[100];
for(i=0;i<N;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].ave,&stu[i].comment,&stu[i].officer,&stu[i].province,&stu[i].paper);
}
for(i=0;i<N;i++){
price=0;
if(stu[i].ave>80&&stu[i].paper>0){price=price+8000;}
if(stu[i].ave>85&&stu[i].comment>80){price=price+4000;}
if(stu[i].ave>90){price=price+2000;}
if(stu[i].ave>85&&stu[i].province=='Y'){price=price+1000;}
if(stu[i].comment>80&&stu[i].officer=='Y'){price=price+850;}
total=total+price;
if(price>max){
max=price;
t=i;
}
}
printf("%s\n%d\n%d\n",stu[t].name,max,total);
return 0;
}
| 39 |
19,133 |
int main(int argc, char* argv[])
{
struct stu
{ char name[20];
int fen;
int ban;
char gan[1];
char xi[1];
int wen;
}s[100];
int n,i,j,money=0,mon=0,mona=0;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s",s[i].name);
scanf("%d",&s[i].fen);
scanf("%d",&s[i].ban);
scanf("%s",s[i].gan);
scanf("%s",s[i].xi);
scanf("%d",&s[i].wen);
if (s[i].fen>80&&s[i].wen>=1)
money=money+8000;
if (s[i].fen>85&&s[i].ban>80)
money=money+4000;
if (s[i].fen>90)
money=money+2000;
if (s[i].fen>85&&s[i].xi[0]=='Y')
money=money+1000;
if (s[i].ban>80&&s[i].gan[0]=='Y')
money=money+850;
if (money>mon){
mon=money;
j=i;
}
mona=mona+money;
money=0;
}
printf("%s\n",s[j].name);
printf("%d\n",mon);
printf("%d\n",mona);
return 0;
}
| 39 |
19,134 | int main()
{
int n, i;
scanf("%d", &n);
int sum[100]={0}, total=0;
char name[100][20];
for(i=0;i<n;i++)
{
int a, b;
char p[2], q[2];
int l;
scanf("%s%d%d%s%s%d", &name[i], &a, &b, &p, &q, &l);
if(a>80&&l!=0)
{
sum[i]+=8000;
}
if(a>85&&b>80)
{
sum[i]+=4000;
}
if(a>90)
{
sum[i]+=2000;
}
if(a>85&&strcmp(q,"Y")==0)
{
sum[i]+=1000;
}
if(b>80&&strcmp(p,"Y")==0)
{
sum[i]+=850;
}
total+=sum[i];
}
int max=0, k;
for(i=0;i<n;i++)
{
if(sum[i]>max)
{
max=sum[i];
k=i;
}
}
printf("%s\n%d\n%d\n", name[k], sum[k], total);
return 0;
} | 39 |
19,135 | struct info
{
char name[20];
int final;
int ass;
char gan;
char west;
int paper;
struct info *next;
};
struct info *create(int n)
{
struct info *p1,*p2,*head;
int i;
p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %d %d %c %c %d",p1->name,&p1->final,&p1->ass,&p1->gan,&p1->west,&p1->paper);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<n;i++)
{
p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %d %d %c %c %d",p1->name,&p1->final,&p1->ass,&p1->gan,&p1->west,&p1->paper);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return head;
}
int main()
{
int n;
struct info *head;
struct info *p1;
int i,m,sum,max;
char namemax[22];
scanf("%d",&n);
head=create(n);
p1=head;
sum=0;
max=0;
for(i=0;i<n;i++)
{
m=0;
if(p1->final>80&&p1->paper>=1)
{m+=8000;}
if(p1->final>85&&p1->ass>80)
{m+=4000;}
if(p1->final>90)
{m+=2000;}
if(p1->final>85&&p1->west=='Y')
{m+=1000;}
if(p1->ass>80&&p1->gan=='Y')
{m+=850;}
if(m>max)
{max=m;strcpy(namemax,p1->name);}
p1=p1->next;
}
p1=head;
for(m=0,i=0;i<n;i++)
{
if(p1->final>80&&p1->paper>=1)
{m+=8000;}
if(p1->final>85&&p1->ass>80)
{m+=4000;}
if(p1->final>90)
{m+=2000;}
if(p1->final>85&&p1->west=='Y')
{m+=1000;}
if(p1->ass>80&&p1->gan=='Y')
{m+=850;}
p1=p1->next;
}
sum=m;
printf("%s\n%d\n%d\n",namemax,max,sum);
}
| 39 |
19,136 | void main()
{
int n,i,a[100],e[100],f[100],g[100]={0},m=0,k;
char b[100][20],c[100][1],d[100][1],x[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",b[i],&a[i],&e[i],c[i],d[i],&f[i]);
if(a[i]>80&&f[i]>0)
g[i]=g[i]+8000;
if(a[i]>85&&e[i]>80)
g[i]=g[i]+4000;
if(a[i]>90)
g[i]=g[i]+2000;
if(a[i]>85&&strcmp(d[i],"Y")==0)
g[i]=g[i]+1000;
if(e[i]>80&&strcmp(c[i],"Y")==0)
g[i]=g[i]+850;
}
for(i=n-2;i>=0;i--)
if(g[i]<g[i+1])
{
k=g[i];
g[i]=g[i+1];
g[i+1]=k;
strcpy(x,b[i]);
strcpy(b[i],b[i+1]);
strcpy(b[i+1],x);
}
for(i=0;i<n;i++)
m=m+g[i];
printf("%s\n%d\n%d\n",b[0],g[0],m);
} | 39 |
19,137 | struct student
{
char name[200];
int score1;
int score2;
char c1;
char c2;
int paper;
int money;
}a[100];
int main()
{
int N,i,maxmoney=0,maxnum=0,summoney=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",&a[i].name,&a[i].score1,&a[i].score2,&a[i].c1,&a[i].c2,&a[i].paper);
if(a[i].score1>80&&a[i].paper>0)
{
a[i].money+=8000;
}
if(a[i].score1>85&&a[i].score2>80)
{
a[i].money+=4000;
}
if(a[i].score1>90)
{
a[i].money+=2000;
}
if(a[i].score1>85&&a[i].c2=='Y')
{
a[i].money+=1000;
}
if(a[i].score2>80&&a[i].c1=='Y')
{
a[i].money+=850;
}
}
for(i=0;i<N;i++)
{
if(a[i].money>maxmoney)
{
maxmoney=a[i].money;
maxnum=i;
}
summoney+=a[i].money;
}
printf("%s\n%d\n%d",a[maxnum].name,maxmoney,summoney);
}
| 39 |
19,138 |
int main()
{
struct student
{
char name[20];
int final;
int com;
char offi;
char west;
int arc;
};
struct student stu[200];
struct student chan;
int i,n;
int total[200]={0},all=0;
int a,b,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].com,&stu[i].offi,&stu[i].west,&stu[i].arc);
}
for(i=0;i<n;i++)
{
if((stu[i].final>80)&&(stu[i].arc>0))
total[i]=total[i]+8000;
if((stu[i].final>85)&&(stu[i].com>80))
total[i]=total[i]+4000;
if(stu[i].final>90)
total[i]=total[i]+2000;
if((stu[i].final>85)&&(stu[i].west==89))
total[i]=total[i]+1000;
if((stu[i].com>80)&&(stu[i].offi==89))
total[i]=total[i]+850;
}
for(a=0;a<n-1;a++)
{
for(b=0;b<n-1-a;b++)
{
if(total[b]<total[b+1])
{
temp=total[b];
total[b]=total[b+1];
total[b+1]=temp;
chan=stu[b];
stu[b]=stu[b+1];
stu[b+1]=chan;
}
}
}
for(i=0;i<n;i++)
all=all+total[i];
printf("%s\n%d\n%d\n",stu[0].name,total[0],all);
return 0;
}
| 39 |
19,139 | struct inform
{
char name[20];
int test1;
int test2;
char c;
char w;
int a;
}stu[100],temp1;
void main()
{
int n,i,j,temp2;
int sum[100]={0},sum1=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].test1,&stu[i].test2,&stu[i].c,&stu[i].w,&stu[i].a);
}
for(i=0;i<=n-1;i++)
{
if(stu[i].test1>80 && stu[i].a>=1) sum[i]=8000;
if(stu[i].test1>85 && stu[i].test2>80) sum[i]=sum[i]+4000;
if(stu[i].test1>90) sum[i]=sum[i]+2000;
if(stu[i].test1>85 && stu[i].w=='Y') sum[i]=sum[i]+1000;
if(stu[i].test2>80 && stu[i].c=='Y')sum[i]=sum[i]+850;
}
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-2-i;j++)
{
if(sum[j]<sum[j+1])
{
temp2=sum[j];
sum[j]=sum[j+1];
sum[j+1]=temp2;
temp1=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp1;
}
}
}
for(i=0;i<=n-1;i++)
{
sum1=sum1+sum[i];
}
printf("%s\n",stu[0].name);
printf("%d\n",sum[0]);
printf("%d\n",sum1);
}
| 39 |
19,140 | struct Student
{
char name[20];
int a;
int b;
char g;
char x;
int l;
int sum;
}stu[100];
int n;
int main()
{
scanf("%d",&n);
int i;
int all=0;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].a,&stu[i].b,&stu[i].g,&stu[i].x,&stu[i].l);
stu[i].sum=0;
if(stu[i].a>80&&stu[i].l>=1)
stu[i].sum+=8000;
if(stu[i].a>85&&stu[i].b>80)
stu[i].sum+=4000;
if(stu[i].a>90)
stu[i].sum+=2000;
if(stu[i].a>85&&stu[i].x=='Y')
stu[i].sum+=1000;
if(stu[i].b>80&&stu[i].g=='Y')
stu[i].sum+=850;
all+=stu[i].sum;
}
int max=0;
for(i=0;i<n;i++)
{
if(max<stu[i].sum)
max=stu[i].sum;
}
for(i=0;i<n;i++)
{
if(stu[i].sum==max)
{
printf("%s\n",stu[i].name);
printf("%d\n",stu[i].sum);
break;
}
}
printf("%d\n",all);
return 0;
}
| 39 |
19,141 | struct student
{
char name[20];
int pingjun;
int pingyi;
char bgb[3];
char xb[3];
int lunwen;
int qian;
};
int main()
{
struct student stu[100]={{"\0"}};
struct student total={"\0"};
struct student temp={"\0"};
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d",stu[i].name,&stu[i].pingjun,&stu[i].pingyi);
scanf("%s%s%d",&stu[i].bgb,&stu[i].xb,&stu[i].lunwen);
if(stu[i].pingjun>80&&stu[i].lunwen>=1)
stu[i].qian=stu[i].qian+8000;
if(stu[i].pingjun>85&&stu[i].pingyi>80)
stu[i].qian=stu[i].qian+4000;
if(stu[i].pingjun>90)
stu[i].qian=stu[i].qian+2000;
if(stu[i].pingjun>85&&stu[i].xb[0]=='Y')
stu[i].qian=stu[i].qian+1000;
if(stu[i].pingyi>80&&stu[i].bgb[0]=='Y')
stu[i].qian=stu[i].qian+850;
total.qian=total.qian+stu[i].qian;
}
for(i=0;i<n;i++)
{
if(stu[i].qian>temp.qian)
temp=stu[i];
}
printf("%s\n%d\n%d\n",temp.name,temp.qian,total.qian);
return 0;
}
| 39 |
19,142 |
void main()
{
struct student{
char name[20];
int qimochengji;
int banjipingyi;
char ganbu;
char xibu;
int lunwenshu;
int jiangxuejin;
} stu[100];
int n,i,sum,max;
scanf("%d\n",&n);
for(i=0,sum=0,max=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimochengji,&stu[i].banjipingyi,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwenshu);
stu[i].jiangxuejin=0;
if(stu[i].qimochengji>80&&stu[i].lunwenshu>=1) stu[i].jiangxuejin=stu[i].jiangxuejin+8000;
if(stu[i].qimochengji>85&&stu[i].banjipingyi>80) stu[i].jiangxuejin=stu[i].jiangxuejin+4000;
if(stu[i].qimochengji>90) stu[i].jiangxuejin=stu[i].jiangxuejin+2000;
if(stu[i].qimochengji>85&&stu[i].xibu=='Y') stu[i].jiangxuejin=stu[i].jiangxuejin+1000;
if(stu[i].banjipingyi>80&&stu[i].ganbu=='Y') stu[i].jiangxuejin=stu[i].jiangxuejin+850;
sum+=stu[i].jiangxuejin;
if(stu[max].jiangxuejin<stu[i].jiangxuejin) max=i;
}
printf("%s\n",stu[max].name);
printf("%d\n",stu[max].jiangxuejin);
printf("%d\n",sum);
} | 39 |
19,143 |
struct student
{
char name[20];
int grade;
int mark_class;
char monitor;
char west;
int paper;
int money;
};
int c_to_d(char c[]);
void main ()
{
int n,len;
struct student stu[100];
int i,j,k,l,m;
int total=0;
scanf("%d",&n);
getchar();
for(i=0;i<n;i++)
{
char help[35];
gets(help);
len=strlen(help);
for(j=0;;j++)
{
if(help[j]==' ') {stu[i].name[j]='\0';break;}
stu[i].name[j]=help[j];
}
j++;
for(k=0;;k++)
{
char help2[3];
if(help[j+k]==' ') {help2[k]='\0';stu[i].grade=c_to_d(help2);break;}
help2[k]=help[j+k];
}
k++;
for(l=0;;l++)
{
char help2[3];
if(help[j+k+l]==' ') {help2[l]='\0';stu[i].mark_class=c_to_d(help2);break;}
help2[l]=help[j+k+l];
}
l++;
stu[i].monitor=help[j+k+l];
stu[i].west=help[j+k+l+2];
for(m=0;;m++)
{
char help2[3];
if(len==(j+k+l+4+m)) {help2[m]='\0';stu[i].paper=c_to_d(help2);break;}
help2[m]=help[j+k+l+4+m];
}
}
for(i=0;i<n;i++)
{
stu[i].money=0;
if (stu[i].grade>80&&stu[i].paper>0) stu[i].money+=8000;
if (stu[i].grade>85&&stu[i].mark_class>80) stu[i].money+=4000;
if (stu[i].grade>90) stu[i].money+=2000;
if (stu[i].grade>85&&stu[i].west=='Y') stu[i].money+=1000;
if (stu[i].mark_class>80&&stu[i].monitor=='Y') stu[i].money+=850;
}
for(i=0;i<n;i++)
{
for(j=0;j<n-1;j++)
{
if(stu[j].money<stu[j+1].money)
{
struct student y;
y=stu[j];
stu[j]=stu[j+1];
stu[j+1]=y;
}
}
}
printf("%s\n%d\n",stu[0].name,stu[0].money);
for(i=0;i<n;i++)
{
total+=stu[i].money;
}
printf("%d",total);
}
int c_to_d(char c[])
{
int n=strlen(c);
int i;
int x=0;
for(i=0;i<n;i++)
{
x=x*10+c[i]-48;
}
return x;
} | 39 |
19,144 | int main()
{
int n,i,j,a1=8000,a2=4000,a3=2000,a4=1000,a5=850;
int max=0,top=0,sum=0;
int grade[100],assess[100],article[100],award[100];
char west[100],official[100];
char name[100][20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
getchar();
for (j=0;j<20;j++)
{
scanf("%c",&name[i][j]);
if (name[i][j]==' ')
break;
}
award[i]=0;
scanf("%d %d %c %c %d",&grade[i],&assess[i],&official[i],&west[i],&article[i]);
if (grade[i]>80 && article[i]>0)
award[i]+=a1;
if (grade[i]>85 && assess[i]>80)
award[i]+=a2;
if (grade[i]>90)
award[i]+=a3;
if (grade[i]>85 && west[i]=='Y')
award[i]+=a4;
if (assess[i]>80 && official[i]=='Y')
award[i]+=a5;
sum+=award[i];
if (award[i]>max)
{
max=award[i];
top=i;
}
}
for(i=0;i<20;i++)
{
if(name[top][i]!=' ')
printf("%c",name[top][i]);
else
break;
}
printf("\n%d\n%d\n",max,sum);
return 0;
}
| 39 |
19,145 | void main()
{
struct stud
{
char name[1000];
int gra;
int grcla;
char of;
char won;
int essay;
int sum;
};
struct stud a[1000];
int n,i,all=0,j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&a[i].name,&a[i].gra,&a[i].grcla,&a[i].of,&a[i].won,&a[i].essay);
}
for(i=0;i<n;i++)
{
a[i].sum=0;
if(a[i].gra>80&&a[i].essay>=1)a[i].sum=8000;
if(a[i].gra>85&&a[i].grcla>80)a[i].sum=a[i].sum+4000;
if(a[i].gra>90)a[i].sum=a[i].sum+2000;
if(a[i].gra>85&&a[i].won=='Y')a[i].sum=a[i].sum+1000;
if(a[i].grcla>80&&a[i].of=='Y')a[i].sum=a[i].sum+850;
}
for(i=0;i<n;i++)
all=all+a[i].sum;
for(i=0;i<=n-1;)
{
if(a[i].sum<a[j+1].sum)
i=i+1;
else if(a[i].sum>=a[j+1].sum)
j++;
if(j>=n)
break;
}
printf("%s\n",a[i].name);
printf("%d\n",a[i].sum);
printf("%d\n",all);
}
| 39 |
19,146 | struct student
{
char name[20];
int score;
int pscore;
char gjud;
char wjud;
int paper;
int sum;
}stu[100];
void main()
{
int n,i,ssum=0,tsum=0,ti;scanf("%d",&n);
for(i=0;i<n;i++)scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].score,&stu[i].pscore,&stu[i].gjud,&stu[i].wjud,&stu[i].paper),stu[i].sum=0;
for(i=0;i<n;i++)
{
if(stu[i].score>80&&stu[i].paper>=1)stu[i].sum+=8000;
if(stu[i].score>85&&stu[i].pscore>80)stu[i].sum+=4000;
if(stu[i].score>90)stu[i].sum+=2000;
if(stu[i].score>85&&stu[i].wjud=='Y')stu[i].sum+=1000;
if(stu[i].pscore>80&&stu[i].gjud=='Y')stu[i].sum+=850;
ssum+=stu[i].sum;
}
for(i=0;i<n;i++)if(stu[i].sum>tsum)tsum=stu[i].sum,ti=i;
printf("%s\n%d\n%d",stu[ti].name,tsum,ssum);
}
| 39 |
19,147 | struct studen{char name[100];int score1;int score2; char H;char W;int paper;int money;}stu[200];
int main()
{
int n,i,j,money=0,student,scholar=0;
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].H,&stu[i].W,&stu[i].paper);
stu[i].money=0;
if(stu[i].score1>80&&stu[i].paper>0)
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].W=='Y')
stu[i].money+=1000;
if(stu[i].score2>80&&stu[i].H=='Y')
stu[i].money+=850;
}
for(i=0;i<n;i++)
{
if(stu[i].money>money)
{
student=i;
money=stu[i].money;
}
scholar=scholar+stu[i].money;
}
printf("%s\n%d\n%d\n",stu[student].name,stu[student].money,scholar);
return 0;
}
| 39 |
19,148 |
void main()
{
struct student
{
char name[30];//??????????\0
int as;
int cs;
char pos;
char xibu;
int paper;
int money;
}stu[100],*p;
p=stu;
int i,n,sum=0,mark,max=0;
scanf("%d",&n);
for(i=0;i<n;i++,p++)
{
scanf("%s%d%d %c %c%d",&p->name,&p->as,&p->cs,&p->pos,&p->xibu,&p->paper);// ???%C?????
p->money=0;
if(p->as>80&&p->paper>=1)
p->money=p->money+8000;
if(p->as>85&&p->cs>80)
p->money=p->money+4000;
if(p->as>90)
p->money=p->money+2000;
if(p->as>85&&p->xibu=='Y')
p->money=p->money+1000;
if(p->pos=='Y'&&p->cs>80)
p->money=p->money+850;
sum=sum+p->money;
}
p=stu;//????????
for(i=0;i<n-1;i++,p++)
{
if(p->money>max)
{
max=p->money;
mark=i;
}
}
printf("%s\n%d\n%d",stu[mark].name,max,sum);
} | 39 |
19,149 | int qm[102],bp[102],lw[102];
char bg[102]={'\0'},xb[102]={'\0'};
int yuanshi(int i)
{
if(qm[i]>80&&lw[i]>0) return 8000;
else return 0;
}
int wusi(int i)
{
if(qm[i]>85&&bp[i]>80) return 4000;
else return 0;
}
int youxiu(int i)
{
if (qm[i]>90 ) return 2000;
else return 0;
}
int xibu(int i)
{
if(qm[i]>85&&xb[i]=='Y') return 1000;
else return 0;
}
int banji(int i)
{
if( bp[i]>80 && bg[i]=='Y') return 850;
else return 0;
}
int main()
{
int i,n,max,num,jxj[102]={0},sum=0;
char name[102][21]={'\0'};
cin>>n;
for(i=1;i<=n;i++)
{
cin>>name[i]>>qm[i]>>bp[i]>>bg[i]>>xb[i]>>lw[i];
jxj[i]=yuanshi(i)+wusi(i)+youxiu(i)+xibu(i)+banji(i);
}
max=jxj[1]; num=1,sum=jxj[1];
for(i=2;i<=n;i++)
{
sum=sum+jxj[i];
if (jxj[i]>max)
{
max=jxj[i];
num=i;
}
}
cout<<name[num]<<endl<<jxj[num]<<endl<<sum<<endl;
return 0;
} | 39 |
19,150 |
struct student
{
char name[30];
int exam;
int result;
char gan[2];
char xibu[2];
int lecture;
int bonus;
};
void main()
{
int n,i,sum=0;
struct student Max;
scanf("%d" ,&n);
struct student *stu;
stu = (struct student *)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{
scanf("%s %d %d %s %s %d" ,stu[i].name,&stu[i].exam,&stu[i].result,&stu[i].gan,&stu[i].xibu,&stu[i].lecture);
}
for(i=0;i<n;i++)
{
stu[i].bonus=0;
if(((stu[i].exam)>80)&&((stu[i].lecture)>0))
{
stu[i].bonus+=8000;
}
if(((stu[i].exam)>85)&&((stu[i].result)>80))
{
stu[i].bonus+=4000;
}
if((stu[i].exam)>90)
{
stu[i].bonus+=2000;
}
if(((stu[i].exam)>85)&&((stu[i].xibu[0])=='Y'))
{
stu[i].bonus+=1000;
}
if(((stu[i].result)>80)&&((stu[i].gan[0])=='Y'))
{
stu[i].bonus+=850;
}
}
Max=stu[0];
for(i=1;i<n;i++)
{
if(stu[i].bonus>Max.bonus)
Max=stu[i];
}
printf("%s\n" ,Max.name);
printf("%d\n" ,Max.bonus);
for(i=0;i<n;i++)
{
sum+=stu[i].bonus;
}
printf("%d\n" ,sum);
free(stu);
}
| 39 |
19,151 | struct student
{
char name[20];
int ss;
int cs;
char g[2];
char w[2];
int pa;
int m;
struct student *next;
};
void main()
{
int i,n,mm=0,all=0;
scanf("%d",&n);
struct student *head,*p1,*p2,*p,*q;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %s %s %d",p1->name,&p1->ss,&p1->cs,p1->g,p1->w,&p1->pa);
head=NULL;
while(mm<n-1)
{
mm=mm+1;
if(mm==1) head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %s %s %d",p1->name,&p1->ss,&p1->cs,p1->g,p1->w,&p1->pa);
}
p2->next=p1;
p2=p1;
p2->next=NULL;
/*?????*/
p=head;
do
{
p->m=0;
if(p->ss>80&&p->pa>=1)
p->m=p->m+8000;
if(p->ss>85&&p->cs>80)
p->m=p->m+4000;
if(p->ss>90)
p->m=p->m+2000;
if(p->ss>85&&strcmp(p->w,"Y")==0)
p->m=p->m+1000;
if(p->cs>80&&strcmp(p->g,"Y")==0)
p->m=p->m+850;
p=p->next;
}while(p!=NULL);
p=q=head;
do
{
all=all+q->m;
if(p->m<q->m)
p=q;
q=q->next;
}while(q!=NULL);
printf("%s\n%d\n%d\n",p->name,p->m,all);
} | 39 |
19,152 | void main()
{
struct student
{
char name[20];
int score1;
int score2;
char c1;
char c2;
int paper;
int bonus;
};
struct student stu[100];
int n,i,sum,max;
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].c1,&stu[i].c2,&stu[i].paper);
for(i=0;i<n;i++)
{
stu[i].bonus=0;
if(stu[i].score1>80&&stu[i].paper>=1)
stu[i].bonus+=8000;
if(stu[i].score1>85&&stu[i].score2>80)
stu[i].bonus+=4000;
if(stu[i].score1>90)
stu[i].bonus+=2000;
if(stu[i].score1>85&&stu[i].c2=='Y')
stu[i].bonus+=1000;
if(stu[i].score2>80&&stu[i].c1=='Y')
stu[i].bonus+=850;
}
max=0;
for(i=1;i<=n;i++)
if(stu[i].bonus>stu[max].bonus) max=i;
printf("%s\n",stu[max].name);
printf("%d\n",stu[max].bonus);
sum=0;
for(i=0;i<n;i++)
sum+=stu[i].bonus;
printf("%d",sum);
} | 39 |
19,153 | struct student
{
char name[20];
int fs;
int cs;
char gb;
char xb;
int paper;
int sch;
}stu[100];
int ys(int a,int b);
int ws(int a,int b);
int cj(int a);
int xibu(int a,char b);
int bj(int a,char b);
int main()
{
int n=0,i=0,sum=0,k=0,j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].fs,&stu[i].cs,&stu[i].gb,&stu[i].xb,&stu[i].paper);
stu[i].sch=0;
}
for(i=0;i<n;i++)
{
if(ys(stu[i].fs,stu[i].paper)==1)
{
stu[i].sch+=8000;
sum+=8000;
}
if(ws(stu[i].fs,stu[i].cs)==1)
{
stu[i].sch+=4000;
sum+=4000;
}
if(cj(stu[i].fs)==1)
{
stu[i].sch+=2000;
sum+=2000;
}
if(xibu(stu[i].fs,stu[i].xb)==1)
{
stu[i].sch+=1000;
sum+=1000;
}
if(bj(stu[i].cs,stu[i].gb)==1)
{
stu[i].sch+=850;
sum+=850;
}
}
k=stu[0].sch;
for(i=0;i<n;i++)
{
if(k<stu[i].sch)
{
j=i;
k=stu[i].sch;
}
}
printf("%s\n%d\n%d",stu[j].name,stu[j].sch,sum);
return 0;
}
int ys(int a,int b)
{
if(a>80&&b>=1)
{return 1;}
else return 0;
}
int ws(int a,int b)
{
if(a>85&&b>80)
{return 1;}
else return 0;
}
int cj(int a)
{
if(a>90)
{return 1;}
else return 0;
}
int xibu(int a,char b)
{
if(a>85&&b=='Y')
{return 1;}
else return 0;
}
int bj(int a,char b)
{
if(a>80&&b=='Y')
{return 1;}
else return 0;
}
| 39 |
19,154 | struct stu
{
char name[21];
int final;
int comment;
char leader[2];
char west[2];
int paper;
struct stu *next;
int total;
}*head,*p1,*p2;
void main()
{
int n,i,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct stu*)malloc(sizeof(struct stu));
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
scanf("%s%d%d%s%s%d",p1->name,&p1->final,&p1->comment,p1->leader,p1->west,&p1->paper);
}
p2->next=NULL;
for(p1=head;p1!=NULL;p1=p1->next)
{
p1->total=0;
if(p1->final>80&&p1->paper!=0){p1->total+=8000;}
if(p1->final>85&&p1->comment>80){p1->total+=4000;}
if(p1->final>90){p1->total+=2000;}
if(p1->final>85&&p1->west[0]=='Y'){p1->total+=1000;}
if(p1->comment>80&&p1->leader[0]=='Y'){p1->total+=850;}
}
max=head->total;
for(p1=head->next;p1!=NULL;p1=p1->next)
max=max>p1->total?max:p1->total;
for(p1=head;p1!=NULL;p1=p1->next)
{
if(p1->total==max)break;
}
printf("%s\n%d\n",p1->name,max);
max=0;
for(p1=head;p1!=NULL;p1=p1->next)
max+=p1->total;
printf("%d\n",max);
} | 39 |
19,155 | void main()
{
int n, i, sum, z;
struct student
{
char name[20];
int exam;
int cla;
char lead;
char west;
int theo;
int sch;
};
struct student stu[100];
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%s", stu[i].name);
scanf("%d", &stu[i].exam);
scanf("%d %c %c %d", &stu[i].cla, &stu[i].lead, &stu[i].west, &stu[i].theo);
}
for(i=0; i<n; i++)
{
stu[i].sch = 0;
if(stu[i].exam>80 && stu[i].theo>0)
stu[i].sch = stu[i].sch + 8000;
if(stu[i].exam>85 && stu[i].cla>80)
stu[i].sch = stu[i].sch + 4000;
if(stu[i].exam>90)
stu[i].sch = stu[i].sch + 2000;
if(stu[i].exam>85 && stu[i].west=='Y')
stu[i].sch = stu[i].sch + 1000;
if(stu[i].cla>80 && stu[i].lead=='Y')
stu[i].sch = stu[i].sch + 850;
}
z = 0;
for(i=0; i<n; i++)
{
if(stu[i].sch>stu[z].sch)
z = i;
}
sum = 0;
for(i=0; i<n; i++)
sum = sum + stu[i].sch;
printf("%s\n", stu[z].name);
printf("%d\n", stu[z].sch);
printf("%d\n", sum);
}
| 39 |
19,156 | int main()
{
struct student
{
char name[20];
int b;
int c;
char d;
char e;
int f;
int g;
}a[2];
int n,i,sum;
scanf("%d",&n);
scanf("%s %d %d %c %c %d",a[0].name,&a[0].b,&a[0].c,&a[0].d,&a[0].e,&a[0].f);
a[0].g=0;
if((a[0].b>80)&&(a[0].f>0))
a[0].g=a[0].g+8000;
if((a[0].b>85)&&(a[0].c>80))
a[0].g=a[0].g+4000;
if(a[0].b>90)
a[0].g=a[0].g+2000;
if((a[0].b>85)&&(a[0].e=='Y'))
a[0].g=a[0].g+1000;
if((a[0].c>80)&&(a[0].d=='Y'))
a[0].g=a[0].g+850;
sum=a[0].g;
for(i=1;i<n;i++){
scanf("%s %d %d %c %c %d",a[1].name,&a[1].b,&a[1].c,&a[1].d,&a[1].e,&a[1].f);
a[1].g=0;
if((a[1].b>80)&&(a[1].f>0))
a[1].g=a[1].g+8000;
if((a[1].b>85)&&(a[1].c>80))
a[1].g=a[1].g+4000;
if(a[1].b>90)
a[1].g=a[1].g+2000;
if((a[1].b>85)&&(a[1].e=='Y'))
a[1].g=a[1].g+1000;
if((a[1].c>80)&&(a[1].d=='Y'))
a[1].g=a[1].g+850;
sum=sum+a[1].g;
if(a[0].g<a[1].g)
a[0]=a[1];
}
printf("%s\n%d\n%d\n",a[0].name,a[0].g,sum);
return 0;
}
| 39 |
19,157 | struct student
{
char name[20];//?????//
int final;//??????//
int a;//??????//
char b;//???????//
char c;//???????//
int d;//??????//
int scholarship;
struct student *next;
};
int main()
{
int N,i,j,money;
long int sum=0;
char a[20];
scanf("%d",&N);
struct student *p1,*p2,*head;
for(i=0;i<N;i++)
{
p1=(struct student *)malloc(Len);
p1->scholarship=0;
if(i==0)
{
head=p1;
}
else
{
p2->next=p1;
}
p2=p1;
scanf("%s %d %d %c %c %d",p1->name,&p1->final,&p1->a,&p1->b,&p1->c,&p1->d);
}
p2->next=NULL;
p1=head;
for(i=0;i<N;i++)
{
if(p1->final>80&&p1->d>=1)//????80???????>=1//
{
p1->scholarship+=8000;
}
if(p1->final>85&&p1->a>80)//????85?????????80???//
{
p1->scholarship+=4000;
}
if(p1->final>90)//????90???//
{
p1->scholarship+=2000;
}
if(p1->final>85&&p1->c=='Y')//????85???????//
{
p1->scholarship+=1000;
}
if(p1->a>80&&p1->b=='Y')//??????80????????//
{
p1->scholarship+=850;
}
p1=p1->next;
}
p1=head;
for(i=0;i<N;i++)
{
sum+=p1->scholarship;
p1=p1->next;
}
p1=head;
for(j=0;j<N-1;j++)
{
p2=p1->next;
for(i=0;i<N-1-j;i++)
{
if(p1->scholarship<p2->scholarship)
{
strcpy(a,p1->name);
strcpy(p1->name,p2->name);
strcpy(p2->name,a);
money=p1->scholarship;
p1->scholarship=p2->scholarship;
p2->scholarship=money;
}
p2=p2->next;
}
p1=p1->next;
}
p1=head;
printf("%s\n%d\n%ld",p1->name,p1->scholarship,sum);
return 0;
}
| 39 |
19,158 |
struct student
{
char name[20];
int qm;
int bj;
char gb,xb;
int lw;
int jj;
}stu[100];
int main()
{
char c;
int n,i,j,sum=0;
struct student*pstu=stu,e;
pstu=&stu[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++){stu[i].jj=0;
if(stu[i].qm>80&&stu[i].lw>=1){stu[i].jj+=8000;}
if(stu[i].qm>85&&stu[i].bj>80){stu[i].jj+=4000;}
if(stu[i].qm>90){stu[i].jj+=2000;}
if(stu[i].qm>85&&stu[i].xb=='Y'){stu[i].jj+=1000;}
if(stu[i].bj>80&&stu[i].gb=='Y'){stu[i].jj+=850;}
}
for(j=0;j<n;j++){
for(i=0;i<n-j;i++){
if(stu[i].jj<stu[i+1].jj){
e=*(pstu+i);
*(pstu+i)=*(pstu+i+1);
*(pstu+1+i)=e;}
}}
for(i=0;i<n;i++){sum+=stu[i].jj;}
printf("%s\n%d\n%d\n",(pstu)->name,(pstu)->jj,sum);
scanf("%s",c);return 0;
}
| 39 |
19,159 | void main()
{
int N,i,x[100],j,sum=0,t[100]={0},a[100],b[100],c[100],y;
char name[100][20]={'\0'},f[100],e[100];
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s",name[i]);
scanf("%d ",&a[i]);
scanf("%d ",&b[i]);
scanf("%c",&f[i]);
scanf(" %c",&e[i]);
scanf(" %d",&c[i]);
}
for(i=0;i<N;i++)
{
if(a[i]>80&&c[i]>=1)
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&&e[i]=='Y')
t[i]=t[i]+1000;
if(b[i]>80&&f[i]=='Y')
t[i]=t[i]+850;
}
for(i=0;i<N;i++)
{
sum=sum+t[i];
x[i]=t[i];
}
for(i=0;i<N-1;i++)
for(j=0;j<N-1-i;j++)
if(t[j]<t[j+1])
{
y=t[j+1];
t[j+1]=t[j];
t[j]=y;
}
for(i=0;i<N;i++)
if(x[i]==t[0])
{
printf("%s\n%d\n%d\n",name[i],t[0],sum);
break;
}
}
| 39 |
19,160 | void main()
{
int max,n,i,g=0,sum,qimo,banji,lunwen,zong[200];
char name[200][20],ganbu,xibu;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",name[i],&qimo,&banji,&ganbu,&xibu,&lunwen);
zong[i]=0;
if(qimo>80&&lunwen>=1)
zong[i]=zong[i]+8000;
if(banji>80&&qimo>85)
zong[i]=zong[i]+4000;
if(qimo>90)
zong[i]=zong[i]+2000;
if(qimo>85&&xibu=='Y')
zong[i]=zong[i]+1000;
if(banji>80&&ganbu=='Y')
zong[i]=zong[i]+850;
}
max=zong[0];
sum=zong[0];
for(i=1;i<n;i++)
{
if(zong[i]>max)
{
max=zong[i];
g=i;
}
sum=sum+zong[i];
}
for(i=0;i<strlen(name[g]);i++)
printf("%c",name[g][i]);
printf("\n%d\n%d",zong[g],sum);
}
| 39 |
19,161 | int main()
{
long sum=0,s,max=0;
int n,i,a,b,e;
char nm[20],nm0[20],c[2],d[2];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%d%d%s%s%d",nm,&a,&b,c,d,&e);
s=0;
if(a>80&&e)s+=8000;
if(a>85&&b>80)s+=4000;
if(a>90)s+=2000;
if(a>85&&d[0]=='Y')s+=1000;
if(b>80&&c[0]=='Y')s+=850;
sum+=s;
if(s>max)
{
strcpy(nm0,nm);
max=s;
}
}
printf("%s\n%d\n%d\n",nm0,max,sum);
return 0;
} | 39 |
19,162 | void main()
{
int sum[100]={0},i,n,p=0;
struct student
{
char name[21];
int a;
int b;
char c;
char d;
int e;
}stu[100];
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].c,&stu[i].d,&stu[i].e);
}
for(i=0;i<n;i++)
{
if(stu[i].a>80&&stu[i].e>=1)
sum[i]+=8000;
if(stu[i].a>85&&stu[i].b>80)
sum[i]+=4000;
if(stu[i].a>90)
sum[i]+=2000;
if(stu[i].a>85&&stu[i].d=='Y')
sum[i]+=1000;
if(stu[i].b>80&&stu[i].c=='Y')
sum[i]+=850;
}
for(i=0;i<n;i++)
{p+=sum[i];}
for(i=1;i<n;i++)
{
if(sum[0]<sum[i])
{stu[0]=stu[i];
sum[0]=sum[i];}
}
printf("%s\n",stu[0].name);
printf("%d\n",sum[0]);
printf("%d",p);
} | 39 |
19,163 | struct stu
{
char n[30];
int a;
int b;
char c;
char d;
int e;
int sum;
struct stu *next;
};
void main()
{
int i,n,max=0,sum;
struct stu *head,*p1,*p2;
scanf("%d",&n);
head=p1=p2=(struct stu*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->n,&p1->a,&p1->b,&p1->c,&p1->d,&p1->e);
p1->sum=0;
for(i=0;i<n-1;i++)
{
p1=(struct stu*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->n,&p1->a,&p1->b,&p1->c,&p1->d,&p1->e);
p1->sum=0;
p2->next=p1;
p2=p1;
}
p1->next=NULL;
p1=p2=head;
for(i=0;i<n;i++,p1=p1->next)
{
if(p1->a>80&&p1->e>0)
p1->sum+=8000;
if(p1->a>85&&p1->b>80)
p1->sum+=4000;
if(p1->a>90)
p1->sum+=2000;
if(p1->a>85&&p1->d=='Y')
p1->sum+=1000;
if(p1->b>80&&p1->c=='Y')
p1->sum+=850;
}
p1=head;
for(i=0;i<n;i++,p1=p1->next)
{
if(max<p1->sum)
max=p1->sum;
}
p1=head;
sum=0;
for(i=0;i<n;i++,p1=p1->next)
{
sum+=p1->sum;
}
p1=head;
for(i=0;i<n;i++,p1=p1->next)
{
if(p1->sum==max)
{
printf("%s\n%d\n",p1->n,p1->sum);
break;
}
}
printf("%d",sum);
} | 39 |
19,164 | void main()
{
int n,qm[100],bj[100],lw[100],i,j,l=0,k,z[100]={0},p=0;
char na[100][30],bg[100],mz[100],P[1][30];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",na[i],&qm[i],&bj[i],&bg[i],&mz[i],&lw[i]);
}
for(i=0;i<n;i++)
{
if(qm[i]>80 && lw[i]>=1)
z[i]=z[i]+8000;
if(qm[i]>85 && bj[i]>80)
z[i]=z[i]+4000;
if(qm[i]>90)
z[i]=z[i]+2000;
if(qm[i]>85 && mz[i]=='Y')
z[i]=z[i]+1000;
if(bg[i]=='Y' && bj[i]>80)
z[i]=z[i]+850;
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-j-1;i++)
if(z[i]<z[i+1])
{
k=z[i];
z[i]=z[i+1];
z[i+1]=k;
strcpy(P,na[i]);
strcpy(na[i],na[i+1]);
strcpy(na[i+1],P);
}
}
for(i=0;i<n;i++)
p=p+z[i];
printf("%s\n%d\n%d\n",na[0],z[0],p);
} | 39 |
19,165 | struct st
{
char name[25];
int sc[2];
char leader;
char west;
int paper;
};
void main()
{
struct st s[200];
int n,i,j=0,max=0,sum=0,a[200]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d%d %c %c%d",s[i].name,&s[i].sc[0],&s[i].sc[1],&s[i].leader,&s[i].west,&s[i].paper);
for(i=0;i<n;i++)
{
if(s[i].sc[0]>80&&s[i].paper>0)
a[i]=a[i]+8000;
if(s[i].sc[0]>85&&s[i].sc[1]>80)
a[i]=a[i]+4000;
if(s[i].sc[0]>90)
a[i]=a[i]+2000;
if(s[i].sc[0]>85&&s[i].west=='Y')
a[i]=a[i]+1000;
if(s[i].sc[1]>80&&s[i].leader=='Y')
a[i]=a[i]+850;
}
for(i=0;i<n;i++)
{
j=(a[i]>max)? i:j;
max=(a[i]>max)? a[i]:max;
sum=sum+a[i];
}
printf("%s\n%d\n%d",s[j].name,a[j],sum);
} | 39 |
19,166 | int main()
{
int n,i,a[200],b[200],c[200],m[200],s=0,max,maxj;
char d[200][40],e[200],f[200];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d %c %c %d",d[i],&a[i],&b[i],&e[i],&f[i],&c[i]);
}
for(i=0;i<n;i++){
m[i]=0;
if(a[i]>80 && c[i]>0){
m[i]+=8000;
}
if(a[i]>85 && b[i]>80){
m[i]+=4000;
}
if(a[i]>90){
m[i]+=2000;
}
if(a[i]>85 && f[i]=='Y'){
m[i]+=1000;
}
if(b[i]>80 && e[i]=='Y'){
m[i]+=850;
}
}
for(i=0;i<n;i++){
s+=m[i];
}
max=m[0];
maxj=0;
for(i=1;i<n;i++){
if(m[i]>max){
max=m[i];
maxj=i;
}
}
printf("%s\n%d\n%d",d[maxj],max,s);
return 0;
} | 39 |
19,167 |
int main() {
struct stu1{
char name[30];
int scor;
int grad;
char as;
char xi;
int num;
int reward;
} stu[100], temp;
int n, i, re=0;
char hhh;
scanf("%d" ,&n);
for(i=0;i<n;i++) {
scanf("%s%d%d%c%c%c%c%d", stu[i].name, &stu[i].scor, &stu[i].grad, &hhh,&stu[i].as,&stu[i].xi,&stu[i].xi, &stu[i].num);
stu[i].reward=0;
if(stu[i].scor>80&&stu[i].num>=1) {
stu[i].reward+=8000;
}
if(stu[i].scor>85&&stu[i].grad>80) {
stu[i].reward+=4000;
}
if(stu[i].scor>90) {
stu[i].reward+=2000;
}
if(stu[i].scor>85&&stu[i].xi=='Y') {
stu[i].reward+=1000;
}
if(stu[i].grad>80&&stu[i].as=='Y') {
stu[i].reward+=850;
}
}
temp=stu[0];
for(i=0;i<n;i++) {
if(stu[i].reward>temp.reward) {
temp=stu[i];
}
}
for(i=0;i<n;i++) {
re+=stu[i].reward;
}
printf("%s\n%d\n%d", temp.name, temp.reward, re);
return 0;
}
| 39 |
19,168 | struct student
{
char name[20];
int qimo;
int banpin;
char ganbu;
char xibu;
int lunwen;
double sum;
}stu[100];
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].qimo,&stu[i].banpin,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
stu[i].sum=0;
if(stu[i].qimo>80&&stu[i].lunwen>0)stu[i].sum=stu[i].sum+8000;
if(stu[i].qimo>85&&stu[i].banpin>80)stu[i].sum=stu[i].sum+4000;
if(stu[i].qimo>90)stu[i].sum=stu[i].sum+2000;
if(stu[i].xibu=='Y'&&stu[i].qimo>85)stu[i].sum=stu[i].sum+1000;
if(stu[i].ganbu=='Y'&&stu[i].banpin>80)stu[i].sum=stu[i].sum+850;
}
int max=0,totalsum=0;
for(i=0;i<n;i++)
{if(stu[i].sum>max)max=stu[i].sum;}
for(i=0;i<n;i++)
{if(stu[i].sum==max){printf("%s\n",stu[i].name);break;}}
for(i=0;i<n;i++)
{
totalsum=totalsum+stu[i].sum;
}
printf("%d\n%d",max,totalsum);
}
| 39 |
19,169 | struct stud
{
char a[30];
int sco1;
int sco2;
char mon;
char west;
int ess;
};
main()
{
struct stud xx[100];
int n,i,my[100],max,sum=0,re;
scanf("%d",&n);
getchar();
for(i=0;i<n;i++)
{
scanf("%s%d %d %c %c %d",xx[i].a,&xx[i].sco1,&xx[i].sco2,&xx[i].mon,&xx[i].west,&xx[i].ess);
getchar();
my[i]=0;
if(xx[i].sco1>80&&xx[i].ess>0)
my[i]=my[i]+8000;
if(xx[i].sco1>85&&xx[i].sco2>80)
my[i]=my[i]+4000;
if(xx[i].sco1>90)
my[i]=my[i]+2000;
if(xx[i].sco1>85&&xx[i].west=='Y')
my[i]=my[i]+1000;
if(xx[i].sco2>80&&xx[i].mon=='Y')
my[i]=my[i]+850;
}
max=my[0];
for(i=0;i<n;i++)
{
sum=sum+my[i];
if(my[i]>max)
{
max=my[i];
re=i;
}
}
printf("%s\n%d\n%d",xx[re].a,max,sum);
} | 39 |
19,170 |
int main(int argc, char *argv[])
{
struct stu
{
char name[25];
int score;
int pinyi;
char ganbu;
char xibu;
int lunwen;
}stu[110];
int n,i,m;
char str[25];
m=0;
int a[110];
int total;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].score,&stu[i].pinyi,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
}
for(i=0;i<n;i++)
{a[i]=0;
if(stu[i].score>80&&stu[i].lunwen>=1){a[i]+=8000;}
if(stu[i].score>85&&stu[i].pinyi>80){a[i]+=4000;}
if(stu[i].score>90){a[i]+=2000;}
if(stu[i].score>85&&stu[i].xibu=='Y'){a[i]+=1000;}
if(stu[i].pinyi>80&&stu[i].ganbu=='Y'){a[i]+=850;}
}
for(i=0;i<n;i++)
{
if(a[i]>m){strcpy(str,stu[i].name);m=a[i];}
}
printf("%s\n%d\n",str,m);
total=0;
for(i=0;i<n;i++)
{total+=a[i];}
printf("%d\n",total);
return 0;
}
| 39 |
19,171 | struct student
{
char name[20];
int score;
int judge;
char c1;
char c2;
char num;
int money;
};
int main()
{
struct student a[501];
char s1[20];
int i,n,max=0,sum=0;
int score1,num1,judge1;
char c11,c12;
struct student *p;
p=a;
scanf("%d",&n);
for(;p<a+n;p++)
{
scanf("%s",s1);
strcpy(p->name,s1);
scanf("%d %d %c %c %d",&score1,&judge1,&c11,&c12,&num1);
p->c1=c11;
p->c2=c12;
p->judge=judge1;
p->num=num1;
p->score=score1;
p->money=0;
}
p=a;
for(;p<a+n;p++)
{
if(p->score>80&&p->num>0) p->money+=8000;
if(p->judge>80&&p->score>85) p->money+=4000;
if(p->score>90) p->money+=2000;
if(p->c1=='Y'&&p->judge>80) p->money+=850;
if(p->c2=='Y'&&p->score>85) p->money+=1000;
}
p=a;
for(;p<a+n;p++)
{
if(p->money>max) max=p->money;
sum+=p->money;
}
p=a;
for(;p<a+n;p++)
{
if(p->money==max)
{
printf("%s\n%d\n",p->name,p->money);
break;
}
}
printf("%d\n",sum);
return 0;
} | 39 |
19,172 | void main()
{
struct student
{
char name[20];
int final;
int eval;
char leader;
char west;
int paper;
} s;
char maxname[20];
int n,i,j;
int prize,max=0,sum=0;
scanf("%d",&n);
for(i=0;i<n;i=i+1)
{
prize=0;
for(j=0;j<20;j=j+1)
s.name[j]='\0';
s.final=0;
s.eval=0;
s.leader='\0';
s.west='\0';
s.paper=0;
scanf("%s",s.name);
scanf("%d",&s.final);
scanf("%d ",&s.eval);
scanf("%c ",&s.leader);
scanf("%c",&s.west);
scanf("%d",&s.paper);
if(s.final>80 && s.paper>0)
prize=prize+8000;
if(s.final>85 && s.eval>80)
prize=prize+4000;
if(s.final>90)
prize=prize+2000;
if(s.final>85 && s.west=='Y')
prize=prize+1000;
if(s.eval>80 && s.leader=='Y')
prize=prize+850;
sum=sum+prize;
if(prize>max)
{
max=prize;
for(j=0;j<20;j=j+1)
maxname[j]='\0';
strcpy(maxname,s.name);
}
}
printf("%s\n",maxname);
printf("%d\n",max);
printf("%d\n",sum);
} | 39 |
19,173 | struct student
{
char a[20];
int b;
int c;
char d;
char e;
int f;
int g;
};
int main()
{
struct student *s;
int n,i,sum=0,q,max;
scanf("%d",&n);
s=(struct student*)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",s[i].a,&s[i].b,&s[i].c,&s[i].d,&s[i].e,&s[i].f);
}
for(i=0;i<n;i++)
{
s[i].g=0;
if(s[i].b>80&&s[i].f>=1)
s[i].g=s[i].g+8000;
if(s[i].b>85&&s[i].c>80)
s[i].g=s[i].g+4000;
if(s[i].b>90)
s[i].g=s[i].g+2000;
if(s[i].b>85&&s[i].e=='Y')
s[i].g=s[i].g+1000;
if(s[i].c>80&&s[i].d=='Y')
s[i].g=s[i].g+850;
sum=sum+s[i].g;
}
max=s[0].g;
q=0;
for(i=0;i<n;i++)
{
if(max<s[i].g)
{
q=i;
max=s[i].g;
}
}
printf("%s\n%d\n%d",s[q].a,s[q].g,sum);
return 0;
} | 39 |
19,174 |
struct people
{
char name[30];
int qimo;
int pingyi;
char gan;
char xi;
int lunwen;
int jiang;
}line[100], temp;
int main()
{
int n, i, j;
scanf("%d\n", &n);
int sum=0;
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d", &line[i].name, &line[i].qimo, &line[i].pingyi, &line[i].gan, &line[i].xi, &line[i].lunwen);
line[i].jiang=0;
if(line[i].qimo>80&&line[i].lunwen!=0)
{
line[i].jiang+=8000;
}
if(line[i].qimo>85&&line[i].pingyi>80)
{
line[i].jiang+=4000;
}
if(line[i].qimo>90)
{
line[i].jiang+=2000;
}
if(line[i].qimo>85&&(int)line[i].xi==(int)'Y')
{
line[i].jiang+=1000;
}
if(line[i].pingyi>80&&(int)line[i].gan==(int)'Y')
{
line[i].jiang+=850;
}
sum+=line[i].jiang;
}
for(i=1;i<n;i++)
{
for(j=1;j<=n-i;j++)
{
if(line[j].jiang<line[j+1].jiang)
{
temp=line[j];
line[j]=line[j+1];
line[j+1]=temp;
}
}
}
printf("%s\n%d\n%d", line[1].name, line[1].jiang, sum);
return 0;
}
| 39 |
19,175 | int main(){
char s[20];
char p[20];
char a,b;
int n,i,num=0,sum=0;
int c,d,e;
int m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",s,&c,&d,&a,&b,&e);
if(c>80&&e>=1)
num=num+8000;
if(c>85&&d>80)
num=num+4000;
if(c>90)
num=num+2000;
if(b=='Y'&&c>85)
num=num+1000;
if(a=='Y'&&d>80)
num=num+850;
if(num>m)
{
m=num;
strcpy(p,s);
}
sum=sum+num;
num=0;
}
printf("%s\n%d\n%d\n",p,m,sum);
}
| 39 |
19,176 |
int yuan(int p,int q)
{
int z=0;
if(p>80&&q>=1) z=1;
return z;
}
int wusi(int p,int q)
{
int z=0;
if(p>85&&q>80) z=1;
return z;
}
int youxiu(int p)
{
int z=0;
if(p>90) z=1;
return z;
}
int xibu(int p,char ip)
{
int z=0;
if(p>85&&ip=='Y') z=1;
return z;
}
int banji(int p,char ip)
{int z=0;
if(p>80&&ip=='Y') z=1;
return z;
}
void main()
{
struct student
{
char name[20];
int gpa;
int arg;
char leader;
char xibu;
int paper;
int sum;
}*s;
int i,n,a,b,c,d,e,sum=0;
scanf("%d",&n);
s=(struct student*)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&s[i].name,&(*(s+i)).gpa,&(*(s+i)).arg,&(*(s+i)).leader,&(*(s+i)).xibu,&(*(s+i)).paper);
(*(s+i)).sum=0;
a=yuan((*(s+i)).gpa,(*(s+i)).paper);
b=wusi((*(s+i)).gpa,(*(s+i)).arg);
c=youxiu((*(s+i)).gpa);
d=xibu((*(s+i)).gpa,(*(s+i)).xibu);
e=banji((*(s+i)).arg,(*(s+i)).leader);
(*(s+i)).sum=8000*a+4000*b+2000*c+1000*d+850*e;
sum=sum+(*(s+i)).sum;
}
for(i=1;i<n;i++)
{
if((*(s+0)).sum<(*(s+i)).sum)
(*(s+0))=(*(s+i));
}
printf("%s\n%d\n%d",s[0].name,(*(s+0)).sum,sum);
}
| 39 |
19,177 |
int main(int argc, char* argv[])
{
int n,i,j,a,b,e,max1=0,max2=0;
char name[100],NAME[100];
int sum[100];
char c,d;
int s[5];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<5;j++) s[j]=0;
scanf("%s%d%d %c %c%d",name,&a,&b,&c,&d,&e);
if(a>80&&e>=1) s[0]++;
if(a>85&&b>80) s[1]++;
if(a>90) s[2]++;
if(a>85&&d=='Y') s[3]++;
if(b>80&&c=='Y') s[4]++;
sum[i]=8000*s[0]+4000*s[1]+2000*s[2]+1000*s[3]+850*s[4];
if(sum[i]>max1)
{
max1=sum[i];
strcpy(NAME,name);
for(j=0;j<100;j++) name[j]='\0';
}
}
for(i=0;i<n;i++) max2=max2+sum[i];
printf("%s\n%d\n%d\n",NAME,max1,max2);
return 0;
} | 39 |
19,178 | void main()
{
int n,i,sum[100],b,total,max;
struct student
{
char name[20];
int score;
int p;
char leader;
char w;
int paper;
}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].p,&stu[i].leader,&stu[i].w,&stu[i].paper);
for(i=0;i<n;i++)
{
sum[i]=0;
if(stu[i].score>80&&stu[i].paper>0)
sum[i]=sum[i]+8000;
if(stu[i].score>85)
{
if(stu[i].p>80)
sum[i]=sum[i]+4000;
if(stu[i].w=='Y')
sum[i]=sum[i]+1000;
}
if(stu[i].score>90)
sum[i]=sum[i]+2000;
if(stu[i].leader=='Y'&&stu[i].p>80)
sum[i]=sum[i]+850;
}
total=sum[0];
max=sum[0];
b=0;
for(i=1;i<n;i++)
{
if(max<sum[i])
{
max=sum[i];
b=i;
}
total=total+sum[i];
}
printf("%s\n%d\n%d",stu[b].name,sum[b],total);
} | 39 |
19,179 |
struct person
{
char name[30];
int qimo;
int banji;
char ganbu[5];
char xibu[5];
int lunwen;
int yuanshijiangxue;
int wusijiangxue;
int chengjiyouxiu;
int xibujiangxue;
int banjigongxian;
int total;
}student[110];
int main()
{
int n, i, all=0, max=0, whom=-1;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%s", student[i].name);
scanf("%d", &student[i].qimo);
scanf("%d", &student[i].banji);
scanf("%s", student[i].ganbu);
scanf("%s", student[i].xibu);
scanf("%d", &student[i].lunwen);
}
for(i=0; i<n; i++)
{
if(student[i].lunwen>0 && student[i].qimo>80)
{
student[i].yuanshijiangxue=8000;
}
else
{
student[i].yuanshijiangxue=0;
}
}
for(i=0; i<n; i++)
{
if(student[i].qimo>85 && student[i].banji>80)
{
student[i].wusijiangxue=4000;
}
else
{
student[i].wusijiangxue=0;
}
}
for(i=0; i<n; i++)
{
if(student[i].qimo>90)
{
student[i].chengjiyouxiu=2000;
}
else
{
student[i].chengjiyouxiu=0;
}
}
for(i=0; i<n; i++)
{
if(student[i].xibu[0]=='Y' && student[i].qimo>85)
{
student[i].xibujiangxue=1000;
}
else
{
student[i].xibujiangxue=0;
}
}
for(i=0; i<n; i++)
{
if(student[i].banji>80 && student[i].ganbu[0]=='Y')
{
student[i].banjigongxian=850;
}
else
{
student[i].banjigongxian=0;
}
}
for(i=0; i<n; i++)
{
student[i].total=student[i].yuanshijiangxue+student[i].wusijiangxue+student[i].chengjiyouxiu+student[i].xibujiangxue+student[i].banjigongxian;
}
for(i=0; i<n; i++)
{
all=all+student[i].total;
}
for(i=n-1; i>=0; i--)
{
if(student[i].total>=max)
{
max=student[i].total;
whom=i;
}
}
printf("%s\n", student[whom].name);
printf("%d\n", student[whom].total);
printf("%d", all);
return 0;
} | 39 |
19,180 | struct student
{
char name[50];
int score;
int pin;
char stu;
char west;
int num;
};
void main()
{
struct student a[100];
long int n,i,j,k,sum[100]={0},total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].score,&a[i].pin,&a[i].stu,&a[i].west,&a[i].num);
if(a[i].score>80&&a[i].num>=1) sum[i]=sum[i]+8000;
if(a[i].score>85&&a[i].pin>80) sum[i]=sum[i]+4000;
if(a[i].score>90) sum[i]=sum[i]+2000;
if(a[i].score>85&&a[i].west=='Y') sum[i]=sum[i]+1000;
if(a[i].pin>80&&a[i].stu=='Y') sum[i]=sum[i]+850;
total=total+sum[i];
}
k=sum[0];
for(i=1;i<n;i++)
{
if(k<sum[i])
{
k=sum[i];
j=i;
}
}
printf("%s\n%ld\n%ld\n",a[j].name,sum[j],total);
}
| 39 |
19,181 | void main()
{
char name[100][100],student[100][5],west[100][5];
int final[100], clas[100], essay[100],scholarship[100]={0};
int n,total=0;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",&name[i],&final[i],&clas[i],&student[i],&west[i],&essay[i]);
}
for(i=0;i<n;i++)
{
if(final[i]>80&&essay[i]>=1)
scholarship[i]=scholarship[i]+8000;
if(final[i]>85&&clas[i]>80)
scholarship[i]=scholarship[i]+4000;
if(final[i]>90)
scholarship[i]=scholarship[i]+2000;
if(west[i][0]=='Y'&&final[i]>85)
scholarship[i]=scholarship[i]+1000;
if(student[i][0]=='Y'&&clas[i]>80)
scholarship[i]=scholarship[i]+850;
total=total+scholarship[i];
}
int max=0,k;
for(i=0;i<n;i++)
{
if(scholarship[i]>max)
{
max=scholarship[i];
k=i;
}
}
printf("%s\n",name[k]);
printf("%d\n%d\n",scholarship[k],total);
}
| 39 |
19,182 | int main()
{
int n;
scanf("%d\n",&n);
char s[20],t[20];
int a,b,e,m,sum=0,max=0;
char c,d;
for(int i=0;i<n;i++)
{
m=0;
scanf("%s %d %d %c %c %d",s,&a,&b,&c,&d,&e);
if(a>80&&e>=1)
m=m+8000;
if(a>85&&b>80)
m=m+4000;
if(a>90)
m=m+2000;
if(a>85&&d=='Y')
m=m+1000;
if(b>80&&c=='Y')
m=m+850;
if(m>max)
{
max=m;
int j;
for(j=0;s[j]!='\0';j++)
{
t[j]=s[j];
}
t[j]='\0';
}
sum=sum+m;
}printf("%s\n%d\n",t,max);
printf("%d",sum);
return 0;
} | 39 |
19,183 | struct student
{
char name[20];
int GPA;
int val;
char moni;
char west;
int paper;
int scholar;
}stu[100];
void main()
{
int n,i,max=0,sum,k;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].GPA,&stu[i].val,&stu[i].moni,&stu[i].west,&stu[i].paper);
}
for(i=0;i<=n-1;i++)
{
stu[i].scholar=0;
if(stu[i].GPA>80&&stu[i].paper>=1)
stu[i].scholar=stu[i].scholar+8000;
if(stu[i].GPA>85&&stu[i].val>80)
stu[i].scholar=stu[i].scholar+4000;
if(stu[i].GPA>90)
stu[i].scholar=stu[i].scholar+2000;
if(stu[i].GPA>85&&stu[i].west=='Y')
stu[i].scholar=stu[i].scholar+1000;
if(stu[i].val>80&&stu[i].moni=='Y')
stu[i].scholar=stu[i].scholar+850;
}
for(i=0,max=stu[0].scholar,sum=0;i<=n-1;i++)
{
if(stu[i].scholar>max)
{
k=i;
max=stu[i].scholar;
}
sum=sum+stu[i].scholar;
}
printf("%s\n%d\n%d",stu[k].name,stu[k].scholar,sum);
} | 39 |
19,184 |
struct data
{
char name[200];
int score;
int classscore;
char leader;
char west;
int paper;
int scholarship;
struct data *next;
};
int main()
{
int N;
scanf("%d",&N);
int i,sum=0,max=0;
struct data *head,*p1,*p2,*recorder;
p1=(struct data *)malloc(Len);
scanf("%s %d %d %c %c %d",p1->name,&p1->score,&p1->classscore,&p1->leader,&p1->west,&p1->paper);
p1->next=NULL;
p1->scholarship=0;
head=p1;
p2=p1;
for (i=1;i<N;i++)
{
p1=(struct data *)malloc(Len);
scanf("%s %d %d %c %c %d",p1->name,&p1->score,&p1->classscore,&p1->leader,&p1->west,&p1->paper);
p1->next=NULL;
p1->scholarship=0;
p2->next=p1;
p2=p1;
}
for (p1=head;p1!=NULL;p1=p1->next)
{
if (p1->paper>0&&p1->score>80) p1->scholarship+=8000;
if (p1->score>85&&p1->classscore>80) p1->scholarship+=4000;
if (p1->score>90) p1->scholarship+=2000;
if (p1->score>85&& p1->west=='Y') p1->scholarship+=1000;
if (p1->classscore>80 && p1->leader=='Y') p1->scholarship+=850;
if (p1->scholarship>max)
{
max=p1->scholarship;
recorder=p1;
}
sum=sum+p1->scholarship;
}
printf("%s\n%d\n%d\n",recorder->name,recorder->scholarship,sum);
return 0;
}
| 39 |
19,185 | struct bac
{
char name[20];
int num1;
int num2;
char ganbu;
char west;
char paper;
int money;
};
int main()
{
struct bac stu[101];
struct bac temp;
int i,j,n,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
stu[i].money=0;
scanf("%s",&stu[i].name);
scanf("%d",&stu[i].num1);
scanf("%d",&stu[i].num2);
getchar();
scanf("%c",&stu[i].ganbu);
getchar();
scanf("%c",&stu[i].west);
getchar();
scanf("%d",&stu[i].paper);
}
for(i=0;i<n;i++){
if(stu[i].num1>80&&stu[i].paper>=1){stu[i].money=stu[i].money+8000;}
if(stu[i].num1>85&&stu[i].num2>80){stu[i].money=stu[i].money+4000;}
if(stu[i].num1>90){stu[i].money=stu[i].money+2000;}
if(stu[i].num1>85&&stu[i].west=='Y'){stu[i].money=stu[i].money+1000;}
if(stu[i].num2>80&&stu[i].ganbu=='Y'){stu[i].money=stu[i].money+850;}
}
for(i=0;i<n-1;i++){
for (j=0;j<n-1-i;j++){
if(stu[j].money<stu[j+1].money){
temp=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp;
}
}
}
for(i=0;i<n;i++)
sum=sum+stu[i].money;
printf("%s\n%d\n",stu[0].name,stu[0].money);
printf("%d",sum);
return 0;
}
| 39 |
19,186 | struct Student
{
char name[20];
int final;
int evaluate;
char office;
char west;
int paper;
int money;
struct Student *next;
};
int main()
{
struct Student *head,*p,*best;
head=(struct Student *)malloc(sizeof(struct Student));
p=head;
int N,i;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->final,&p->evaluate,&p->office,&p->west,&p->paper);
p->money=0;
if(p->final>80&&p->paper>0)
p->money+=8000;
if(p->final>85&&p->evaluate>80)
p->money+=4000;
if(p->final>90)
p->money+=2000;
if(p->final>85&&p->west=='Y')
p->money+=1000;
if(p->evaluate>80&&p->office=='Y')
p->money+=850;
p->next=(struct Student *)malloc(sizeof(struct Student));
p=p->next;
}
int all=0;
p=head;
best=head;
for(i=0;i<N;i++)
{
all+=p->money;
if(p->money>best->money)
{
best=p;
}
p=p->next;
}
printf("%s\n%d\n%d",best->name,best->money,all);
return 0;
}
| 39 |
19,187 | /*????????????????????????????????????????????
1) ????????8000??????????80??>80???????????1??1?????????????
2) ????????4000??????????85??>85????????????80??>80?????????
3) ????????2000??????????90??>90?????????
4) ????????1000??????????85??>85?????????????
5) ????????850??????????80??>80???????????
????????????????????????????????????????????????????????87??
??????82????????????????????????????????????????4850??
??????????????????????????????????????????????????
????
???????????N?1 ? N ? 100??????????????N????????????????????????????
??????????????????????????????????????????????????????20???????????
???????????????0?100????????0?100?????????????????????????????Y????N?????
???????0?10??????0?10????????????????????
????
?????????????????????????????????????????????????????????????
????????????????????????????N?????????????
????
4
YaoLin 87 82 Y N 0
ChenRuiyi 88 78 N Y 1
LiXin 92 88 N N 0
ZhangQin 83 87 Y N 1
????
ChenRuiyi
9000
28700*/
int main()
{
int n,i,sum[100],b[100],c[100],f[100],total=0,max=0,x=0;
char a[100][20],d[100],e[100];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i]>>b[i]>>c[i]>>d[i]>>e[i]>>f[i];
}
for(i=0;i<n;i++)
{
sum[i]=0;
if(b[i]>90)
{
sum[i]=sum[i]+2000;
}
if((c[i]>80)&&(d[i]=='Y'))
{
sum[i]=sum[i]+850;
}
if((b[i]>85)&&(e[i]=='Y'))
{
sum[i]=sum[i]+1000;
}
if((b[i]>85)&&(c[i]>80))
{
sum[i]=sum[i]+4000;
}
if((b[i]>80)&&(f[i]>=1))
{
sum[i]=sum[i]+8000;
}
total=total+sum[i];
if(sum[i]>max)
{
max=sum[i];
x=i;
}
}
cout<<a[x]<<endl;
cout<<max<<endl;
cout<<total<<endl;
return 0;
}
| 39 |
19,188 | int main()
{
struct student{
char name[20];
int a;
int b;
char s;
char x;
int e;
}stu[100];
int n,m[100]={0},max,total,i;
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].s,&stu[i].x,&stu[i].e);
for(i=0;i<n;i++)
{
if(stu[i].a>80&&stu[i].e>=1) m[i]+=8000;
if(stu[i].a>85&&stu[i].b>80) m[i]+=4000;
if(stu[i].a>90) m[i]+=2000;
if(stu[i].a>85&&stu[i].x=='Y') m[i]+=1000;
if(stu[i].b>80&&stu[i].s=='Y') m[i]+=850;
}
max=0;
total=m[0];
for(i=1;i<n;i++)
{
if(m[i]>m[max])
{
max=i;
}
total+=m[i];
}
printf("%s\n%d\n%d\n",stu[max].name,m[max],total);
return 0;
}
| 39 |
19,189 | struct student{
char name[20];
int scholar;
}stu[100];
int main(){
int n,i,j,total=0,final,class1,paper,maxid,maxscholar=0;
char t1[2],t2[2];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d%s%s%d",stu[i].name,&final,&class1,t1,t2,&paper);
if(final>80 && paper>=1)stu[i].scholar+=8000;
if(final>85 && class1>80)stu[i].scholar+=4000;
if(final>90)stu[i].scholar+=2000;
if(final>85 && t2[0]=='Y')stu[i].scholar+=1000;
if(class1>80 && t1[0]=='Y')stu[i].scholar+=850;
total+=stu[i].scholar;
if(maxscholar<stu[i].scholar){maxscholar=stu[i].scholar;maxid=i;}
}
printf("%s\n%d\n%d\n",stu[maxid].name,maxscholar,total);
}
| 39 |
19,190 | int main()
{
int n;
int i;
scanf("%d", &n);
struct student
{
char name[1000];
int final;
int clas;
char ganbu;
char west;
int paper;
}stu[1000];
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d", stu[i].name, &stu[i].final, &stu[i].clas, &stu[i].ganbu, &stu[i].west, &stu[i].paper);
}
int total[1000]={0};
for(i=1;i<=n;i++)
{
if(stu[i].final>80&&stu[i].paper>=1)
{
total[i]=total[i]+8000;
}
if(stu[i].final>85&&stu[i].clas>80)
{
total[i]=total[i]+4000;
}
if(stu[i].final>90)
{
total[i]=total[i]+2000;
}
if(stu[i].final>85&&stu[i].west=='Y')
{
total[i]=total[i]+1000;
}
if(stu[i].clas>80&&stu[i].ganbu=='Y')
{
total[i]=total[i]+850;
}
}
int max=total[1];
int sum=total[1];
int k;
for(i=2;i<=n;i++)
{
sum=sum+total[i];
if(total[i]>max)
{
max=total[i];
}
}
for(i=1;i<=n;i++)
{
if(total[i]==max)
{
printf("%s\n", stu[i].name);
break;
}
}
printf("%d\n", max);
printf("%d", sum);
return 0;
}
| 39 |
19,191 | void main()
{
int N,x[100][3],i,total[100]={0};
int T[100],s=0,k;
char y[100][2],z[100][20];
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%s %d %d %c %c %d",z[i],&x[i][0],&x[i][1],&y[i][0],&y[i][1],&x[i][2]);
for(i=0;i<N;i++)
{
if(x[i][0]>80 && x[i][2]>0) total[i]=total[i]+8000;
if(x[i][0]>85 && x[i][1]>80) total[i]=total[i]+4000;
if(x[i][0]>90) total[i]=total[i]+2000;
if(x[i][0]>85 && y[i][1]=='Y') total[i]=total[i]+1000;
if(x[i][1]>80 && y[i][0]=='Y') total[i]=total[i]+850;
s=s+total[i];
}
for(i=0;i<N;i++)
T[i]=total[i];
for(i=0;i<N-1;i++)
{
if(T[i]>T[i+1])
{
k=T[i];
T[i]=T[i+1];
T[i+1]=k;
}
}
for(i=0;i<N;i++)
if(total[i]==T[N-1])
{
printf("%s\n",z[i]);
printf("%d\n",total[i]);
printf("%d",s);
break;
}
} | 39 |
19,192 |
/*????????????????????????????????????????????
1) ????????8000??????????80??>80??
?????????1??1?????????????
2) ????????4000??????????85??>85??
??????????80??>80?????????
3) ????????2000??????????90??>90?
????????
4) ????????1000??????????85??>85?
????????????
5) ????????850??????????80??>80?
??????????
????????????????????????????????????????????????????????87????????82????????????????????????????????????????4850??
??????????????????????????????????????????????????
????
?????????????????????????????????????????????????????????????????????????????????????????N?????????????
????
4
YaoLin 87 82 Y N 0
ChenRuiyi 88 78 N Y 1
LiXin 92 88 N N 0
ZhangQin 83 87 Y N 1
????
ChenRuiyi
9000
28700
*/
struct student{
char name[30];
int qimo,banji;
char ganbu,xibu;
int lunwen;
int money;
};
int suan(struct student *s){
//1) ????????8000??????????80??>80??
//?????????1??1?????????????
int mon=0;
if (s->qimo >80&&s->lunwen>=1) mon+=8000;
// 2) ????????4000??????????85??>85??????????
//??80??>80?????????
if (s->qimo >85&&s->banji >80) mon+=4000;
// 3) ????????2000??????????90??>90?????????
if (s->qimo >90) mon+=2000;
//4) ????????1000??????????85??>85?????????????
if (s->qimo >85&&s->xibu =='Y') mon+=1000;
//5) ????????850??????????80??>80???????????
if (s->banji >80&&s->ganbu =='Y') mon+=850;
return mon;
}
int main()
{
long int n,sum=0;
int i;
char tmp;
struct student *stu,*max;
scanf("%d",&n);
stu=(struct student *)malloc(sizeof(struct student)*n);
for (i=0;i<n;i++){ //ChenRuiyi 88 78 N Y 1
scanf("%s%d%d%c%c%c%c%d",stu[i].name,&(stu[i].qimo),&(stu[i].banji),&tmp,&(stu[i].ganbu),&tmp,&(stu[i].xibu),&(stu[i].lunwen));
stu[i].money=suan(stu+i);
sum+=stu[i].money;
}
max=stu+n-1;
for (i=n-1;i>0;i--)
if (max->money<=stu[i].money) max=stu+i;
printf("%s\n%d\n%d\n",max->name,max->money,sum);
} | 39 |
19,193 | struct student
{
char name[20];
int mark[2];
char leader;
char west;
int paper;
int money;
}stu[100];
void main()
{
int n,i,j,max,sum=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].mark[0],&stu[i].mark[1],
&stu[i].leader,&stu[i].west,&stu[i].paper);
stu[i].money=0;
if (stu[i].mark[0]>80 && stu[i].paper>=1) stu[i].money+=8000;
if (stu[i].mark[0]>85 && stu[i].mark[1]>80) stu[i].money+=4000;
if (stu[i].mark[0]>90) stu[i].money+=2000;
if (stu[i].mark[0]>85 && stu[i].west=='Y') stu[i].money+=1000;
if (stu[i].mark[1]>80 && stu[i].leader=='Y') stu[i].money+=850;
sum+=stu[i].money;
}
max=stu[0].money;
for (i=1;i<n;i++)
{
if (stu[i].money>max) {max=stu[i].money;j=i;}
}
printf("%s\n%d\n",stu[j].name,stu[j].money);
printf("%d",sum);
} | 39 |
19,194 | struct student
{
char name[30];
int aver;
int judge;
char cadre;
char west;
int amount;
long prize;
struct student *next;
};
int n;
struct student *creat(int m)
{
struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %ld",p1->name,&p1->aver,&p1->judge,&p1->cadre,&p1->west,&p1->amount);
p1->prize=0;
head=NULL;
while(m--)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %ld",p1->name,&p1->aver,&p1->judge,&p1->cadre,&p1->west,&p1->amount);
p1->prize=0;
}
p2->next=NULL;
return(head);
}
void main()
{
struct student *head,*p1,*p2;
int m,max=0,sum=0;
scanf("%d",&m);
head=creat(m);
p1=p2=head;
while(p1)
{
if(p1->aver>80&&p1->amount>0)p1->prize+=8000;
if(p1->aver>85&&p1->judge>80)p1->prize+=4000;
if(p1->aver>90)p1->prize+=2000;
if(p1->aver>85&&p1->west=='Y')p1->prize+=1000;
if(p1->judge>80&&p1->cadre=='Y')p1->prize+=850;
p1=p1->next;
}
p1=head;
while(p1)
{
sum+=p1->prize;
if(p1->prize>max)max=p1->prize,p2=p1;
p1=p1->next;
}
printf("%s\n%d\n%d\n",p2->name,p2->prize,sum);
} | 39 |
19,195 | struct Node;
typedef struct Node *pNode;
struct Node
{
int av,py,thesis,sum;
char name[20],west,gb;
pNode next;
};
pNode create()
{
pNode p;
p=(pNode)malloc(sizeof(struct Node));
p->next=NULL;
return p;
}
int main()
{
int i,n,max,sum=0;
pNode q=NULL,p=NULL,head=NULL,maxn=NULL;
scanf("%d",&n);
head=create();
q=head;
for (i=1;i<=n;i++)
{p=(pNode)malloc(sizeof(struct Node));
if (p!=NULL)
{
scanf("%s %d %d %c %c %d",&(p->name),&(p->av),&(p->py),&(p->gb),&(p->west),&(p->thesis));
p->sum=0;
if (p->av>80&&p->thesis>0)
p->sum+=8000;
if (p->av>85&&p->py>80)
p->sum+=4000;
if (p->av>90)
p->sum+=2000;
if (p->av>85&&p->west=='Y')
p->sum+=1000;
if (p->py>80&&p->gb=='Y')
p->sum+=850;
p->next=NULL;
q->next=p;
sum+=p->sum;
q=p;
}
}
maxn=head->next;
p=head->next;
while(1)
{
if (p->sum>maxn->sum)
maxn=p;
if (p->next==NULL)
break;
p=p->next;
}
printf("%s\n%d\n%d", maxn->name,maxn->sum,sum);
return 0;
} | 39 |
19,196 | void main()
{
int n,i,j,k,t,yuanshi,wusi,chengji,xibu,banji;long sum=0;
struct st{
char name[23];
int score;
int essay;
int pingyi;
char area;
char position;
int money;
} stu[103];
struct st s;
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].position,&stu[i].area,&stu[i].essay);
for(i=0;i<n;i++)
{
yuanshi=0;
wusi=0;
chengji=0;
xibu=0;
banji=0;
if(stu[i].score>80&&stu[i].essay>0)
yuanshi=8000;
if(stu[i].score>85&&stu[i].pingyi>80)
wusi=4000;
if(stu[i].score>90)
chengji=2000;
if(stu[i].score>85&&stu[i].area=='Y')
xibu=1000;
if(stu[i].pingyi>80&&stu[i].position=='Y')
banji=850;
stu[i].money=yuanshi+wusi+chengji+xibu+banji;
}
for(i=0,sum=0;i<n;i++)
sum=sum+stu[i].money;
for(i=0;i<n;i++)
for(j=0;j<n-i;j++)
if(stu[i].money>stu[j].money)
{
s=stu[i];stu[i]=stu[j];stu[j]=s;
}
printf("%s\n%d\n%ld\n",stu[0].name,stu[0].money,sum);
}
| 39 |
19,197 |
int main(int argc, char* argv[])
{
int n,i,b=0,sum=0,max;
struct student{
char name[21];
int mc;
int bc;
char bg;
char xb;
int lw;
int sch;
}stu[100];
scanf("%d",&n);
for(i=0;i<n;i++){
stu[i].sch=0;
scanf("%s%d%d %c %c%d",&stu[i].name,&stu[i].mc,&stu[i].bc,&stu[i].bg,&stu[i].xb,&stu[i].lw);
if(stu[i].mc>80&&stu[i].lw>0){
stu[i].sch=8000;
sum+=8000;
}
if(stu[i].mc>85&&stu[i].bc>80){
stu[i].sch+=4000;
sum+=4000;
}
if(stu[i].mc>90){
stu[i].sch+=2000;
sum+=2000;
}
if(stu[i].mc>85&&stu[i].xb=='Y'){
stu[i].sch+=1000;
sum+=1000;
}
if(stu[i].bc>80&&stu[i].bg=='Y'){
stu[i].sch+=850;
sum+=850;
}
}
max=stu[0].sch;
for(i=0;i<n;i++){
if(max<stu[i].sch){
max=stu[i].sch;
b=i;
}
}
printf("%s\n%d\n%d\n",stu[b].name,stu[b].sch,sum);
return 0;
} | 39 |
19,198 | int main (){
int n;
scanf("%d",&n);
int i;
int sum=0,max=0;
char t[30];
for(i=0;i<n;i++){
char p[30],c,v;
int m,k,b,g=0,z=0;
scanf("%s %d %d %c %c %d",p,&m,&k,&c,&v,&b);
if(m>80&&b>=1) g=g+8000;
if(m>85&&k>80) g=g+4000;
if(m>90) g=g+2000;
if(m>85&&v=='Y') g=g+1000;
if(k>80&&c=='Y') g=g+850;
if(g>max){
max=g;
z=strlen(p);
for(int h=0;h<z;h++){
t[h]=p[h];
}
t[z]='\0';
}
else max=max;
sum=sum+g;
}
printf("%s\n%d\n%d",t,max,sum);
return 0;
}
| 39 |
19,199 | struct student
{
char name[20];
int score;
int value;
char cadre;
char west;
int paper;
int sum;
};
int deal(struct student stu)
{
stu.sum=0;
if(stu.score>80&&stu.paper>0)
stu.sum+=8000;
if(stu.score>85&&stu.value>80)
stu.sum+=4000;
if(stu.score>90)
stu.sum+=2000;
if(stu.score>85&&stu.west=='Y')
stu.sum+=1000;
if(stu.value>80&&stu.cadre=='Y')
stu.sum+=850;
return(stu.sum);
}
void main()
{
int n,i,total=0,top=0,t=0;
scanf("%d",&n);
struct student stu[100];
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].score,&stu[i].value,&stu[i].cadre,&stu[i].west,&stu[i].paper);
stu[i].sum=deal(stu[i]);total+=stu[i].sum;
if(stu[i].sum>top)
{top=stu[i].sum;t=i;}
}
printf("%s\n%d\n%d",stu[t].name,top,total);
}
| 39 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.