id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
19,200 | int main()
{
struct student
{char name[20];
int g1;
int g2;
char c;
char w;
int p;}stu[100];
int n,s[100],total=0,max=0,i;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d\n",&stu[i].name,&stu[i].g1,&stu[i].g2,&stu[i].c,&stu[i].w,&stu[i].p);
for(i=0;i<n;i++)
{ if(stu[i].g1>80&&stu[i].p>=1)s[i]=s[i]+8000;
if(stu[i].g1>85&&stu[i].g2>80)s[i]=s[i]+4000;
if(stu[i].g1>90)s[i]=s[i]+2000;
if(stu[i].g1>85&&stu[i].w=='Y')s[i]=s[i]+1000;
if(stu[i].g2>80&&stu[i].c=='Y')s[i]=s[i]+850;
total=total+s[i];}
for(i=1;i<n;i++)
if(s[i]>s[max])max=i;
printf("%s\n",stu[max].name);
printf("%d\n",s[max]);
printf("%d\n",total);
return 0;
}
| 39 |
19,201 | struct award
{
char name[20];
int score1;
int score2;
char leader;
char west;
int paper;
int money;
};
int main()
{
struct award stu[100];
struct award max;
int n,i,sum=0;
scanf("%d\n",&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].leader,&stu[i].west,&stu[i].paper);
}
for (i=0;i<n;i++)
{
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].west=='Y')
{
stu[i].money+=1000;
}
if (stu[i].score2>80 && stu[i].leader=='Y')
{
stu[i].money+=850;
}
sum+=stu[i].money;
}
max=stu[0];
for (i=1;i<n;i++)
{
if (stu[i].money>max.money)
{
max=stu[i];
}
}
puts(max.name);
printf("%d\n",max.money);
printf("%d\n",sum);
return 0;
} | 39 |
19,202 | main()
{
int n;
int i;
int j=0;
int s;
int all=0;
scanf("%d",&n);
struct student
{
char name[20];
int avg;
int cls;
char aso[2];
char wst[2];
int pap;
int mny;
};
struct student stu[101];
for(i=0;i<n;i++)
{
scanf("%s %d %d %s %s %d",stu[i].name,&stu[i].avg,&stu[i].cls,stu[i].aso,stu[i].wst,&stu[i].pap);
}
for(i=0;i<n;i++)
stu[i].mny=0;
for(i=0;i<n;i++)
{
if((stu[i].avg>80)&(stu[i].pap>=1))
stu[i].mny=stu[i].mny+8000;
if((stu[i].avg>85)&(stu[i].cls>80))
stu[i].mny=stu[i].mny+4000;
if(stu[i].avg>90)
stu[i].mny=stu[i].mny+2000;
if((stu[i].avg>85)&(stu[i].wst[0]=='Y'))
stu[i].mny=stu[i].mny+1000;
if((stu[i].cls>80)&(stu[i].aso[0]=='Y'))
stu[i].mny=stu[i].mny+850;
}
s=stu[0].mny;
for(i=1;i<n;i++)
{
if(stu[i].mny>s)
{
s=stu[i].mny;
j=i;
}
}
for(i=0;i<n;i++)
all=all+stu[i].mny;
printf("%s\n",stu[j].name);
printf("%d\n",s);
printf("%d",all);
} | 39 |
19,203 | struct student
{
char name[100];
int n1;
int n2;
char a;
char b;
int n3;
};
void main()
{
int N,i,j,s[101][6],max,k=0;
long int sum=0;
scanf("%d\n",&N);
struct student stu[101];
struct student *p;
for(p=stu;p<stu+N;p++)
{scanf("%s %d %d %c %c %d",p->name,&p->n1,&p->n2,&p->a,&p->b,&p->n3);}
for(i=0;i<N;i++)
for(j=0;j<6;j++)
{s[i][j]=0;}
for(i=0;i<N;i++)
{
if(stu[i].n1>80&&stu[i].n3>=1)
s[i][0]=8000;
if(stu[i].n1>85&&stu[i].n2>80)
s[i][1]=4000;
if(stu[i].n1>90)
s[i][2]=2000;
if(stu[i].n1>85&&stu[i].b=='Y')
s[i][3]=1000;
if(stu[i].n2>80&&stu[i].a=='Y')
s[i][4]=850;
}
for(i=0;i<N;i++)
for(j=4;j>=0;j--)
{s[i][5]=s[i][5]+s[i][j];}
max=s[0][5];
for(i=0;i<N;i++)
if(s[i][5]>max)
{max=s[i][5];k=i;}
printf("%s\n%d\n",stu[k].name,s[k][5]);
for(i=0;i<N;i++)
sum=sum+s[i][5];
printf("%ld\n",sum);
}
| 39 |
19,204 |
void main()
{
int N, i, num1[100]={0}, num2[100]={0}, scholar[100]={0}, x, y, sum;
char name[100][20], condition[100][7];
scanf("%d", &N);
for(i=0;i<N;i++){
scanf("%s%d%d", name[i], &num1[i], &num2[i]);
gets(condition[i]);
}
for(i=0;i<N;i++){
if((num1[i]>80) && (condition[i][5] != '0'))
scholar[i]+=8000;
if((num1[i]>85) && (num2[i]>80))
scholar[i]+=4000;
if(num1[i]>90)
scholar[i]+=2000;
if((num1[i]>85) && (condition[i][3] == 'Y'))
scholar[i]+=1000;
if((num2[i]>80) && (condition[i][1] == 'Y'))
scholar[i]+=850;
}
sum=scholar[0];
for(i=1;i<N;i++){
if(scholar[i]>x){
x=scholar[i];
y=i;
}
sum+=scholar[i];
}
printf("%s\n%d\n%d", name[y], x, sum);
}
| 39 |
19,205 |
int main()
{struct ship
{
char name[20],o,w;
int score,cla,paper,totle;
struct ship *next;
}n[100];
int T=0,N,i,m=0;char temp[20];
struct ship *head=&n[0],*p;
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-1;i++)
n[i].next=&n[i+1];
n[N-1].next=NULL;
for(i=0;i<N;i++) //scholarship for everyone//
{n[i].totle=0;
if(n[i].cla>80&&n[i].o=='Y') n[i].totle+=850;
if(n[i].score>85&&n[i].w=='Y') n[i].totle+=1000;
if(n[i].score>90) n[i].totle+=2000;
if(n[i].score>85&&n[i].cla>80) n[i].totle+=4000;
if(n[i].score>80&&n[i].paper) n[i].totle+=8000;}
for(i=0;i<N;i++) //sort the scholarships ; incresing//
if(n[m].totle<n[i].totle) m=i;
p=head;
do{
T+=p->totle;
p=p->next;} //T is the entire scholarship//
while(p!=NULL);
printf("%s\n%d\n%d",n[m].name,n[m].totle,T);
return 0;
} | 39 |
19,206 |
int main()
{
int n, qimo[100], banyi[100], lunwen[100];
char name[100][20], xuegan[100], xibu[100];
int sum[100], a, b = 0, i, result = 0;
scanf("%d", &n);
for(i = 0; i < n; i++){
sum[i] = 0;
scanf("%s %d %d %c %c %d", name[i], &qimo[i], &banyi[i], &xuegan[i], &xibu[i], &lunwen[i]);
}
for(i = 0; i < n; i++){
if((qimo[i] > 80)&&(lunwen[i] != 0)){
sum[i] += 8000;
}
if((qimo[i] > 85)&&(banyi[i] > 80)){
sum[i] += 4000;
}
if(qimo[i] > 90){
sum[i] += 2000;
}
if((qimo[i] > 85)&&(xibu[i] == 'Y')){
sum[i] += 1000;
}
if((banyi[i] > 80)&&(xuegan[i] == 'Y')){
sum[i] += 850;
}
}
for(i = 0; i < n; i++){
result += sum[i];
if(sum[i] > b){
b = sum[i];
a = i;
}
}
printf("%s\n%d\n%d\n", name[a], b, result);
return 0;
} | 39 |
19,207 | struct stu{
char name[20];
int s1;
int s2;
char gb;
char we;
int lw;
int jj;
}stu[100];
int main()
{
int n,i,s=0,max=0;
scanf("%d",&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].gb,&stu[i].we,&stu[i].lw);
for(i=0;i<n;i++){stu[i].jj=0;
if(stu[i].s1>80&&stu[i].lw>=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].we=='Y')
stu[i].jj+=1000;
if(stu[i].s2>80&&stu[i].gb=='Y')
stu[i].jj+=850;
s+=stu[i].jj;
if(stu[i].jj>max) max=stu[i].jj;
}
for(i=0;i<n;i++)
if(stu[i].jj==max){
printf("%s\n%d\n",stu[i].name,stu[i].jj);
break;
}
printf("%d",s);
return 0;
}
| 39 |
19,208 |
int main()
{
int N, i, final_g, class_g, nPapers;
int scholarship, max_s, sum;
char isCadre, isWest;
char buffer[21];
char name[21];
scanf("%d", &N);
sum = 0;
max_s = 0;
for (i=0; i<N; i++) {
scanf("%s %d %d %c %c %d", buffer, &final_g, &class_g, &isCadre, &isWest, &nPapers);
scholarship = 0;
if (final_g>80 && nPapers>0)
scholarship += 8000;
if (final_g>85 && class_g>80)
scholarship += 4000;
if (final_g>90)
scholarship += 2000;
if (final_g>85 && isWest=='Y')
scholarship += 1000;
if (class_g>80 && isCadre=='Y')
scholarship += 850;
if (scholarship > max_s) {
strcpy(name, buffer);
max_s = scholarship;
}
sum += scholarship;
}
printf("%s\n%d\n%d\n", name, max_s, sum);
return 0;
}
| 39 |
19,209 |
struct point
{
char a[20];
int x;
int y;
char xue;
char xi;
int z;
int sum;
};
int main(int argc, char* argv[])
{
int n,i,max=0,m=0,gong=0;
scanf("%d",&n);
struct point *s;
s=(struct point*)malloc(sizeof(struct point)*n);
for(i=0;i<n;i++)
{
s[i].sum=0;
scanf("%s %d %d %c %c %d",s[i].a,&s[i].x,&s[i].y,&s[i].xue,&s[i].xi,&s[i].z);
}
for(i=0;i<n;i++)
{
if(s[i].x>80&&s[i].z>=1) s[i].sum=s[i].sum+8000;
if(s[i].x>85&&s[i].y>80) s[i].sum=s[i].sum+4000;
if(s[i].x>90) s[i].sum=s[i].sum+2000;
if(s[i].x>85&&s[i].xi=='Y') s[i].sum=s[i].sum+1000;
if(s[i].y>80&&s[i].xue=='Y') s[i].sum=s[i].sum+850;
}
for(i=0;i<n;i++)
{
if(s[i].sum>max)
{max=s[i].sum;m=i;}
}
printf("%s\n",s[m].a);
printf("%d\n",max);
for(i=0;i<n;i++)
{
gong=gong+s[i].sum;
}
printf("%d\n",gong);
free (s);
return 0;
}
| 39 |
19,210 | struct Aw{
char na[20];
int ft,ct,tn,sum;
char po,ho;
}st[];
int main()
{
int n,i,j=0,m,sum=0;
char a,b;
scanf("%d",&n);
struct Aw*st=(struct Aw*)malloc(sizeof(struct Aw)*n);
for(i=0;i<n;i++){
scanf("%s%d%d%c%c%c%c%d",st[i].na,&st[i].ft,&st[i].ct,&a,&st[i].po,&b,&st[i].ho,&st[i].tn);
st[i].sum=0;
}
for(i=0;i<n;i++){
if(st[i].ft>80&&st[i].tn>0){
st[i].sum+=8000;
sum+=8000;
}
if(st[i].ft>85&&st[i].ct>80){
st[i].sum+=4000;
sum+=4000;
}
if(st[i].ft>90){
st[i].sum+=2000;
sum+=2000;
}
if(st[i].ft>85&&st[i].ho=='Y'){
st[i].sum+=1000;
sum+=1000;
}
if(st[i].ct>80&&st[i].po=='Y'){
st[i].sum+=850;
sum+=850;
}
}
for(i=0;i<n;i++){
if(st[i].sum>j){
j=st[i].sum;
m=i;
}
}
printf("%s\n%d\n%d\n",st[m].na,st[m].sum,sum);
free(st);
return 0;
} | 39 |
19,211 | struct stu
{char name[20];
int score1;
int score2;
char leader;
char west;
int paper;
}stu[100];
void main()
{
int n,i,a[100]={0},max=0,sum=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].leader,&stu[i].west,&stu[i].paper);
for(i=0;i<n;i++)
{
if(stu[i].score1>80&&stu[i].paper>0) a[i]+=8000;
if(stu[i].score1>85&&stu[i].score2>80) a[i]+=4000;
if(stu[i].score1>90) a[i]+=2000;
if(stu[i].score1>85&&stu[i].west=='Y') a[i]+=1000;
if(stu[i].score2>80&&stu[i].leader=='Y') a[i]+=850;
}
for(i=0;i<n;i++)
{
max=(max>=a[i])?max:a[i];
sum+=a[i];
}
for(i=0;i<n;i++)
{
if(a[i]==max)
{printf("%s\n%d\n",stu[i].name,a[i]);
break;}
}
printf("%d",sum);
} | 39 |
19,212 | struct scholarship
{
char name[21];
int test;
int judge;
char job;
char west;
int paper;
int sum;
};
int main()
{
int i=0,k=0,n=0,total=0;
struct scholarship data[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",data[i].name,&data[i].test,&data[i].judge,&data[i].job,&data[i].west,&data[i].paper);
}
for (i=0;i<n;i++)
{
data[i].sum=0;
if ((data[i].test>80)&&(data[i].paper>=1)) { data[i].sum=data[i].sum+8000; total=total+8000;}
if ((data[i].test>85)&&(data[i].judge>80)) { data[i].sum=data[i].sum+4000; total=total+4000;}
if (data[i].test>90) { data[i].sum=data[i].sum+2000; total=total+2000;}
if ((data[i].test>85)&&(data[i].west=='Y')) { data[i].sum=data[i].sum+1000; total=total+1000;}
if ((data[i].judge>80)&&(data[i].job=='Y')) { data[i].sum=data[i].sum+850; total=total+850;}
}
for (i=1,k=0;i<n;i++)
{
if (data[k].sum<data[i].sum) k=i;
}
printf("%s\n%d\n%d\n",data[k].name,data[k].sum,total);
return 0;
}
| 39 |
19,213 |
int main()
{
int n,i,max,zong;
char name[200][30];
int qimo[200];
int ban[200];
int sum[200];
char gan[200];
char xi[200];
int lun[200];
scanf("%d",&n);
zong=0;
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",name[i],&qimo[i],&ban[i],&gan[i],&xi[i],&lun[i]);
sum[i]=0;
if(qimo[i]>80)
{
if(lun[i]>=1)
{
sum[i]+=8000;
}
}
if(gan[i]=='Y'&&ban[i]>80)
sum[i]+=850;
if(qimo[i]>85)
{
if(ban[i]>80)
{
sum[i]+=4000;
}
if(xi[i]=='Y')
{
sum[i]+=1000;
}
}
if(qimo[i]>90)
{
sum[i]+=2000;
}
zong+=sum[i];
}
max=0;
for(i=0;i<n;i++)
{
if(sum[max]<sum[i])
{
max=i;
}
}
printf("%s\n%d\n",name[max],sum[max]);
printf("%d",zong);
return 0;
}
| 39 |
19,214 | struct student
{
int avescore,classscore,paper,money;
char name[21],lead[2],west[2];
}stu[100];
main()
{
int n,i,max=0,money=0;
char output[21];
scanf("%d",&n);
for(i=0;i<n;i++)
{
stu[i].money=0;
scanf("%s%d%d%s%s%d",&stu[i].name,&stu[i].avescore,&stu[i].classscore,&stu[i].lead,&stu[i].west,&stu[i].paper);
if(stu[i].avescore>80&&stu[i].paper>=1)
{
stu[i].money+=8000;
}
if(stu[i].avescore>85&&stu[i].classscore>80)
{
stu[i].money+=4000;
}
if(stu[i].avescore>90)
{
stu[i].money+=2000;
}
if(stu[i].avescore>85&&stu[i].west[0]=='Y')
{
stu[i].money+=1000;
}
if(stu[i].classscore>80&&stu[i].lead[0]=='Y')
{
stu[i].money+=850;
}
money+=stu[i].money;
if(max<stu[i].money)
{
max=stu[i].money;
strcpy(output,stu[i].name);
}
}
printf("%s\n%d\n%d\n",output,max,money);
return 0;
} | 39 |
19,215 |
int main()
{
int total=0,i,n,max=0;
char maxname[20];
struct
{
int a,b,c,sum;
char name[20];
char west,office;
}student[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",student[i].name,&student[i].a,&student[i].b,&student[i].office,&student[i].west,&student[i].c);
student[i].sum=0;
}
for(i=0;i<n;i++)
{
if(student[i].a>80&&student[i].c>=1)
{
student[i].sum+=8000;
total+=8000;
}
if(student[i].a>85&&student[i].b>80)
{
student[i].sum+=4000;
total+=4000;
}
if(student[i].a>90)
{
student[i].sum+=2000;
total+=2000;
}
if(student[i].west=='Y'&&student[i].a>85)
{
student[i].sum+=1000;
total+=1000;
}
if(student[i].office=='Y'&&student[i].b>80)
{
student[i].sum+=850;
total+=850;
}
}
for(i=0;i<n;i++)
{
if(student[i].sum>max)
{
max=student[i].sum;
strcpy(maxname,student[i].name);
}
}
printf("%s\n%d\n%d",maxname,max,total);
return 0;
} | 39 |
19,216 | struct list{
char name[30];
int final,ave,article;
char member,west;
long sum;
struct list *next;
};
int n=0;
int num;
long total=0;
char namemax[30];
long max=0;
struct list *creat(int n)
{
struct list *p1,*p2,*head;
int i;
head=(struct list*)malloc(sizeof(struct list));
p1=(struct list*)malloc(sizeof(struct list));
head->next=p1;
p1->next=NULL;
p1->sum=0;
scanf("%s %d %d %c %c %d\n",p1->name,&p1->final,&p1->ave,&p1->member,&p1->west,&p1->article);
if(p1->final>80 && p1->article>=1)p1->sum+=8000;
if(p1->final>85 && p1->ave>80)p1->sum+=4000;
if(p1->final>90)p1->sum+=2000;
if(p1->final>85 && p1->west=='Y')p1->sum+=1000;
if(p1->ave>80 && p1->member=='Y')p1->sum+=850;
total=total+p1->sum;
max=p1->sum;
for(i=1;i<n;i++)
{
p2=p1;
p1=(struct list*)malloc(sizeof(struct list));
scanf("%s %d %d %c %c %d\n",p1->name,&p1->final,&p1->ave,&p1->member,&p1->west,&p1->article);
if(p1->final>80 && p1->article>=1)p1->sum+=8000;
if(p1->final>85 && p1->ave>80)p1->sum+=4000;
if(p1->final>90)p1->sum+=2000;
if(p1->final>85 && p1->west=='Y')p1->sum+=1000;
if(p1->ave>80 && p1->member=='Y')p1->sum+=850;
total=total+p1->sum;
if(p1->sum>max){max=p1->sum;strcpy(namemax,p1->name);}
p2->next=p1;
}
p1->next=NULL;
return head;
}
int main()
{
struct list *head,*p;
scanf("%d\n",&n);
head=creat(n);
printf("%s\n%d\n%d\n",namemax,max,total);
return 0;
}
| 39 |
19,217 | struct student
{
char name [20];
int s1;
int s2;
char g;
char x;
int m;
int sum;
} stu[100];
main()
{
int p[100]={0};
int i=0,j=0,n,h=0,G=0;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
stu[i].sum=0;
scanf ("%s %d %d %c %c %d",stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].g,&stu[i].x,&stu[i].m);
if (stu[i].s1>80&&stu[i].m>=1) stu[i].sum=stu[i].sum+8000;
if (stu[i].s1>85&&stu[i].s2>80) stu[i].sum=stu[i].sum+4000;
if (stu[i].s1>90) stu[i].sum=stu[i].sum+2000;
if (stu[i].s1>85&&stu[i].x=='Y') stu[i].sum=stu[i].sum+1000;
if (stu[i].s2>80&&stu[i].g=='Y') stu[i].sum=stu[i].sum+850;
p[i]=stu[i].sum;
G=G+p[i];
}
for (j=0;j<n-1;j++)
for (i=0;i<n-1-j;i++)
if (stu[i].sum>stu[i+1].sum)
{
h=stu[i].sum;
stu[i].sum=stu[i+1].sum;
stu[i+1].sum=h;
}
for (i=0;i<n;i++)
{
if (p[i]== stu[n-1].sum)
{
printf ("%s\n%d\n%d\n",stu[i].name,p[i],G);
break;
}
}
} | 39 |
19,218 | struct student
{
char name[20];
int final;
int ping;
char gan;
char xi;
int paper;
int money;
struct student *next;
};
void main()
{
int n,i=0,max=0,sum=0;
scanf("%d",&n);
struct student *head,*p,*x;
head=p=(struct student *)malloc(sizeof(struct student));
(*p).money=0;
while(i++<n)
{
scanf("%s %d %d %c %c %d",(*p).name,&(*p).final,&(*p).ping,&(*p).gan,&(*p).xi,&(*p).paper);
if((*p).final>80&&(*p).paper>0)(*p).money+=8000;
if((*p).final>85&&(*p).ping>80)(*p).money+=4000;
if((*p).final>90)(*p).money+=2000;
if((*p).final>85&&(*p).xi=='Y')(*p).money+=1000;
if((*p).ping>80&&(*p).gan=='Y')(*p).money+=850;
if((*p).money>max){max=(*p).money;x=p;}
sum+=(*p).money;
p=(*p).next=(struct student *)malloc(sizeof(struct student));
(*p).money=0;
}
printf("%s\n%d\n%d\n",(*x).name,max,sum);
} | 39 |
19,219 | int main()
{
struct student
{
char name[100];
int qimo;
int banji;
char isGanbu[1];
char isWest[1];
int paper;
int money;
};
struct student a[1000];
int n, i, max, maxnum, sum;
scanf("%d", &n);
for(i = 0; i < n; i++)
{
a[i].money = 0;
scanf("%s", a[i].name);
scanf("%d%d%s%s%d", &a[i].qimo, &a[i].banji, a[i].isGanbu, a[i].isWest, &a[i].paper);
if(a[i].qimo > 80 && a[i].paper > 0)
a[i].money += 8000;
if(a[i].qimo > 85 && a[i].banji > 80)
a[i].money += 4000;
if(a[i].qimo > 90)
a[i].money += 2000;
if(a[i].qimo > 85 && a[i].isWest[0] == 'Y')
a[i].money += 1000;
if(a[i].banji > 80 && a[i].isGanbu[0] == 'Y')
a[i].money +=850;
}
max = 0;
sum = 0;
for(i = 0; i < n; i++)
{
if(a[i].money > max)
{
max = a[i].money;
maxnum = i;
}
}
for(i = 0; i < n; i++)
sum += a[i].money;
printf("%s\n",a[maxnum].name);
printf("%d\n%d", max, sum);
return 0;
} | 39 |
19,220 | struct student{
char name[20];
int num[6];
char xx[3];
int sum;
}stu[1000];
char cc[10];
int main(){
int t,k,x[10000]={0},n,min=10000,max=0,min1=0,max1=0,a=0,b,c,d,i,j,tp,sum1=0;
scanf("%d",&n);
scanf("%c",&cc[1]);
for(i=1;i<=n;i++){
scanf("%s%c%d%c%d",stu[i].name,&cc[1],&stu[i].num[1],&cc[2],&stu[i].num[2]);
scanf("%c%c%c%c%c%d%c",&cc[1],&stu[i].xx[1],&cc[2],&stu[i].xx[2],&cc[3],&stu[i].num[3],&cc[6]);
stu[i].sum=0;
if(stu[i].num[1]>80&&stu[i].num[3]>=1)stu[i].sum+=8000;
if(stu[i].num[1]>85&&stu[i].num[2]>80)stu[i].sum+=4000;
if(stu[i].num[1]>90)stu[i].sum+=2000;
if(stu[i].num[1]>85&&stu[i].xx[2]=='Y')stu[i].sum+=1000;
if(stu[i].num[2]>80&&stu[i].xx[1]=='Y')stu[i].sum+=850;
sum1+=stu[i].sum;
if(stu[i].sum>max){
max=stu[i].sum;
max1=i;
}
}
printf("%s\n%d\n%d",stu[max1].name,stu[max1].sum,sum1);
}
| 39 |
19,221 | int main()
{
int N;
scanf("%d",&N);
struct std
{
char name[21];
int pin;
int yi;
char gan;
char west;
int n;
}std[100];
int i;
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",std[i].name,&std[i].pin,&std[i].yi,&std[i].gan,&std[i].west,&std[i].n);
}
int sum[100];
for(i=0;i<N;i++)
sum[i]=0;
for(i=0;i<N;i++)
{
if(std[i].pin>80&&std[i].n>0)
sum[i]+=8000;
if(std[i].pin>85&&std[i].yi>80)
sum[i]+=4000;
if(std[i].pin>90)
sum[i]+=2000;
if(std[i].pin>85&&std[i].west=='Y')
sum[i]+=1000;
if(std[i].yi>80&&std[i].gan=='Y')
sum[i]+=850;
}
int max=sum[0],k=0,he=sum[0];
for(i=1;i<N;i++)
{
he+=sum[i];
if(max<sum[i])
{
max=sum[i];
k=i;
}
}
printf("%s\n",std[k].name);
printf("%d\n",max);
printf("%d\n",he);
return 0;
}
| 39 |
19,222 | struct stu
{
char name[20];
int qm;
int bj;
char bgb;
char xb;
int lw;
int sum;
};
int main()
{
int n,i,max=0,SUM=0;
struct stu xs[100],b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",xs[i].name);
getchar();
scanf("%d %d %c %c %d",&xs[i].qm,&xs[i].bj,&xs[i].bgb,&xs[i].xb,&xs[i].lw);
xs[i].sum=0;
if(xs[i].qm>80&&xs[i].lw>0) xs[i].sum=xs[i].sum+8000;
if(xs[i].qm>85&&xs[i].bj>80) xs[i].sum+=4000;
if(xs[i].qm>90)
xs[i].sum+=2000;
if(xs[i].qm>85&&xs[i].xb=='Y')
xs[i].sum+=1000;
if(xs[i].bj>80&&xs[i].bgb=='Y')
xs[i].sum+=850;
SUM+=xs[i].sum;
if(xs[i].sum>max)
{
max=xs[i].sum;
b=xs[i];
}
}
printf("%s\n%d\n%d",b.name,max,SUM);
return 0;
} | 39 |
19,223 | struct file
{
char name[50];
int exam;
int judge;
char worker;
char west;
int paper;
int scholarship;
};
int yuanshi(int exam,int paper)
{
if(exam>80&&paper>=1)
{
return 1;
}
else
{
return 0;
}
}
int wusi(int exam,int judge)
{
if(exam>85&&judge>80)
{
return 1;
}
else
{
return 0;
}
}
int chengji(int exam)
{
if(exam>90)
{
return 1;
}
else
{
return 0;
}
}
int xibu(int exam,char west)
{
if(exam>85&&west=='Y')
{
return 1;
}
else
{
return 0;
}
}
int banji(int judge,char worker)
{
if(judge>80&&worker=='Y')
{
return 1;
}
else
{
return 0;
}
}
void main()
{
struct file a[110];
int i,n,sum=0,max=0,orient;
for(i=1;i<=110;i++)
{
a[i-1].scholarship=0;
}
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&a[i].name,&a[i].exam,&a[i].judge,&a[i].worker,&a[i].west,&a[i].paper);
if(yuanshi(a[i].exam,a[i].paper))
{
a[i].scholarship+=8000;
}
if(wusi(a[i].exam,a[i].judge))
{
a[i].scholarship+=4000;
}
if(chengji(a[i].exam))
{
a[i].scholarship+=2000;
}
if(xibu(a[i].exam,a[i].west))
{
a[i].scholarship+=1000;
}
if(banji(a[i].judge,a[i].worker))
{
a[i].scholarship+=850;
}
sum+=a[i].scholarship;
}
for(i=1;i<=n;i++)
{
if(a[i].scholarship>max)
{
max=a[i].scholarship;
orient=i;
}
}
printf("%s\n%d\n%d",a[orient].name,max,sum);
} | 39 |
19,224 | int N;
struct student
{
char name[20];
float score1;
float score2;
char c1;
char c2;
int paper;
int money;
struct student*next;
};
void mon(struct student*p)
{
p->money=0;
if(p->score1>80&&p->paper>0)
{
p->money+=8000;
}
if(p->score1>85&&p->score2>80)
{
p->money+=4000;
}
if(p->score1>90)
{
p->money+=2000;
}
if(p->score1>85&&p->c2=='Y')
{
p->money+=1000;
}
if(p->score2>80&&p->c1=='Y')
{
p->money+=850;
}
}
struct student*creat()
{
int i=1;
struct student*head,*p1,*p2;
p1=(struct student*)malloc(LEN);
scanf("%s %f %f %c %c %d",p1->name,&p1->score1,&p1->score2,&p1->c1,&p1->c2,&p1->paper);
mon(p1);
p1->next=NULL;
head=p1;
p2=p1;
do
{
if(i>=N)
{
break;
}
else
{
p1=(struct student*)malloc(LEN);
scanf("%s %f %f %c %c %d",p1->name,&p1->score1,&p1->score2,&p1->c1,&p1->c2,&p1->paper);
mon(p1);
p1->next=NULL;
p2->next=p1;
p2=p1;
i++;
}
}while(1);
return(head);
}
void print(struct student*head)
{
int total=0,max=0;
struct student*p,*pmax;
p=head;
do
{
total+=p->money;
if(p->money>max)
{
pmax=p;
max=p->money;
}
p=p->next;
}while(p);
printf("%s\n%d\n",pmax->name,max);
printf("%d",total);
}
int main()
{
int total;
struct student*head;
scanf("%d",&N);
head=creat();
print(head);
}
| 39 |
19,225 | int main()
{
struct{
char t[20],a[2],b[2];
int m,n,p,g;
}k[100],q;
int c,i,j,sum=0;
scanf("%d",&c);
for(i=0;i<c;i++)
{
k[i].g=0;
scanf("%s%d%d%s%s%d",k[i].t,&k[i].m,&k[i].n,k[i].a,k[i].b,&k[i].p);
if(k[i].m>80&&k[i].p>=1)
k[i].g+=8000;
if(k[i].m>85&&k[i].n>80)
k[i].g+=4000;
if(k[i].m>90)
k[i].g+=2000;
if(k[i].m>85&&k[i].b[0]=='Y')
k[i].g+=1000;
if(k[i].n>80&&k[i].a[0]=='Y')
k[i].g+=850;
}
for(i=0;i<c;i++)
{
sum+=k[i].g;
}
for(i=0;i<c;i++)
{
for(j=c-1;j>i;j--)
{
if(k[j].g>k[j-1].g)
{
q=k[j];
k[j]=k[j-1];
k[j-1]=q;
}
}
}
printf("%s\n%d\n%d",k[0].t,k[0].g,sum);
return 0;
}
| 39 |
19,226 | int main()
{
int n,i,total=0,max=0,maxi=0;
struct list{
char name[20];
int score;
int rate;
char leader;
char west;
int pap;
int schol;
};
struct list *start,*p1;
scanf("%d",&n);
getchar();
start=(struct list*)calloc(n,sizeof(struct list));
p1=start;
for(i=0;i<n;i++){
scanf("%s", &(p1->name) );
scanf("%d %d %c %c %d", &(p1->score), &(p1->rate), &(p1->leader), &(p1->west), &(p1->pap));
getchar();
p1 -> schol=0;
if( p1->score > 80 && p1->pap > 0 )
p1->schol += 8000;
if( p1->score > 85 && p1->rate > 80 )
p1->schol += 4000;
if( p1->score > 90 )
p1->schol += 2000;
if( p1->score > 85 && p1->west == 'Y' )
p1->schol += 1000;
if( p1->rate > 80 && p1->leader == 'Y' )
p1->schol += 850;
total += p1->schol;
if( p1->schol > max ){
max=p1->schol;
maxi=i;
}
p1++;
}
printf("%s\n%d\n%d\n", (start+maxi) -> name, (start+maxi) -> schol, total);
return 0;
} | 39 |
19,227 | struct Student
{char name[20];
int a;
int b;
char c;
char d;
int e;
int f;
};
int main()
{
int n,i,k,m,t;
scanf ("%d",&n);
struct Student stu[200];
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);
stu[i].f=0;
}
for (i=0,m=0;i<n;i++)
{
if (stu[i].a>80&&stu[i].e>0)
stu[i].f=stu[i].f+8000;
if (stu[i].a>85&&stu[i].b>80)
stu[i].f=stu[i].f+4000;
if (stu[i].a>90)
stu[i].f=stu[i].f+2000;
if (stu[i].a>85&&stu[i].d=='Y')
stu[i].f=stu[i].f+1000;
if (stu[i].b>80&&stu[i].c=='Y')
stu[i].f=stu[i].f+850;
if (stu[i].f>m)
{
m=stu[i].f;
t=i;
}
}
for (i=0,k=0;i<n;i++)
k=k+stu[i].f;
printf ("%s\n%d\n%d\n",stu[t].name,m,k);
return 0;
}
| 39 |
19,228 | void main()
{
struct student
{
char name[50];
int score1;
int score2;
char master;
char west;
int paper;
};
struct student stu[100];
int i,n,sum[100]={0},total,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].master,&stu[i].west,&stu[i].paper);
for(i=0;i<n;i++)
{
if(stu[i].score1>80&&stu[i].paper>0)sum[i]=sum[i]+8000;
if(stu[i].score1>85&&stu[i].score2>80)sum[i]=sum[i]+4000;
if(stu[i].score1>90)sum[i]=sum[i]+2000;
if(stu[i].score1>85&&stu[i].west==89)sum[i]=sum[i]+1000;
if(stu[i].score2>80&&stu[i].master==89)sum[i]=sum[i]+850;
}
for(i=0,max=sum[0],total=0;i<n;i++)
{
if(sum[i]>=max)max=sum[i];
total+=sum[i];
}
for(i=0;i<n;i++)
{
if(sum[i]==max){
printf("%s\n",stu[i].name);
break;}
}
printf("%d\n",max);
printf("%d\n",total);
} | 39 |
19,229 | struct person{
char pname[30];
int s1,s2,s3;
char c1,c2;
int money;
};
int main(){
struct person p[100];
int n,m,i,j,k;
long tot;
for(i=0;i<100;i++){
p[i].s1=0;
p[i].s2=0;
p[i].s3=0;
p[i].money=0;
}
scanf("%d",&n);
k=0;
tot=0;
for(i=0;i<n;i++){
scanf("%s%d%d %c %c %d",p[i].pname,&p[i].s1,&p[i].s2,&p[i].c1,&p[i].c2,&p[i].s3);
if(p[i].s1>80&&p[i].s3>=1)
p[i].money+=8000;
if(p[i].s1>85&&p[i].s2>80)
p[i].money+=4000;
if(p[i].s1>90)
p[i].money+=2000;
if(p[i].s1>85&&p[i].c2=='Y')
p[i].money+=1000;
if(p[i].s2>80&&p[i].c1=='Y')
p[i].money+=850;
tot+=p[i].money;
if(p[i].money>p[k].money)
k=i;
}
printf("%s\n%d\n%d\n",p[k].pname,p[k].money,tot);
return 0;
}
| 39 |
19,230 | void main()
{
int n,qimo[100],banji[100],lunwen[100];
int i,j;int jiangxuejing[100];int sunxu[100];
char xingming[100][20],ganbu[100],xibu[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",xingming[i],&qimo[i],&banji[i],&ganbu[i],&xibu[i],&lunwen[i]);
sunxu[i]=i;
}
for(i=0;i<=n-1;i++)
{
int a=0,b=0,c=0,d=0,e=0;
if(qimo[i]>80&&lunwen[i]>=1)
{a=a+1;}
if(qimo[i]>85&&banji[i]>80)
{b=b+1;}
if(qimo[i]>90)
{c=c+1;}
if(qimo[i]>85&&xibu[i]=='Y')
{d=d+1;}
if(banji[i]>80&&ganbu[i]=='Y')
{e=e+1;}
jiangxuejing[i]=a*8000+b*4000+c*2000+d*1000+e*850;
}
int t,k,p;char c;
for(i=0;i<=n-2;i++)
for(j=0;j<=n-2-i;j++)
{
if(jiangxuejing[j]<jiangxuejing[j+1])
{
t=jiangxuejing[j];
jiangxuejing[j]=jiangxuejing[j+1];
jiangxuejing[j+1]=t;
p=sunxu[j];
sunxu[j]=sunxu[j+1];
sunxu[j+1]=p;
for(k=0;k<=19;k++)
{
c=xingming[j][k];
xingming[j][k]=xingming[j+1][k];
xingming[j+1][k]=c;
}
}
}
int max=0;
for(i=0;i<=n-1;i++)
{
if(jiangxuejing[i]>max)
{max=jiangxuejing[i];}
}
int jishuqi=0;
for(j=0;j<=n-1;j++)
{
if(jiangxuejing[j]==max)
{jishuqi=jishuqi+1;}
}
int m=0;
for(i=0;i<=n-1;i++)
{m=m+jiangxuejing[i];}
if(jishuqi==1)
{
printf("%s\n",xingming[0]);
printf("%d\n",jiangxuejing[0]);
printf("%d\n",m);
}
if(jishuqi>1)
{
for(i=0;i<=jishuqi-2;i++)
for(j=0;j<=jishuqi-2-i;j++)
{
if(sunxu[j]>sunxu[j+1])
{
t=sunxu[j];
sunxu[j]=sunxu[j+1];
sunxu[j+1]=t;
for(k=0;k<=99;k++)
{
c=xingming[j][k];
xingming[j][k]=xingming[j+1][k];
xingming[j+1][k]=c;
}
}
}
printf("%s\n",xingming[0]);
printf("%d\n",jiangxuejing[0]);
printf("%d\n",m);
}
} | 39 |
19,231 | void main()
{
int n,w,c[2],i,j,max,total,no;
char a1,a2,s[20],t[20];
scanf("%d",&n);
total=0;
max=0;
for(i=0;i<n;i++)
{
w=0;
scanf("%s %d %d %c %c %d",s,&c[0],&c[1],&a1,&a2,&no);
if(c[0]>80&&no>0) w=w+8000;
if(c[0]>85&&c[1]>80) w=w+4000;
if(c[0]>90) w=w+2000;
if(c[0]>85&&a2=='Y') w=w+1000;
if(c[1]>80&&a1=='Y') w=w+850;
total=total+w;
if(w>max)
{
max=w;
strcpy(t,s);
}
}
printf("%s\n%d\n%d\n",t,max,total);
} | 39 |
19,232 | int main()
{
int i,n,sum=0;
scanf("%d",&n);
typedef struct{
char name[20];
char ganbu;
char xibu;
int qimo;
int qizhong;
int lunwen;
int money;
}jiangxuejin;
jiangxuejin a[100];
jiangxuejin *p,*max;
max=a;
for(p=a;p<a+n;p++)
{
p->money=0;
scanf("%s %d %d %c %c %d",&p->name,&p->qimo,&p->qizhong,&p->ganbu,&p->xibu,&p->lunwen);
if((p->qimo>80)&&(p->lunwen>=1))
(p->money)+=8000;
if((p->qimo>85)&&(p->qizhong>80))
(p->money)+=4000;
if(p->qimo>90)
(p->money)+=2000;
if((p->qimo>85)&&(p->xibu=='Y'))
(p->money)+=1000;
if((p->qizhong>80)&&(p->ganbu=='Y'))
(p->money)+=850;
if(p->money>max->money)
max=p;
sum+=p->money;
}
printf("%s\n%d\n%d",max->name,max->money,sum);
} | 39 |
19,233 |
struct asd
{
char str[21];
int a;
int b;
int c;
int sum;
char x;
char y;
}stu[100];
void main()
{
int i,n,max,m,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d", stu[i].str, &stu[i].a, &stu[i].b, &stu[i].x, &stu[i].y, &stu[i].c);
stu[i].sum=0;
}
for(i=0;i<n;i++)
{
if(stu[i].a>80 && stu[i].c>0)
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].y=='Y')
stu[i].sum+=1000;
if(stu[i].b>80 && stu[i].x=='Y')
stu[i].sum+=850;
}
m=0;
for(i=0;i<n;i++)
{
m+=stu[i].sum;
}
max=0;t=0;
for(i=0;i<n;i++)
{
if(stu[i].sum>max)
{max=stu[i].sum;t=i;}
}
printf("%s\n%d\n%d\n", stu[t].str, max, m);
} | 39 |
19,234 | main()
{
int n;
int max=0;
struct xinxi
{
char name[21];
int average;
int evaluate;
char ganbu;
char xibu;
int amount;
};
long sum=0;
struct xinxi stu[100];
char most[21];
int scholarship;
int i,j,k,s,p,q;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].average,&stu[i].evaluate,&stu[i].ganbu,&stu[i].xibu,&stu[i].amount);
scholarship=0;
if((stu[i].average>80)&&(stu[i].amount>0)) {scholarship+=8000;}
if((stu[i].average>85)&&(stu[i].evaluate>80)) {scholarship+=4000;}
if(stu[i].average>90) {scholarship+=2000;}
if((stu[i].average>85)&&(stu[i].xibu=='Y')) {scholarship+=1000;}
if((stu[i].evaluate>80)&&(stu[i].ganbu=='Y')) {scholarship+=850;}
sum+=scholarship;
if(scholarship>max)
{
strcpy(most,stu[i].name);
max=scholarship;
}
}
printf("%s\n%d\n%ld",most,max,sum);
getchar();
getchar();
}
| 39 |
19,235 |
int main(int argc, char *argv[])
{
int n,i,b[100],c[100],f[100],sum[100];
char a[100][50],d[100][1],e[100][1];
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%s%d%d%s%s%d", a[i], &b[i], &c[i], d[i], e[i], &f[i]);
}
for(i=0;i<n;i++){
sum[i]=0;
if((b[i]>80)&&(f[i]>0)){
sum[i]+=8000;
}
if((b[i]>85)&&(c[i]>80)){
sum[i]+=4000;
}
if(b[i]>90){
sum[i]+=2000;
}
if((b[i]>85)&&(e[i][0]=='Y')){
sum[i]+=1000;
}
if((c[i]>80)&&(d[i][0]=='Y')){
sum[i]+=850;
}
}
int s=sum[0],j=0,sum1=0;
for(i=0;i<n;i++){
if(sum[i]>s){
s=sum[i];
j=i;
}
sum1+=sum[i];
}
printf("%s\n", a[j]);
printf("%d\n", s);
printf("%d\n", sum1);
return 0;
}
| 39 |
19,236 | struct stu
{ char name[100];
int qm;
int py;
char gb;
char xb;
int lw;
int jj;
};
int a[101]={0};
int main()
{ void pai(struct stu s[],int n,int a[]);
struct stu s[101];
int i=0,n=0,sum=0;
char m[100]={'\0'};
for(i=0;i<101;i++)
{ strcpy(s[i].name,m);
s[i].qm=0;
s[i].py=0;
s[i].gb='\0';
s[i].xb='\0';
s[i].lw=0;
s[i].jj=0;
}
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s",s[i].name);
scanf("%d %d %c %c %d",&s[i].qm,&s[i].py,&s[i].gb,&s[i].xb,&s[i].lw);
if(s[i].qm>80&&s[i].lw>=1) s[i].jj=s[i].jj+8000;
if(s[i].qm>85&&s[i].py>80) s[i].jj=s[i].jj+4000;
if(s[i].qm>90) s[i].jj=s[i].jj+2000;
if(s[i].xb=='Y'&&s[i].qm>85) s[i].jj=s[i].jj+1000;
if(s[i].py>80&&s[i].gb=='Y') s[i].jj=s[i].jj+850;
sum=sum+s[i].jj;
a[i]=i;
}
pai(s,n,a);
printf("%s\n",s[a[0]].name);
printf("%d\n",s[a[0]].jj);
printf("%d",sum);
return(0);
}
void pai(struct stu s[],int n,int a[])
{ int t=0;
int i=0,j=0;
for(i=0;i<n;i++)
{for(j=0;j<n-i-1;j++)
{ if(s[a[j]].jj<s[a[j+1]].jj)
{ t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
} | 39 |
19,237 |
void main()
{
int n,i,j,sum=0;
struct student
{
char name[20];
int a;
int b;
char x;
char g;
int lun;
int money;
}stu[103];
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].g, &stu[i].x, &stu[i].lun);
stu[i].money=0;
}
for(i=0;i<n;i++)
{
if(stu[i].a>80&&stu[i].lun>0)
stu[i].money=stu[i].money+8000;
if(stu[i].a>85&&stu[i].b>80)
stu[i].money=stu[i].money+4000;
if(stu[i].a>90)
stu[i].money=stu[i].money+2000;
if(stu[i].a>85&&stu[i].x=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].b>80&&stu[i].g=='Y')
stu[i].money=stu[i].money+850;
sum=sum+stu[i].money;
}
for(j=1;j<n;j++)
{
for(i=0;i<n-j;i++)
{
if(stu[i].money<stu[i+1].money)
{
stu[102]=stu[i];
stu[i]=stu[i+1];
stu[i+1]=stu[102];
}
}
}
printf("%s\n",stu[0].name);
printf("%d\n",stu[0].money);
printf("%d\n",sum);
} | 39 |
19,238 |
int main()
{ char name[20],g,x,highestname[20];
int q[100],b[100],l[100],n,i,j,sum[100]={0},max=0,t,total=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",name,&q[i],&b[i],&g,&x,&l[i]);
if((q[i]>80)&&l[i]>=1){
sum[i]+=8000;
}
if(q[i]>85&&b[i]>80){
sum[i]+=4000;
}
if(q[i]>90){
sum[i]+=2000;
}
if(q[i]>85&&x=='Y'){
sum[i]+=1000;
}
if(b[i]>80&&g=='Y'){
sum[i]+=850;
}
total+=sum[i];
if(sum[i]>max){
max=sum[i];
t=i;
for (j=0;name[j]!='\0';j++){
highestname[j]=name[j];
}
highestname[j]='\0';
}
}
printf("%s\n%d\n%d\n",highestname,sum[t],total);
return 0;
} | 39 |
19,239 | struct information
{
char name[20];
int score;
int marks;
char banwei;
char xibu;
int lunwen;
int reward;
}a[101];
void main()
{
int n,i,k,sum=0,max=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].marks,&a[i].banwei,&a[i].xibu,&a[i].lunwen);
for(i=0;i<n;i++)
{
a[i].reward=0;
if(a[i].banwei=='Y' && a[i].marks>80) a[i].reward=a[i].reward+850;
if(a[i].score>80)
{
if(a[i].lunwen>0) a[i].reward=a[i].reward+8000;
if(a[i].score>85)
{
if(a[i].marks>80) a[i].reward=a[i].reward+4000;
if(a[i].xibu=='Y') a[i].reward=a[i].reward+1000;
if(a[i].score>90) a[i].reward=a[i].reward+2000;
}
}
if(a[i].reward>max)
{
max=a[i].reward;
k=i;
}
sum=sum+a[i].reward;
}
printf("%s\n%d\n%d\n",a[k].name,max,sum);
}
| 39 |
19,240 | char name[200][21];
int qmg[200];
int cg[200];
char gb[200];
char xb[200];
int lw[200];
int schsum[200];
int main(){
int n,i,num,whole;
char str1[21];
scanf("%d",&n);
for(i=0;i<n;i++){
int j;
char str2[21],x4,x5;
int x2,x3,x6;
scanf("%s %d %d %c %c %d",str2,&x2,&x3,&x4,&x5,&x6);
for (j=0;j<21;j++) name[i][j]=str2[j];
qmg[i]=x2;
cg[i]=x3;
gb[i]=x4;
xb[i]=x5;
lw[i]=x6;
//puts(str2);
}
for(i=0;i<n;i++){
schsum[i]=0;
if(qmg[i]>80&&lw[i]>=1) schsum[i]+=8000;
if(qmg[i]>85&&cg[i]>80) schsum[i]+=4000;
if(qmg[i]>90) schsum[i]+=2000;
if(xb[i]=='Y'&&qmg[i]>85) schsum[i]+=1000;
if(gb[i]=='Y'&&cg[i]>80) schsum[i]+=850;
}
num=0;
for(i=1;i<n;i++){
if (schsum[num]<schsum[i]) num=i;
}
for(i=0;i<21;i++) str1[i]=name[num][i];
puts(str1);
printf("%d\n" ,schsum[num]);
whole=0;
for(i=0;i<n;i++){
whole+=schsum[i];
}
printf("%d",whole);
//printf("%d %d %d %d" ,schsum[0],schsum[1],schsum[2],schsum[3]);
return 0;
}
| 39 |
19,241 | void main()
{
struct stu
{
char name[20];
int end;
int cls;
char lead;
char west;
int pap;
int sum;
}std[100];
int n,i,j,summ=0,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d %d %c %c %d",&std[i].name,&std[i].end,&std[i].cls,&std[i].lead,&std[i].west,&std[i].pap);
std[i].sum=0;
if((std[i].end>80)&&(std[i].pap>=1))SS=SS+8000;
if((S.end>85)&&(S.cls>80))SS=SS+4000;
if(S.end>90)SS=SS+2000;
if((S.end>85)&&(S.west=='Y'))SS=SS+1000;
if((S.cls>80)&&(S.lead=='Y'))SS=SS+850;
summ=summ+SS;
}
for(i=0;i<n;i++)
{
if(SS>k)
{
k=SS;
j=i;
}
}
printf("%s\n%d\n%d\n",std[j].name,std[j].sum,summ);
} | 39 |
19,242 | struct student
{
char name[20];
int gradeA;
int gradeB;
char a;
char b;
int num;
int n;//??
int np;//??
}
stu[100];
void main()
{
int m,k,i,max;
int total=0;
scanf("%d\n",&m);
for(i=0;i<m;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].gradeA,&stu[i].gradeB,&stu[i].a,&stu[i].b,&stu[i].num);
stu[i].n=0;
stu[i].np=0;
}
for(i=0;i<m;i++)
{
if(stu[i].gradeA>80&&stu[i].num>=1)
{
total=total+8000;
stu[i].n++;
stu[i].np=stu[i].np+8000;
}
if(stu[i].gradeA>85&&stu[i].gradeB>80)
{
total=total+4000;
stu[i].n++;
stu[i].np=stu[i].np+4000;
}
if(stu[i].gradeA>90)
{
total=total+2000;
stu[i].n++;
stu[i].np=stu[i].np+2000;
}
if(stu[i].gradeA>85&&stu[i].b=='Y')
{
total=total+1000;
stu[i].n++;
stu[i].np=stu[i].np+1000;
}
if(stu[i].gradeB>80&&stu[i].a=='Y')
{
total=total+850;
stu[i].n++;
stu[i].np=stu[i].np+850;
}
}
for(i=0,max=0;i<m;i++)
if(stu[i].np>max)
{
max=stu[i].np;
}
for(i=0;i<m;i++)
{
if(stu[i].np==max)
{
k=i;
break;
}
}
printf("%s\n%d\n%d\n",stu[k].name,stu[k].np,total);
} | 39 |
19,243 | void main()
{
struct student
{char name[21];
int score1;
int score2;
char q1;
char q2;
int paper;
};
struct student stu[101];
//struct student*p;
int p;
int n,i,money[101],max=0,sum=0;
scanf("%d",&n);
for (p=0;p<n;p++)
{
scanf ("%s %d %d %c %c %d",&(stu[p].name),&(stu[p].score1),&(stu[p].score2),&(stu[p].q1),&(stu[p].q2),&(stu[p].paper));
}
for (i=0;i<n;i++)money[i]=0;
i=0;
for (p=0;p<n;p++)
{if (stu[p].score1>80&&stu[p].paper>0)money[i]+=8000;
if (stu[p].score1>85&&stu[p].score2>80)money[i]+=4000;
if (stu[p].score1>90)money[i]+=2000;
if (stu[p].score1>85&&stu[p].q2=='Y')money[i]+=1000;
if (stu[p].score2>80&&stu[p].q1=='Y')money[i]+=850;
if (money[i]>money[max])max=i;
sum+=money[i];i++;}
printf("%s\n%d\n%d",stu[max].name,money[max],sum);
} | 39 |
19,244 |
void main()
{struct student
{char name[30];
int final;
int crit;
char leader;
char west;
int paper;}stu;
int max=0,n,i,total=0,money;
char bestboy[30];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s ",stu.name);
scanf("%d ",&stu.final);
scanf("%d ",&stu.crit);
scanf("%c ",&stu.leader);
scanf("%c ",&stu.west);
scanf("%d",&stu.paper);
money=0;
if(stu.final>80&&stu.paper!=0)//1) ????????8000??????????80??>80???????????1??1?????????????
//3) ????????2000??????????90??>90?????????
//4) ????????1000??????????85??>85?????????????
//5) ????????850??????????80??>80???????????
money+=8000;
if(stu.final>85&&stu.crit>80)//2) ????????4000??????????85??>85????????????80??>80?????????
money+=4000;
if(stu.final>90)
money+=2000;
if(stu.final>85&&stu.west=='Y')
money+=1000;
if(stu.crit>80&&stu.leader=='Y')
{money+=850;}
total+=money;
if(money>max)
{max=money;
strcpy(bestboy,stu.name);
}
}
printf("%s\n%d\n%d",bestboy,max,total);
}
| 39 |
19,245 | struct inf
{
char name[30];
int s1;//??
int s2;//??
char a;//??
char b;//??
int num;//??
};
void main()
{
int n,i,t,total=0,money[100]={0},max=0;
struct inf c[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c[i].name);
scanf("%d %d",&c[i].s1,&c[i].s2);
scanf(" %c %c ",&c[i].a,&c[i].b);//??????????
scanf("%d",&c[i].num);
}
for(i=0;i<n;i++)
{
if(c[i].s1>80&&c[i].num>0)
money[i]=money[i]+8000;
if(c[i].s1>85&&c[i].s2>80)
money[i]=money[i]+4000;
if(c[i].s1>90)
money[i]=money[i]+2000;
if(c[i].s1>85&&c[i].b=='Y')
money[i]=money[i]+1000;
if(c[i].s2>80&&c[i].a=='Y')
money[i]=money[i]+850;
}
for(i=0;i<n;i++)
{
if(money[i]>max)
{
max=money[i];
t=i;
}
total+=money[i];
}
printf("%s\n",c[t].name);
printf("%d\n",max);
printf("%d",total);
}
| 39 |
19,246 | struct student
{
char name[25];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int jiangjin;
};
void main()
{
int n,q=0;
struct student stu[100];
int i,j,k,r,m=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);
// scanf("%d",&stu[i].qimo);
// scanf("%d",&stu[i].banji);
// scanf("&c",&stu[i].ganbu);
// scanf("%c",&stu[i].xibu);
// scanf("%d",&stu[i].lunwen);
stu[i].jiangjin=0;
}
for(i=0;i<n;i++)
{
if(stu[i].qimo>80&&stu[i].lunwen>=1)stu[i].jiangjin=stu[i].jiangjin+8000;
if(stu[i].qimo>85&&stu[i].banji>80)stu[i].jiangjin=stu[i].jiangjin+4000;
if(stu[i].qimo>90)stu[i].jiangjin=stu[i].jiangjin+2000;
if(stu[i].qimo>85&&stu[i].xibu=='Y')stu[i].jiangjin=stu[i].jiangjin+1000;
if(stu[i].banji>80&&stu[i].ganbu=='Y')stu[i].jiangjin=stu[i].jiangjin+850;
q=q+stu[i].jiangjin;
}
for(i=0,q=0;i<n;i++)
{
if(stu[i].jiangjin>m)m=stu[i].jiangjin;
q=q+stu[i].jiangjin;
}
for(i=0;i<n;i++)
{
if(stu[i].jiangjin==m)
{
printf("%s\n",stu[i].name);
printf("%d\n",m);
printf("%d",q);
break;
}
}
} | 39 |
19,247 | struct In {char name[21];int g1;int g2;char y1;char y2;int g3;int g;} ;
int main()
{int i,n,b,d=0,m=0;
scanf("%d",&n);
struct In a[101];
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",a[i].name,&a[i].g1,&a[i].g2,&a[i].y1,&a[i].y2,&a[i].g3);if(a[i].g3>0) b=1;else b=0;
a[i].g=(a[i].g1/81)*b*8000+(a[i].g1/86)*(a[i].g2/81)*4000+(a[i].g1/91)*2000+(a[i].g1/86)*(a[i].y2/81)*1000+(a[i].g2/81)*(a[i].y1/81)*850;}
for(i=0;i<n;i++)
{d=d+a[i].g;
if(a[i].g>m) m=a[i].g;}
for(i=0;i<n;i++)
if(a[i].g==m){printf("%s\n%d\n%d\n",a[i].name,a[i].g,d); break;}
return 0;} | 39 |
19,248 | struct student
{
char name[20];
int score;
int ping;
char gan;
char xi;
int lun;
int jiang;
}stu[100];
int 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=stu[i].jiang+8000;
if(stu[i].score>85&&stu[i].ping>80)stu[i].jiang=stu[i].jiang+4000;
if(stu[i].score>90)stu[i].jiang=stu[i].jiang+2000;
if(stu[i].score>85&&stu[i].xi=='Y')stu[i].jiang=stu[i].jiang+1000;
if(stu[i].ping>80&&stu[i].gan=='Y')stu[i].jiang=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;}
return 0;
}
| 39 |
19,249 | void main()
{
int i,n,total=0;
struct student
{
char name[21];
int FinalScore;
int ClassScore;
char u;
char w;
int a;
int money;
}stu,max;
scanf("%d",&n);
max.money=-1;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu.name,&stu.FinalScore,
&stu.ClassScore,&stu.u,&stu.w,&stu.a);
stu.money=0;
if(stu.FinalScore>80&&stu.a>0)
stu.money+=8000;
if(stu.FinalScore>85&&stu.ClassScore>80)
stu.money+=4000;
if(stu.FinalScore>90)
stu.money+=2000;
if(stu.FinalScore>85&&stu.w=='Y')
stu.money+=1000;
if(stu.ClassScore>80&&stu.u=='Y')
stu.money+=850;
total+=stu.money;
if(stu.money>max.money)
max=stu;
}
printf("%s\n%d\n%d\n",max.name,max.money,total);
} | 39 |
19,250 | void main()
{
int n,z=0,sum=0,i,max=0;scanf("%d",&n);
struct st
{
char na[30];
int s1;
int s2;
char x1;
char x2;
int l;
int b;
struct st *next;
}*p,*head,*p1,*p2,*q;
p1=p2=(struct st *)malloc(sizeof(struct st));head=p1;
do
{
scanf("%s %d %d %c %c %d",p1->na,&p1->s1,&p1->s2,&p1->x1,&p1->x2,&p1->l);
z++;
p1->b=0;if(p1->s1>80&&p1->l>=1)p1->b+=8000;if(p1->s1>85&&p1->s2>80)p1->b+=4000;if(p1->s1>90)p1->b+=2000;
if(p1->s1>85&&p1->x2=='Y')p1->b+=1000;if(p1->s2>80&&p1->x1=='Y')p1->b+=850;
p1=(struct st *)malloc(sizeof(struct st));p2->next=p1;p2=p1;
}while(z!=n);
p1=NULL;
z=0;
p=head;
do
{
sum+=p->b;
if(p->b>max){max=p->b;q=p;}
z++;
p=p->next;
}while(z!=n);
printf("%s\n%d\n%d\n",q->na,max,sum);
} | 39 |
19,251 | struct student{
char name[21];
int qimo;
int maji;
char ganbu;
char xibu;
int lun;
int money;}st[101];
int main()
{
int n,i,j,ans=0;
memset(st,0,sizeof(struct student));
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%s %d %d %c %c %d",st[i].name,&st[i].qimo,&st[i].maji,&st[i].ganbu,&st[i].xibu,&st[i].lun);
for(i=1;i<=n;i++)
{if(st[i].qimo>80&&st[i].lun>=1)st[i].money+=8000;
if(st[i].qimo>85&&st[i].maji>80)st[i].money+=4000;
if(st[i].qimo>90)st[i].money+=2000;
if(st[i].qimo>85&&st[i].xibu=='Y')st[i].money+=1000;
if(st[i].maji>80&&st[i].ganbu=='Y')st[i].money+=850;
}
j=1;
for(i=1;i<=n;i++)
{if(st[j].money<st[i].money)j=i;
ans+=st[i].money;
}
printf("%s\n%d\n%d",st[j].name,st[j].money,ans);
return 0;
} | 39 |
19,252 | struct Student{
char name[50];
int cj,py,lw,sum;
char gb,xb;
struct Student *next;
}*p1,*p2,*head,*p,*ans;
int main()
{
int n,i=0,sum=0,j,k;
scanf("%d",&n);
head = NULL;
for (i=0;i<n;i++){
p1 = (struct Student *)malloc(Len);
if (i==0) head = p1;
else p2->next = p1;
p2 = p1;
scanf("%s%d%d %c %c%d",p1->name,&p1->cj,&p1->py,&p1->gb,&p1->xb,&p1->lw);
p1->sum = 0;
}
p1->next = NULL;
p = head;
do{
if (p->cj>80&&p->lw>=1) p->sum+=8000;
if (p->py>80&&p->gb=='Y') p->sum+=850;
if (p->cj>85&&p->py>80) p->sum+=4000;
if (p->cj>85&&p->xb=='Y') p->sum+=1000;
if (p->cj>90) p->sum+=2000;
p = p->next;
}while (p);
ans = (struct Student *)malloc(Len);
ans->sum = 0;
p = head;
do{
sum+=p->sum;
if (p->sum>ans->sum) ans = p;
p=p->next;
}while(p);
printf("%s\n%d\n%d",ans->name,ans->sum,sum);
return 0;
}
| 39 |
19,253 | int main()
{
char name[1000][1000],leader,west,tem[1000];
int n,i,all=0,j,a,b,t,money[5],sum[1000],paper;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",name[i],&a,&b,&leader,&west,&paper);
if(a>80&&paper>0)money[0]=8000;else money[0]=0;
if(a>85&&b>80)money[1]=4000;else money[1]=0;
if(a>90)money[2]=2000;else money[2]=0;
if(a>85&&west=='Y')money[3]=1000;else money[3]=0;
if(b>80&&leader=='Y')money[4]=850;else money[4]=0;
sum[i]=money[0]+money[1]+money[2]+money[3]+money[4];
}
for(i=0;i<n;i++)
all+=sum[i];
for(j=0;j<n-1;j++)
for(i=0;i<n-1-j;i++)
if(sum[i]<sum[i+1])
{
t=sum[i];
sum[i]=sum[i+1];
sum[i+1]=t;
strcpy(tem,name[i]);
strcpy(name[i],name[i+1]);
strcpy(name[i+1],tem);
}
printf("%s\n%d\n%d",name[0],sum[0],all);
return 0;
}
| 39 |
19,254 | int main()
{
int n;
scanf("%d",&n);
struct student
{
char name[100];
int qi;
int ping;
char gan;
char xi;
int lun;
}a[1000];
int i;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].qi,&a[i].ping,&a[i].gan,&a[i].xi,&a[i].lun);
}
int d[1000]={0};
for(i=0;i<n;i++)
{
if(a[i].qi>80&&a[i].lun!=0)
{d[i]+=8000;}
if(a[i].qi>85&&a[i].ping>80)
{d[i]+=4000;}
if(a[i].qi>90)
{d[i]+=2000;}
if(a[i].qi>85&&a[i].xi=='Y')
{d[i]+=1000;}
if(a[i].ping>80&&a[i].gan=='Y')
{d[i]+=850;}
}
int sum=0;
for(i=0;i<n;i++)
{sum+=d[i];}
int z=0;
for(i=0;i<n;i++)
{
if(d[z]<d[i])
{z=i;}
}
printf("%s\n%d\n%d",a[z].name,d[z],sum);
return 0;
}
| 39 |
19,255 | void main()
{
struct stu
{
char name[20];
int q;
int p;
char g;
char x;
int l;
}stu[100];
int n,i,j;
char m[100][20];
int s,t=0,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].q,&stu[i].p,&stu[i].g,&stu[i].x,&stu[i].l);
s=0;
if(stu[i].q>80&&stu[i].l>=1)
s=s+8000;
if(stu[i].q>85&&stu[i].p>80)
s=s+4000;
if(stu[i].q>90)
s=s+2000;
if(stu[i].q>85&&stu[i].x=='Y')
s=s+1000;
if(stu[i].p>80&&stu[i].g=='Y')
s=s+850;
sum=sum+s;
if(s>t)
{
j=0;
strcpy(m[j],stu[i].name);
t=s;
j++;
}
else if(s==t)
{
strcpy(m[j],stu[i].name);
j++;
}
}
printf("%s\n",m[0]);
printf("%d\n",t);
printf("%d\n",sum);
}
| 39 |
19,256 | struct student
{
char name[20];
int qm,py,gb,xb;
int paper;
int sum;
}stu[100];
void main()
{
int n,i,k,max,s=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qm,&stu[i].py,&stu[i].gb,&stu[i].xb,&stu[i].paper);
stu[i].sum=0;
}
for(i=0;i<n;i++)
{
if( stu[i].qm>80&& stu[i].paper>=1)
stu[i].sum=stu[i].sum+8000;
if(stu[i].qm>85&&stu[i].py>80)
stu[i].sum=stu[i].sum+4000;
if(stu[i].qm>90)
stu[i].sum=stu[i].sum+2000;
if(stu[i].qm>85&&stu[i].xb=='Y')
stu[i].sum=stu[i].sum+1000;
if(stu[i].py>80&&stu[i].gb=='Y')
stu[i].sum=stu[i].sum+850;
s=s+stu[i].sum;
}
max=stu[0].sum;
for(i=0;i<n;i++)
if(max<stu[i+1].sum)
max=stu[i+1].sum;
for(i=0;i<n;i++)
{
if(stu[i].sum==max)
{
printf("%s\n%d\n%d",stu[i].name,max,s);break;
}
}
}
| 39 |
19,257 |
int main()
{
int n,i,sum=0,k=0,t;
struct point{char name[21],ganbu,xibu;int x,y,z,money;}stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].x,&stu[i].y,&stu[i].ganbu,&stu[i].xibu,&stu[i].z);
stu[i].money=0;
if(stu[i].x>80&&stu[i].z>0)
{
stu[i].money+=8000;
sum+=8000;
}
if(stu[i].x>85&&stu[i].y>80)
{
stu[i].money+=4000;
sum+=4000;
}
if(stu[i].x>90)
{
stu[i].money+=2000;
sum+=2000;
}
if(stu[i].x>85&&stu[i].xibu=='Y')
{
stu[i].money+=1000;
sum+=1000;
}
if(stu[i].y>80&&stu[i].ganbu=='Y')
{
stu[i].money+=850;
sum+=850;
}
}
for(i=0;i<n;i++)
{
if(stu[i].money>k)
{
k=stu[i].money;
t=i;
}
}
printf("%s\n",stu[t].name);
printf("%d\n",stu[t].money);
printf("%d",sum);
return 0;
}
| 39 |
19,258 | int main()
{
int i,n,j,r,t,m,q=0;
int a[101];
struct student {
char name[20];
int zong;
int ban;
char gan;
char xi;
int lun;
int z;
}stu[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].zong,&stu[i].ban,&stu[i].gan,&stu[i].xi,&stu[i].lun);
}
for(i=1;i<=n;i++)
{ stu[i].z=0;
if(stu[i].zong>80&&stu[i].lun>0)
stu[i].z=stu[i].z+8000;
if(stu[i].zong>85&&stu[i].ban>80)
stu[i].z=stu[i].z+4000;
if(stu[i].zong>90)
stu[i].z=stu[i].z+2000;
if(stu[i].zong>85&&stu[i].xi=='Y')
stu[i].z=stu[i].z+1000;
if(stu[i].ban>80&&stu[i].gan=='Y')
stu[i].z=stu[i].z+850;
a[i]=stu[i].z;
q=q+stu[i].z;
}
for(j=n;j>0;j--)
{ for(r=0;r<j;r++)
if(stu[r].z>stu[r+1].z)
{t=stu[r+1].z;
stu[r+1].z=stu[r].z;
stu[r].z=t;
}
}
for(i=1;i<=n;i++)
if(a[i]==stu[n].z)
{ m=i;
break;
}
printf("%s\n%d\n%d\n",stu[m].name,stu[n].z,q);
return 0;
} | 39 |
19,259 | int main()
{
struct student
{
char nam[50];
int ave;
int ping;
char gan;
char xi;
int wen;
int total[5];
int all;
}stu[100];
int num,i,j;
int a[100]={0};
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%s%d%d %c %c%d",stu[i].nam,&stu[i].ave,&stu[i].ping,&stu[i].gan,&stu[i].xi,&stu[i].wen);
stu[i].all = 0;
memset(stu[i].total, 0, sizeof(stu[i].total));
}
for(i=0;i<num;i++)
{
if(stu[i].ave>80&&stu[i].wen>=1)
stu[i].total[0]=8000;
if(stu[i].ave>85&&stu[i].ping>80)
stu[i].total[1]=4000;
if(stu[i].ave>90)
stu[i].total[2]=2000;
if(stu[i].ave>85&&stu[i].xi=='Y')
stu[i].total[3]=1000;
if(stu[i].ping>80&&stu[i].gan=='Y')
stu[i].total[4]=850;
}
for(i=0;i<num;i++)
{
for(j=0;j<5;j++)
{
stu[i].all+=stu[i].total[j]; //????????????.
}
}
int max=0;
for(i=0;i<num;i++)
{
if(stu[i].all>max)
{
max=stu[i].all;//????????,????????
j=i;
}
}
int whole=0;
for(i=0;i<num;i++)
{
whole+=stu[i].all;
}
printf("%s\n%d\n%d",stu[j].nam,max,whole);
return 0;
} | 39 |
19,260 |
void main()
{
int N;
scanf("%d",&N);
struct student
{
char name[20];
int qm;
int py;
char gb;
char w;
int lw;
int jj;
}stu[100];
int i;
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].qm,&stu[i].py,&stu[i].gb,&stu[i].w,&stu[i].lw);
stu[i].jj=0;
if(stu[i].qm>90)stu[i].jj+=2000;
if(stu[i].qm>80&&stu[i].lw>=1)stu[i].jj+=8000;
if(stu[i].qm>85&&stu[i].w=='Y')stu[i].jj+=1000;
if(stu[i].qm>85&&stu[i].py>80)stu[i].jj+=4000;
if(stu[i].py>80&&stu[i].gb=='Y')stu[i].jj+=850;
}
int trans1;
char trans2[20];
int total=0;
for(i=0;i<N;i++)total+=stu[i].jj;
for(i=0;i<N-1;i++)
{
if(stu[i].jj>=stu[i+1].jj)
{
trans1=stu[i].jj;
strcpy(trans2,stu[i].name);
strcpy(stu[i].name,stu[i+1].name);
stu[i].jj=stu[i+1].jj;
strcpy(stu[i+1].name,trans2);
stu[i+1].jj=trans1;
}
}
printf("%s\n%d\n%d\n",stu[N-1].name,stu[N-1].jj,total);
} | 39 |
19,261 | struct stu
{
char name[20];
int grade,point;
char job;
char home;
int paper,sum;
}student[100];
void main()
{
int n,i;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
student[i].sum=0;
}
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",student[i].name,&student[i].grade,&student[i].point,&student[i].job,&student[i].home,&student[i].paper);
if(student[i].grade>80&&student[i].paper>0)
student[i].sum+=8000;
if(student[i].grade>85&&student[i].point>80)
student[i].sum+=4000;
if(student[i].grade>90)
student[i].sum+=2000;
if(student[i].grade>85&&student[i].home=='Y')
student[i].sum+=1000;
if(student[i].point>80&&student[i].job=='Y')
student[i].sum+=850;
}
int max;
max=student[0].sum;
for(i=0;i<n;i++)
{
if(student[i].sum>max)
max=student[i].sum;
}
for(i=0;i<n;i++)
{
if(max==student[i].sum)
{
printf("%s\n%d\n",student[i].name,student[i].sum);
break;
}
}
int SUM=0;
for(i=0;i<n;i++)
{
SUM+=student[i].sum;
}
printf("%d",SUM);
} | 39 |
19,262 | struct qian{
char a[20];
int b[1];
int c[1];
char d[2];
char e[2];
int f[1];
}stu[101];
void main()
{
int exin(int A,int B,char C,char D,int E);
int n;int x,y=0;int total=0;
int i;
int sum[101]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%c%c%c%c%d",stu[i].a,&stu[i].b[0],&stu[i].c[0],&stu[i].d[0],&stu[i].d[1],&stu[i].e[0],&stu[i].e[1],&stu[i].f[0]);
}
for(i=0;i<n;i++)
{
sum[i]=exin(stu[i].b[0],stu[i].c[0],stu[i].d[1],stu[i].e[1],stu[i].f[0]);
}
for(i=0;i<n;i++)
{
total=total+sum[i];
}
x=sum[0];
for(i=1;i<n;i++)
{
if(sum[i]>x)
{
x=sum[i];
y=i;
}
}
printf("%s\n",stu[y].a);
printf("%d\n%d",x,total);
}
int exin(int A,int B,char C,char D,int E)
{
int k=0;
if(A>80&&E>=1)k=k+8000;
if(A>85&&B>80)k=k+4000;
if(A>90)k=k+2000;
if(A>85&&D=='Y')k=k+1000;
if(B>80&&C=='Y')k=k+850;
return(k);
} | 39 |
19,263 | struct student
{char name[20];
int score1;
int score2;
char ganbu;
char west;
int paper;
int scolarship;
};
void main()
{
int n,i,total=0,max=0;
char name2[20];
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].score1,&stu[i].score2,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
stu[i].scolarship=0;
if(stu[i].score1>80&&stu[i].paper>=1) stu[i].scolarship=8000;
if(stu[i].score1>85&&stu[i].score2>80) stu[i].scolarship=stu[i].scolarship+4000;
if(stu[i].score1>90) stu[i].scolarship=stu[i].scolarship+2000;
if(stu[i].score1>85&&stu[i].west=='Y') stu[i].scolarship=stu[i].scolarship+1000;
if(stu[i].score2>80&&stu[i].ganbu=='Y') stu[i].scolarship=stu[i].scolarship+850;
total=total+stu[i].scolarship;
if(stu[i].scolarship>max)
{max=stu[i].scolarship;
strcpy(name2,stu[i].name);}
}
printf("%s\n%d\n%d",name2,max,total);
}
| 39 |
19,264 | int main ()
{
char name[100][20]={0};
char bgb,xb;
int sc1,sc2,lw,sum[100]={0},s=0;
int n,max=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",name[i]);
scanf("%d %d %c %c %d",&sc1,&sc2,&bgb,&xb,&lw);
if(sc1>80 && lw>0){
sum[i]+=8000;
}
if(sc1>85 && sc2>80){
sum[i]+=4000;
}
if(sc1>90){
sum[i]+=2000;
}
if(sc1>85 && xb=='Y'){
sum[i]+=1000;
}
if(sc2>80 && bgb=='Y'){
sum[i]+=850;
}
s+=sum[i];
}
for(int j=0;j<n;j++){
if(max<sum[j]){
max=sum[j];
}
}
for(int k=0;k<n;k++){
if(sum[k]==max){
printf("%s\n%d\n%d\n",name[k],sum[k],s);
break;
}
}
return 0;
}
| 39 |
19,265 | struct student{
char name[25];
int qimo;
int banji;
char ganbu[2];
char xibu[2];
int lunwen;
int money;
}stu[102]={0};
struct student temp;
void main()
{
int i,j,n,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d%s%s%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].money=stu[i].money+8000;
if(stu[i].qimo>85&&stu[i].banji>80)
stu[i].money=stu[i].money+4000;
if(stu[i].qimo>90)
stu[i].money=stu[i].money+2000;
if(stu[i].qimo>85&&stu[i].xibu[0]=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].banji>80&&stu[i].ganbu[0]=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0;i<n;i++)
sum=sum+stu[i].money;
for(i=1;i<n;i++){
for(j=0;j<n-i;j++){
if(stu[j].money<stu[j+1].money){
temp=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp;
}
}
}
printf("%s\n%d\n%d\n",stu[0].name,stu[0].money,sum);
}
| 39 |
19,266 | struct student
{
char name[20];
int a1;
int a2;
char w;
char m;
int e;
int sch;
}stu[100];
void main()
{
int n,i,sum=0;
struct student p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].a1,&stu[i].a2,&stu[i].m,&stu[i].w,&stu[i].e);
stu[i].sch=0;
if(stu[i].a1>80&&stu[i].e>0) stu[i].sch+=8000;
if(stu[i].a1>85&&stu[i].a2>80) stu[i].sch+=4000;
if(stu[i].a1>90) stu[i].sch+=2000;
if(stu[i].a1>85&&stu[i].w=='Y') stu[i].sch+=1000;
if(stu[i].a2>80&&stu[i].m=='Y') stu[i].sch+=850;
sum+=stu[i].sch;
}
p=stu[0];
for(i=0;i<n;i++)
if(stu[i].sch>p.sch) p=stu[i];
printf("%s\n%d\n%d",p.name,p.sch,sum);
}
| 39 |
19,267 | void main()
{
struct stu
{char a[20];
int chj;
int pin;
char gb;
char xb;
int lunwen;
int reward;
};
struct stu student[100];
int i,n,jishu,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",student[i].a,&student[i].chj,
&student[i].pin,&student[i].gb,&student[i].xb,&student[i].lunwen);
for(i=0;i<n;i++)
student[i].reward=0;
for(i=0;i<n;i++)
{if(student[i].chj>80&&student[i].lunwen>0)
student[i].reward=student[i].reward+8000;
if(student[i].chj>85&&student[i].pin>80)
student[i].reward=student[i].reward+4000;
if(student[i].chj>90)
student[i].reward=student[i].reward+2000;
if(student[i].chj>85&&student[i].xb=='Y')
student[i].reward=student[i].reward+1000;
if(student[i].pin>80&&student[i].gb=='Y')
student[i].reward=student[i].reward+850;
}
jishu=0;
for(i=0;i<n;i++)
{if(student[i].reward>student[jishu].reward)
jishu=i;
}
for(i=0;i<n;i++)
{
sum=sum+student[i].reward;
}
printf("%s\n%d\n%d\n",student[jishu].a,student[jishu].reward,sum);
} | 39 |
19,268 | struct points
{
char name[30];
int score1;
int score2;
char west;
char leader;
int essay;
int money;
}points[100];
int main()
{
int n,i,max=0,m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",points[i].name,&points[i].score1,&points[i].score2,&points[i].leader,&points[i].west,&points[i].essay);
points[i].money=0;
}
for(i=0;i<n;i++)
{
if(points[i].score1>90)
{
points[i].money=points[i].money+2000;
}
if(points[i].score1>85&&points[i].score2>80)
{
points[i].money=points[i].money+4000;
}
if(points[i].score1>85&&points[i].west=='Y')
{
points[i].money=points[i].money+1000;
}
if(points[i].score2>80&&points[i].leader=='Y')
{
points[i].money=points[i].money+850;
}
if(points[i].score1>80&&points[i].essay>=1)
{
points[i].money=points[i].money+8000;
}
}
char *p=points[0].name;
for(i=0;i<n;i++)
{
if( points[i].money>max)
{
max=points[i].money;
p=points[i].name;
}
}
for(i=0;i<n;i++)
{
m=m+points[i].money;
}
printf("%s\n",p);
printf("%d\n",max);
printf("%d\n",m);
return 0;
}
| 39 |
19,269 | char name[101][22], yn[101][3];
int s[101][4];
void main()
{
int n, i, j, reward[101], sumreward=0;
int f1(int, int), f2(int, int), f3(int), f4(int, char), f5(int, char);
scanf("%d", &n);
for (i=1; i<=n; i++)
{
scanf("%s %d %d %c %c %d", &name[i], &s[i][1]/*??????*/, &s[i][2]/*??????*/, &yn[i][1]/*???????*/, &yn[i][2]/*?????????*/, &s[i][3]/*??????*/);
reward[i] = f1(s[i][1], s[i][3]) + f2(s[i][1], s[i][2]) + f3(s[i][1]) + f4(s[i][1], yn[i][2]) + f5(s[i][2], yn[i][1]);
sumreward=sumreward+reward[i];
};//????
for (i=1; i<=n; i++)
{
int a=0;
for (j=1; j<=i-1; j++)
{
if(reward[i]<reward[j]) a=a+1;
};
for (j=i+1; j<=n; j++)
{
if(reward[i]<reward[j]) a=a+1;
};
if (a==0) {printf("%s\n%d\n%d",name[i],reward[i],sumreward); break;};
};
}
int f1(int x, int y)//1) ?????
{
if(x>80 && y>=1) return 8000;
else return 0;
}
int f2(int x, int y)//2) ?????
{
if(x>85 && y>80) return 4000;
else return 0;
}
int f3(int x)//3) ?????
{
if(x>90) return 2000;
else return 0;
}
int f4(int x, char y)//4) ?????
{
if(x>85 && y=='Y') return 1000;
else return 0;
}
int f5(int x, char y)//5) ?????
{
if(x>80 && y=='Y') return 850;
else return 0;
} | 39 |
19,270 | void main()
{
struct student
{
char name[20];
int q;
int b;
char g;
char x;
int l;
};
struct student stu[100];
int i,n;
long sum[100]={0},sum2=0,sum1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf(P,stu[i].name,&stu[i].q,&stu[i].b,&stu[i].g,&stu[i].x,&stu[i].l);
}
for(i=0;i<n;i++)
{
if(stu[i].q>80&&stu[i].l>=1)
sum[i]=sum[i]+8000;
if(stu[i].q>85&&stu[i].b>80)
sum[i]=sum[i]+4000;
if(stu[i].q>90)
sum[i]=sum[i]+2000;
if(stu[i].q>85&&stu[i].x=='Y')
sum[i]=sum[i]+1000;
if(stu[i].b>80&&stu[i].g=='Y')
sum[i]=sum[i]+850;
}
sum1=sum[0];
sum2=sum[0];
for(i=1;i<n;i++)
{
if(sum[i]>sum1)
sum1=sum[i];
sum2=sum2+sum[i];
}
for(i=0;i<n;i++)
{
if(sum1==sum[i])
{
printf("%s\n",stu[i].name);
break;
}
}
printf("%ld\n",sum1);
printf("%ld\n",sum2);
}
| 39 |
19,271 | struct stu
{
char name[21];
int final;
int pingyi;
char leader;
char west;
int essay;
int total;
};
int main()
{
int yuanshi(struct stu s);
int wusi(struct stu s);
int score(struct stu s);
int western(struct stu s);
int contribution(struct stu s);
int n,i;
int sum=0,max;
struct stu s[101],boss;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",s[i].name,&s[i].final,&s[i].pingyi,&s[i].leader,&s[i].west,&s[i].essay);
s[i].total=0;
if (yuanshi(s[i]))
s[i].total+=8000;
if (wusi(s[i]))
s[i].total+=4000;
if (score(s[i]))
s[i].total+=2000;
if (western(s[i]))
s[i].total+=1000;
if (contribution(s[i]))
s[i].total+=850;
}
max=s[0].total;
for (i=0;i<n;i++)
{
if (max<s[i].total)
{
max=s[i].total;
boss=s[i];
}
sum+=s[i].total;
}
printf("%s\n%d\n%d\n",boss.name,boss.total,sum);
return 0;
}
int yuanshi(struct stu s)
{
if ((s.final>80)&&(s.essay>=1))
{
return 1;
}
else
return 0;
}
int wusi(struct stu s)
{
if ((s.final>85)&&(s.pingyi>80))
return 1;
else
return 0;
}
int score(struct stu s)
{
if (s.final>90)
return 1;
else
return 0;
}
int western(struct stu s)
{
if ((s.final>85)&&(s.west=='Y'))
return 1;
else
return 0;
}
int contribution(struct stu s)
{
if ((s.pingyi>80)&&(s.leader=='Y'))
return 1;
else
return 0;
} | 39 |
19,272 | void main()
{
struct student
{char name[20];
int grade;
int eva;
char pres;
char west;
int paper;
int money;
}stu[100];
int n,i,sum,j;
struct student *p;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].grade,&stu[i].eva,&stu[i].pres,&stu[i].west,&stu[i].paper);
for(i=0;i<n;i++)
{
stu[i].money=0;
if(stu[i].grade>80 && stu[i].paper>=1)
stu[i].money=stu[i].money+8000;
if(stu[i].grade>85 && stu[i].eva>80)
stu[i].money=stu[i].money+4000;
if(stu[i].grade>90)
stu[i].money=stu[i].money+2000;
if(stu[i].grade>85 && stu[i].west=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].eva>80 && stu[i].pres=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0,sum=0;i<n;i++)
sum=sum+stu[i].money;
for(i=1,p=&stu[0];i<n;i++)
{ if(stu[i].money>p->money)
p=stu+i;
}
printf("%s\n%d\n%d\n",p->name,p->money,sum);
}
| 39 |
19,273 | /*????????*/
void main()
{
int n,k,x[100][4],y,z;
char a[100][20],b[100],c[100];
scanf("%d",&n);
for(k=0,y=0,z=0;k<n;k++)
{
scanf("%s %d %d %c %c %d",a[k],&x[k][0],&x[k][1],&b[k],&c[k],&x[k][2]);
x[k][3]=0;
if(x[k][0]>80&&x[k][2]>0)
{
x[k][3]=x[k][3]+8000;
}
if(x[k][0]>85&&x[k][1]>80)
{
x[k][3]=x[k][3]+4000;
}
if(x[k][0]>90)
{
x[k][3]=x[k][3]+2000;
}
if(x[k][0]>85&&c[k]=='Y')
{
x[k][3]=x[k][3]+1000;
}
if(x[k][1]>80&&b[k]=='Y')
{
x[k][3]=x[k][3]+850;
}
z=z+x[k][3];
if(x[k][3]>x[y][3])y=k;
}
printf("%s\n%d\n%d\n",a[y],x[y][3],z);
}
| 39 |
19,274 | struct student
{char name[20];
int endmark;
int mark;
char ganbu;
char xibu;
int essay;
}stu[100];
void main()
{
int n,i,max,p,sum=0;
int scholar[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].endmark,&stu[i].mark,&stu[i].ganbu,&stu[i].xibu,&stu[i].essay);
}
for(i=0;i<n;i++)
{
if(stu[i].endmark>80&&stu[i].essay>=1) scholar[i]=scholar[i]+8000;
if(stu[i].endmark>85&&stu[i].mark>80) scholar[i]=scholar[i]+4000;
if(stu[i].endmark>90) scholar[i]=scholar[i]+2000;
if(stu[i].endmark>85&&stu[i].xibu=='Y') scholar[i]=scholar[i]+1000;
if(stu[i].mark>80&&stu[i].ganbu=='Y') scholar[i]=scholar[i]+850;
}
max=scholar[0];
for(i=0;i<n;i++)
{
if(scholar[i]>max) max=scholar[i];
}
for(i=n-1;i>=0;i--)
{
if(scholar[i]==max) p=i;
}
for(i=0;i<n;i++)
{
sum=sum+scholar[i];
}
printf("%s\n%d\n%d\n",stu[p].name,max,sum);
}
| 39 |
19,275 |
int main()
{
int n,i;
char name[10000][30],ganbu[10000][10],west[10000][10],str[20];
int qime[10000],g[10000],w[10000],e[10000];
int banji[10000],sum=0,s=0;
int sol[10000];
char yes[10]={'Y'};
scanf("%d",&n);
for(i=0;i<n;i++)
{sol[i]=0;
g[i]=1;
w[i]=1;}
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",&name[i],&qime[i],&banji[i],&ganbu[i],&west[i],&e[i]);
g[i]=strcmp(ganbu[i],yes);
w[i]=strcmp(west[i],yes);
}
for(i=0;i<n;i++)
{ sol[i]=0;
if((qime[i]>80)&&(e[i]>0))
{sol[i]+=8000;}
}
for(i=0;i<n;i++)
{if((qime[i]>85)&&(banji[i]>80))
{sol[i]+=4000;}
}
for(i=0;i<n;i++){
if(qime[i]>90)
{sol[i]+=2000;}}
for(i=0;i<n;i++){
if((w[i]==0)&&(qime[i]>85))
{sol[i]+=1000;}
}
for(i=0;i<n;i++){
if((g[i]==0)&&(banji[i]>80))
{sol[i]+=850;}
}
for(i=0;i<n;i++){
if(sol[i]>s)
{s=sol[i];
strcpy(str,name[i]);}
sum+=sol[i];
}
printf("%s\n%d\n%d\n",str,s,sum);
return 0;
}
| 39 |
19,276 | int main()
{
int n,p,i,j,end[100],class[100],issue[100],k[100],sum=0;
char monitor[100],province[100],name[100][20];
int max;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&name[i],&end[i],&class[i],&monitor[i],&province[i],&issue[i]);
for(i=0;i<n;i++)
k[i]=0;
for(i=0;i<n;i++)
{
if(end[i]>80&&issue[i]>=1) k[i]=k[i]+8000;
if(end[i]>85&&class[i]>80) k[i]=k[i]+4000;
if(end[i]>90) k[i]=k[i]+2000;
if(end[i]>85&&province[i]=='Y') k[i]=k[i]+1000;
if(class[i]>80&&monitor[i]=='Y') k[i]=k[i]+850;
}
max=k[0];
for(i=0;i<n;i++)
sum=sum+k[i];
for(i=0;i<n;i++)
{
if(k[i]>max)
{
max=k[i];
p=i;
}
}
printf("%s\n",name[p]);
printf("%d\n%d",max,sum);
return 0;
}
| 39 |
19,277 |
struct Student {
char name[21];
int grade;
int eval;
char clasAsi;
char west;
int essay;
int total;
};
int main()
{
int n, i;
int totalMoney = 0;
int money = 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].grade,&stu
[i].eval,&stu[i].clasAsi,&stu[i].west,&stu[i].essay);
stu[i].total = 0;
if (stu[i].grade > 80 && stu[i].essay > 0) {
stu[i].total = stu[i].total + 8000;
}
if (stu[i].grade > 85 && stu[i].eval > 80) {
stu[i].total = stu[i].total + 4000;
}
if (stu[i].grade > 90) {
stu[i].total = stu[i].total + 2000;
}
if (stu[i].grade > 85 && stu[i].west == 'Y') {
stu[i].total = stu[i].total + 1000;
}
if (stu[i].eval > 80 && stu[i].clasAsi == 'Y') {
stu[i].total = stu[i].total + 850;
}
}
for (i = 0; i < n; i++) {
if (stu[i].total > money) {
money = stu[i].total;
}
totalMoney = totalMoney + stu[i].total;
}
for (i = 0; i < n; i++) {
if(stu[i].total == money){
printf("%s\n%d\n",stu[i].name,money);
break;
}
}
printf("%d",totalMoney);
return 0;
} | 39 |
19,278 |
int main()
{
struct stu {
char name[100];
int score,cscore,p;
char w,l;
};
int n,tot=0,i,j,swap;
struct stu a[102];
struct stu aswap;
int b[102];
char rr,tt;
scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%s",a[i].name);
scanf("%d%d%c%c%c%c%d",&a[i].score,&a[i].cscore,&rr,&a[i].l,&tt,&a[i].w,&a[i].p);
}
for (i=1;i<=n;i++){
b[i]=0;
if ((a[i].score>80)&&(a[i].p>=1)) b[i]=b[i]+8000;
if ((a[i].score>85)&&(a[i].cscore>80)) b[i]=b[i]+4000;
if (a[i].score>90) b[i]=b[i]+2000;
if ((a[i].score>85)&&(a[i].w=='Y')) b[i]=b[i]+1000;
if ((a[i].cscore>80)&&(a[i].l=='Y')) b[i]=b[i]+850;
tot=tot+b[i];
}
for (i=1;i<=n;i++){
for (j=i+1;j<=n;j++){
if (b[i]<b[j]) {
swap=b[i];b[i]=b[j];b[j]=swap;
aswap=a[i];a[i]=a[j];a[j]=aswap;
}
}
}
printf("%s\n",a[1].name);
printf("%d\n",b[1]);
printf("%d\n",tot);
return 0;
}
| 39 |
19,279 | int main()
{
int n,i,a,b,c,j[100],j1[100],sum=0;
char m,l,s[100][20];
scanf("%d",&n);
for(i=0;i<n;i++){
j[i]=0;
scanf("%s %d %d %c %c %d",s[i],&a,&b,&m,&l,&c);
if(a>80&&c>=1){
j[i]=j[i]+8000;
}
if(a>85&&b>80){
j[i]=j[i]+4000;
}
if(a>90){
j[i]=j[i]+2000;
}
if(l=='Y'&&a>85){
j[i]=j[i]+1000;
}
if(m=='Y'&&b>80){
j[i]=j[i]+850;
}
}
for(i=0;i<n;i++){
sum=sum+j[i];
j1[i]=j[i];
}
for(i=0;i<n;i++){
if(j[i]>j[i+1])
j[i+1]=j[i];
}
for(i=0;i<n;i++){
if(j1[i]==j[n-1])
{
printf("%s\n",s[i]);
printf("%d\n",j[n-1]);
break;
}
}
printf("%d\n",sum);
return 0;
}
| 39 |
19,280 | void main()
{
int n,i,t1,t2,t3,t4,t5,all;
struct reward
{char name[20];
int score;
int comment;
char boss[2];
char west[2];
int paper;
int sum;
};
struct reward a[2];
scanf("%d",&n);
scanf("%s%d%d%s%s%d",a[0].name,&a[0].score,&a[0].comment,a[0].boss,a[0].west,&a[0].paper);
if(a[0].score>80&&a[0].paper>0) t1=1;
else t1=0;
if(a[0].score>85&&a[0].comment>80) t2=1;
else t2=0;
if(a[0].score>90) t3=1;
else t3=0;
if(a[0].score>85&&strcmp(a[0].west,"Y")==0) t4=1;
else t4=0;
if(a[0].comment>80&&strcmp(a[0].boss,"Y")==0) t5=1;
else t5=0;
a[0].sum=8000*t1+4000*t2+2000*t3+1000*t4+850*t5;
for(i=1,all=a[0].sum;i<n;i++)
{
scanf("%s%d%d%s%s%d",a[1].name,&a[1].score,&a[1].comment,a[1].boss,a[1].west,&a[1].paper);
if(a[1].score>80&&a[1].paper>0) t1=1;
else t1=0;
if(a[1].score>85&&a[1].comment>80) t2=1;
else t2=0;
if(a[1].score>90) t3=1;
else t3=0;
if(a[1].score>85&&strcmp(a[1].west,"Y")==0) t4=1;
else t4=0;
if(a[1].comment>80&&strcmp(a[1].boss,"Y")==0) t5=1;
else t5=0;
a[1].sum=8000*t1+4000*t2+2000*t3+1000*t4+850*t5;
all=all+a[1].sum;
if(a[1].sum>a[0].sum)
{
strcpy(a[0].name,a[1].name);
a[0].sum=a[1].sum;
}
}
printf("%s\n%d\n%d",a[0].name,a[0].sum,all);
} | 39 |
19,281 | struct Student
{
char name[20];
int sco;
int com;
char cad;
char prov;
int num;
};
void count_date(struct Student *p,int *a,int n)
{
int i,sum;
for(i=1;i<=n;i++)
{
sum=0;
if((p+i-1)->sco>80&&(p+i-1)->num>=1)
sum=sum+8000;
if((p+i-1)->sco>85&&(p+i-1)->com>80)
sum=sum+4000;
if((p+i-1)->sco>90)
sum=sum+2000;
if((p+i-1)->sco>85&&(p+i-1)->prov=='Y')
sum=sum+1000;
if((p+i-1)->com>80&&(p+i-1)->cad=='Y')
sum=sum+850;
a[i-1]=sum;
}
}
int compare_date(int *a,int n)
{
int i,k,max;
max=a[0];k=1;
for(i=2;i<=n;i++)
if(max<a[i-1])
{
max=a[i-1];
k=i;
}
return k;
}
int main()
{
int n,len,i,*a,top,sum=0;
struct Student *p;
scanf("%d",&n);
len=sizeof(struct Student);
p=(struct Student *)calloc(len,n);
a=(int *)calloc(4,n);
for(i=1;i<=n;i++)
scanf("%s %d %d %c %c %d",(p+i-1)->name,&(p+i-1)->sco,&(p+i-1)->com,&(p+i-1)->cad,&(p+i-1)->prov,&(p+i-1)->num);
count_date(p,a,n);
top=compare_date(a,n);
for(i=1;i<=n;i++)
sum=sum+a[i-1];
printf("%s\n%d\n%d",(p+top-1)->name,a[top-1],sum);
return 0;
}
| 39 |
19,282 | int main()
{
int n,a[100],b[100],c[100],i,ans[100],temp,sum,jxj,m,e;
char p[100],q[100],d[100][20];
scanf("%d",&n);
sum=0;
for(i=0;i<=n-1;i++)
{
scanf("%s %d %d%c%c%c%c %d",d[i],&a[i],&b[i],&e,&p[i],&m,&q[i],&c[i]);
ans[i]=0;
if(a[i]>80&&c[i]>=1)ans[i]=ans[i]+8000;
if(a[i]>85&&b[i]>80)ans[i]=ans[i]+4000;
if(a[i]>90)ans[i]=ans[i]+2000;
if(a[i]>85&&q[i]=='Y')ans[i]=ans[i]+1000;
if(b[i]>80&&p[i]=='Y')ans[i]=ans[i]+850;
}
jxj=0;
for(i=0;i<=n-1;i++)
{
if(ans[i]>jxj)
{
jxj=ans[i];
temp=i;
}
}
for(i=0;i<n;i++)sum=sum+ans[i];
printf("%s\n",d[temp]);
printf("%d\n",jxj);
printf("%d",sum);
return 0;
} | 39 |
19,283 |
struct student{
char mz[20];
int cj;
int py;
char gb;
char xb;
int lw;
int money;
};
int main(){
int N,i,max,sum;
scanf("%d",&N);
struct student *stu=(struct student*)malloc(sizeof(struct student)*N);/*??????*/
struct student *p;
p=stu;
for(i=0;i<N;i++,p++){
scanf("%s %d %d %c %c %d",p->mz,&(p->cj),&(p->py),&(p->gb),&(p->xb),&(p->lw));/*????*/
}
p=stu;
for(i=0;i<N;i++,p++){
(p->money)=0;
if (p->cj>80 && p->lw>0)
{
(p->money)+=8000;
}
if (p->cj>85 && p->py>80)
{
(p->money)+=4000;
}
if (p->cj>90)
{
(p->money)+=2000;
}
if (p->cj>85 && p->xb=='Y')
{
(p->money)+=1000;
}
if (p->py>80 && p->gb=='Y')
{
(p->money)+=850;
}
}/*?????*/
sum=0;
p=stu;
for(i=0;i<N;i++,p++){
sum+=(p->money);
}/*?????*/
max=0;
for (i=0;i<N;i++)
{
if (stu[i].money>stu[max].money)
{
max=i;
}
}/*?????*/
printf("%s\n%d\n%d\n",stu[max].mz,stu[max].money,sum);
free(stu);
return 0;
}
| 39 |
19,284 |
struct student
{
char name[20];
int exam;
int chara;
char ganbu;
char west;
int paper;
};
int scholarship(struct student stu)
{
int s=0;
if(stu.exam>80&&stu.paper>0)
s=s+8000;
if(stu.exam>85&&stu.chara>80)
s=s+4000;
if(stu.exam>90)
s=s+2000;
if(stu.exam>85&&(stu.west=='Y'))
s=s+1000;
if((stu.ganbu=='Y')&&stu.chara>80)
s=s+850;
return(s);
}
void main()
{
int n,c[100],i,sum=0,max,k;
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].exam,&stu[i].chara,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++)
{
c[i]=scholarship(stu[i]);
sum=sum+c[i];
}
max=c[0];
k=0;
for(i=1;i<n;i++)
{
if(c[i]>max)
{
max=c[i];
k=i;
}
}
printf("%s\n",stu[k].name);
printf("%d\n",c[k]);
printf("%d\n",sum);
} | 39 |
19,285 |
struct student{
char name[20];
int smark;
int cmark;
char lead;
char west;
int num;
};
struct student stu[200];
int s[100];
int n;
int js(int x)
{
int reval=0;
if (stu[x].smark>80&&stu[x].num>=1) reval+=8000;
if (stu[x].smark>85&&stu[x].cmark>80) reval+=4000;
if (stu[x].smark>90) reval+=2000;
if (stu[x].smark>85&&stu[x].west=='Y') reval+=1000;
if (stu[x].cmark>80&&stu[x].lead=='Y') reval+=850;
return reval;
}
int main()
{
int maxnum=0,max=0,sum=0,i=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>stu[i].name>>stu[i].smark>>stu[i].cmark>>stu[i].lead>>stu[i].west>>stu[i].num;
}
for(i=0;i<n;i++)
{
// cout<<js(i)<<endl;
sum+=js(i);
if(js(i)>max){
maxnum=i;
max=js(i);
}
}
cout<<stu[maxnum].name<<endl<<max<<endl<<sum<<endl;
return 0;
}
| 39 |
19,286 | struct m
{ int m1,m2,is,sum;
char n[27],w,a;
}
main()
{ int n,k,s,i,j,m,f1(S),f2(S),f3(S),f4(S),f5(S);
char *t,a[26];
struct m *head,*p1,*p2,*tp,*q;
scanf("%d",&n);
head=(struct m*)calloc(n,L);
for(i=0;i<n;i++)
{ p1=head+i;
scanf("%s%d%d %c %c%d",p1->n,&p1->m1,&p1->m2,&p1->a,&p1->w,&p1->is);
p1->sum=f1(p1)+f2(p1)+f3(p1)+f4(p1)+f5(p1);
}
s=0;
for(m=head->sum,k=0,i=0;i<n;i++)
{ if((head+i)->sum>m){k=i;m=(head+i)->sum;}
s+=(head+i)->sum;
}
printf("%s\n%d\n%d",(head+k)->n,m,s);
}
int f1(S)
{ return 8000*(s->m1>80&&s->is>=1);
}
int f2(S)
{ return 4000*(s->m1>85&&s->m2>80);
}
int f3(S)
{ return 2000*(s->m1>90);
}
int f4(S)
{ return 1000*(s->w=='Y'&&s->m1>85);
}
int f5(S)
{ return 850*(s->a=='Y'&&s->m2>80);
}
| 39 |
19,287 | main()
{
int n,i,j,m=0,t,s=0,a[100][5]={0},b[100],c[100];
struct student
{
char name[20];
int qimo;
int pingyi;
char ganbu;
char xibu;
int lunwen;
};
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].qimo,&stu[i].pingyi,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
for(i=0;i<n;i++)
{
if(stu[i].qimo>80&&stu[i].lunwen>=1) a[i][0]=8000;
if(stu[i].qimo>85&&stu[i].pingyi>80) a[i][1]=4000;
if(stu[i].qimo>90) a[i][2]=2000;
if(stu[i].qimo>85&&stu[i].xibu=='Y') a[i][3]=1000;
if(stu[i].pingyi>80&&stu[i].ganbu=='Y') a[i][4]=850;
b[i]=a[i][0]+a[i][1]+a[i][2]+a[i][3]+a[i][4];
}
for(i=0;i<n;i++)
c[i]=b[i];
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
if(c[j]>c[j+1])
{
t=c[j];
c[j]=c[j+1];
c[j+1]=t;
}
}
for(i=0;i<n;i++)
{
if(b[i]==c[n-1])
{
m=i;
break;
}
}
for(i=0;i<n;i++)
s=s+b[i];
printf("%s\n",stu[m].name);
printf("%d\n",c[n-1]);
printf("%d\n",s);
return 0;
}
| 39 |
19,288 | void main()
{
char name[100][20],ganbu[100],xibu[100];
int qimo[100],banji[100],lunwen[100],i,n,sum[100]={0},flag=0,max=0,total=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",name[i],&qimo[i],&banji[i],&ganbu[i],&xibu[i],&lunwen[i]);
}
for (i=0;i<n;i++)
{
if (qimo[i]>80&&lunwen[i]>=1) sum[i]+=8000;
if (qimo[i]>85&&banji[i]>80) sum[i]+=4000;
if (qimo[i]>90) sum[i]+=2000;
if (qimo[i]>85&&xibu[i]=='Y') sum[i]+=1000;
if (banji[i]>80&&ganbu[i]=='Y') sum[i]+=850;
}
for (i=0;i<n;i++)
{
if (max<sum[i])
{
max=sum[i];
flag=i;
}
total=total+sum[i];
}
printf("%s\n%d\n%d\n",name[flag],sum[flag],total);
} | 39 |
19,289 | struct student
{
char name[20];
int score;
int clas;
char g;
char x;
int paper;
int total;
}stu[100];
void main()
{
int i,k,max,n,zong;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d\n",stu[i].name,&stu[i].score,&stu[i].clas,&stu[i].g,&stu[i].x,&stu[i].paper);
stu[i].total=0;
if(stu[i].score>80&&stu[i].paper>=1)
stu[i].total=stu[i].total+8000;
if(stu[i].score>85&&stu[i].clas>80)
stu[i].total=stu[i].total+4000;
if(stu[i].score>90)
stu[i].total=stu[i].total+2000;
if(stu[i].score>85&&stu[i].x=='Y')
stu[i].total=stu[i].total+1000;
if(stu[i].clas>80&&stu[i].g=='Y')
stu[i].total=stu[i].total+850;
}
zong=0;
max=0;
for(i=0;i<n;i++)
{
zong=zong+stu[i].total;
if(stu[i].total>max)
{
max=stu[i].total;
k=i;}
}
printf("%s\n%d\n%d",stu[k].name,max,zong);
} | 39 |
19,290 | int main()
{
int n,count[100]={0},score1[100],score2[100],num[100],i;
char name[100][30],a[100][2],b[100][2];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",name[i],&score1[i],&score2[i],a[i],b[i],&num[i]);
if(score1[i]>80&&num[i]>=1)
count[i]+=8000;
if(score1[i]>85&&score2[i]>80)
count[i]+=4000;
if(score1[i]>90)
count[i]+=2000;
if(score1[i]>85&&strcmp(b[i],"Y")==0)
count[i]+=1000;
if(score2[i]>80&&strcmp(a[i],"Y")==0)
count[i]+=850;
}
int max=count[0],m=0,sum=count[0];
for(i=1;i<n;i++)
{
sum+=count[i];
if(count[i]>max)
{
max=count[i];
m=i;
}
}
printf("%s\n%d\n%d",name[m],count[m],sum);
return 0;
}
| 39 |
19,291 |
int main(int argc, char* argv[])
{ int n,c[100],d[100],e[100],i,j=0,z,jin[100],max=0;
char s[100][50];
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d %c %c%d",s[i],&c[i],&d[i],&a[i],&b[i],&e[i]);}
for(i=0;i<n;i++){
jin[i]=0;
if(c[i]>80&&e[i]>=1){jin[i]=jin[i]+8000;}
if(c[i]>85&&d[i]>80){jin[i]=jin[i]+4000;}
if(c[i]>90){jin[i]=jin[i]+2000;}
if(c[i]>85&&b[i]=='Y'){jin[i]=jin[i]+1000;}
if(d[i]>80&&a[i]=='Y'){jin[i]=jin[i]+850;}
}
j=0;
for(i=0;i<n;i++){
j=j+jin[i];}
for(i=0;i<n;i++){
if(jin[i]>max){max=jin[i];z=i;}}
printf("%s\n%d\n%d\n",s[z],max,j);
return 0;
}
| 39 |
19,292 |
int main()
{
int i,n,zong=0,max;
int a[100],b[100],r[100];
char name[100][21],s[100],t[100],temp[20];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&name[i],&a[i],&b[i],&s[i],&t[i],&r[i]);
}
int sum[100]={0};
for(i=0;i<n;i++){
if((a[i]>80)&&(r[i]>=1)){
sum[i]+=8000;
}
if((a[i]>85)&&(b[i]>80)){
sum[i]+=4000;
}
if(a[i]>90){
sum[i]+=2000;
}
if((a[i]>85)&&(t[i]=='Y')){
sum[i]+=1000;
}
if((b[i]>80)&&(s[i]=='Y')){
sum[i]+=850;
}
}
max=sum[0];
for(i=0;i<n;i++){
if(sum[i]>max){
max=sum[i];
strcpy(temp,name[i]);
}
}
for(i=0;i<n;i++){
zong+=sum[i];
}
printf("%s\n",temp);
printf("%d\n",max);
printf("%d\n",zong);
return 0;
} | 39 |
19,293 | struct student
{
char name[30];
int sco;
int pin;
char gan;
char xi;
int lun;
};
struct student stu[100];
void main()
{
int i,j,k,m,n,a[100],sum=0,t,add=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].sco,&stu[i].pin,&stu[i].gan,&stu[i].xi,&stu[i].lun);
a[i]=0;
}
for(i=1;i<=n;i++)
{
if(stu[i].sco>80&&stu[i].lun>=1)
a[i]=a[i]+8000;
if(stu[i].sco>85&&stu[i].pin>80)
a[i]=a[i]+4000;
if(stu[i].sco>90)
a[i]=a[i]+2000;
if(stu[i].sco>85&&stu[i].xi=='Y')
a[i]=a[i]+1000;
if(stu[i].pin>80&&stu[i].gan=='Y')
a[i]=a[i]+850;
}
for(i=1;i<=n;i++)
{
if(sum<a[i])
sum=a[i];
}
for(i=1;i<=n;i++)
{
if(a[i]==sum)
{
t=i;break;
}
}
for(i=1;i<=n;i++)
{add=add+a[i];}
printf("%s\n%d\n%d",stu[t].name,sum,add);
} | 39 |
19,294 | int main()
{
struct student
{
char name[20];
int a;
int b;
char c;
char d;
int e;
struct student*next;
}student[100];
int N,i,money[100],max,sum,flag;
max=sum=0;
for(i=0;i<100;i++)
{
money[i]=0;
}
struct student *p;
scanf("%d",&N);
for(i=0;i<N;i++)
{
student[i].next=&student[i+1];
}
student[N-1].next=NULL;
p=&student[0];
i=0;
while(p!=NULL)
{
scanf("%s %d %d %c %c %d",p->name,&p->a,&p->b,&p->c,&p->d,&p->e);
if((p->a)>80&&(p->e)>0)
money[i]+=8000;
if((p->a)>85&&(p->b)>80)
money[i]+=4000;
if((p->a)>90)
money[i]+=2000;
if((p->a)>85&&(p->d)=='Y')
money[i]+=1000;
if((p->b)>80&&(p->c)=='Y')
money[i]+=850;
i++;
p=p->next;
}
for(i=0;i<N;i++)
{
if(money[i]>max)
{
max=money[i];
flag=i;
}
}
printf("%s\n",student[flag].name);
printf("%d\n",max);
for(i=0;i<N;i++)
{
sum+=money[i];
}
printf("%d",sum);
return 0;
} | 39 |
19,295 | void main()
{
struct student
{
char name[20];
int score;
int grade;
char ganbu;
char west;
int paper;
long money;
};
int a,i,j,n,sum;
char c;
struct student stu[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s%d%d%c%c%c%c%c%d",stu[i].name,&stu[i].score,&stu[i].grade,&c,&stu[i].ganbu,&c,&stu[i].west,&c,&stu[i].paper);
stu[i].money=0;
}
for(i=0;i<=n-1;i++)
{
if (stu[i].score>80&&stu[i].paper>=1)
stu[i].money=stu[i].money+8000;
if (stu[i].score>85&&stu[i].grade>80)
stu[i].money=stu[i].money+4000;
if (stu[i].score>90)
stu[i].money=stu[i].money+2000;
if (stu[i].score>85&&stu[i].west=='Y')
stu[i].money=stu[i].money+1000;
if (stu[i].grade>80&&stu[i].ganbu=='Y')
stu[i].money=stu[i].money+850;
}
j=0;
a=stu[0].money;
sum=stu[0].money;
for(i=1;i<=n-1;i++)
{
if (stu[i].money>a)
{
j=i;
a=stu[i].money;
}
sum=sum+stu[i].money;
}
printf("%s\n%d\n%d\n",stu[j].name,a,sum);
} | 39 |
19,296 |
struct fuckme
{
char name[20];
int final;
int judge;
char leader;
char west;
int paper;
}student[101];
int main()
{
int max(int total[101], int n);
int n,k,N=0;
int i;
int yuanshi[101]={0},wusi[101]={0},youxiu[101]={0},
xibu[101]={0},gongxian[101]={0},total[101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",student[i].name,&student[i].final,
&student[i].judge,&student[i].leader,&student[i].west,
&student[i].paper);
if(student[i].final>80&&student[i].paper>0)
yuanshi[i]=8000;
if(student[i].final>85&&student[i].judge>80)
wusi[i]=4000;
if(student[i].final>90)
youxiu[i]=2000;
if(student[i].final>85&& student[i].west=='Y')
xibu[i]=1000;
if(student[i].judge>80&& student[i].leader=='Y')
gongxian[i]=850;
total[i]=yuanshi[i]+wusi[i]+youxiu[i]+xibu[i]+gongxian[i];
N+=total[i];
}
k=max(total,n);
printf("%s\n%d\n%d\n",student[k].name,total[k],N);
return 0;
}
int max(int total[101], int n)
{
int a=0,j=0,k=0;
for(j=0;j<n;j++)
{
if(total[j]>a)
{
a=total[j];
k = j;
}
}
return k;
}
| 39 |
19,297 | struct student
{ int a,b,paper,total;
char leader,west,name[32];
struct student *next;
};
main()
{
int n,i,sum=0;
struct student *p1,*p2,*head,*max;
scanf("%d",&n);
p2=p1;
for(i=0;i<n;i++)
{ p1=(struct student *)malloc(L);
scanf("%s %d %d %c %c %d",p1->name,&p1->a,&p1->b,&p1->leader,&p1->west,&p1->paper);
p1->total=0;
if(p1->a>80&&p1->paper>=1) p1->total=p1->total+8000;
if(p1->a>85&&p1->b>80) p1->total=p1->total+4000;
if(p1->a>90) p1->total=p1->total+2000;
if(p1->a>85&&p1->west=='Y') p1->total=p1->total+1000;
if(p1->b>80&&p1->leader=='Y') p1->total=p1->total+850;
sum=sum+p1->total;
if(i==0){ max=p1;p2=head=p1;head->next=NULL;}
else{ if(p1->total>max->total) max=p1;
p2->next=p1;
p2=p1;p2->next=NULL;}
}
printf("%s\n%d\n%d\n",max->name,max->total,sum);
}
| 39 |
19,298 | struct info
{
char name[20];
float finalscore;
float averscore;
char leader;
char westerner;
int essay;
struct info *next;
};
int n;
struct info *setup(void)
{
int t=0;
struct info *head,*p1,*p2;
head=p2=p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %f %f %c %c %d",p1->name,&p1->finalscore,&p1->averscore,&p1->leader,&p1->westerner,&p1->essay);
while(t<n)
{
t++;
p1=(struct info*)malloc(sizeof(struct info));
p2->next=p1;
scanf("%s %f %f %c %c %d",p1->name,&p1->finalscore,&p1->averscore,&p1->leader,&p1->westerner,&p1->essay);
p2=p1;
}
return head;
}
void main()
{
long max=0,total=0,t,i=0;
struct info *p,*excellent;
scanf("%d",&n);
p=setup();
for(i=0;i<n;i++)
{
t=0;
if(p->finalscore>80&&p->essay>0)
t+=8000;
if(p->finalscore>85&&p->averscore>80)
t+=4000;
if(p->finalscore>90)
t+=2000;
if(p->westerner=='Y'&&p->finalscore>85)
t+=1000;
if(p->leader=='Y'&&p->averscore>80)
t+=850;
if(t>max)
{
max=t;
excellent=p;
}
total+=t;
p=p->next;
}
printf("%s\n%ld\n%ld\n",excellent->name,max,total);
}
| 39 |
19,299 | struct student{
char name[20];
int qimo;
int banji;
char leader;
char west;
int essay;
}stu[1000];
struct money{
long p;
int q;
}money[1000];
void main()
{
int n,i,j,max[1000]={0},mmax,k=0;
long sum=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].leader ,&stu[i].west ,&stu[i].essay);
}
for(i=0;i<n;i++)
{ money[i].p=0;
money[i].q =i;
if(stu[i].qimo >80&&stu[i].essay>=1)
money[i].p=money[i].p+8000;
if(stu[i].qimo >85&&stu[i].banji>80)
money[i].p =money[i].p +4000;
if(stu[i].qimo >90)
money[i].p =money[i].p +2000;
if(stu[i].qimo >85&&stu[i].west=='Y')
money[i].p =money[i].p +1000;
if(stu[i].banji >80&&stu[i].leader=='Y')
money[i].p =money[i].p+850;
}
j=i;
mmax=money[0].p;
for(i=0;i<j;i++)
{
if(mmax<money[i].p)
mmax=money[i].p;
}
for(i=0;i<j;i++)
if(mmax==money[i].p)
{
k=money[i].q;
break;
}
for(i=0;i<n;i++)
sum=sum+money[i].p;
printf("%s\n%ld\n%ld",stu[k].name,money[k].p,sum);
} | 39 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.