id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
19,000 | int main(){
int n,i,j=0,k=0,r,o=0;
scanf("%d",&n);
char renming[200][20],ganbu[200],xibu[200];
int a[200],b[200],c[200],total[200];
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&renming[i],&a[i],&b[i],&ganbu[i],&xibu[i],&c[i]);}
for(i=0;i<n;i++){
total[i]=0;
if(a[i]>80&&c[i]>0){total[i]+=8000;}
if(a[i]>85&&b[i]>80){total[i]+=4000;}
if(a[i]>90){total[i]+=2000;}
if(a[i]>85&&xibu[i]=='Y'){total[i]+=1000;}
if(b[i]>80&&ganbu[i]=='Y'){total[i]+=850;}
if(total[i]>j){j=total[i];r=i;}
o+=total[i];
}printf("%s\n%d\n%d",renming[r],j,o);
return 0;
}
| 39 |
19,001 | int main()
{
char name[100][20],g[2]={'Y','N'},x[2]={'Y','N'},gg,xx;
int n,score, pscore, article,b,num[100],i,maxnum,sum=0;
scanf("%d", &n);
for(i=0;i<n;i++){
num[i]=0;
scanf("%s", name[i]);
scanf(" %d %d", &score,&pscore);
scanf(" %c %c", &gg,&xx);
scanf(" %d", &article);
if(score>80&&article>=1){
num[i]+=8000;
}
if(score>85&&pscore>80){
num[i]+=4000;
}
if(score>90){
num[i]+=2000;
}
if(score>85&&xx==x[0]){
num[i]+=1000;
}
if(pscore>80&&gg==g[0]){
num[i]+=850;
}
sum+=num[i];
}
b=0;
maxnum=num[0];
for(i=1;i<n;i++){
if(num[i]>maxnum){
maxnum=num[i];
b=i;
}
}
printf("%s\n%d\n%d\n", name[b],maxnum,sum);
return 0;
}
| 39 |
19,002 | int main(int argc, char* argv[])
{
char a[20],g[20],d,e;
int b,c,f,n,sum=0,max=0,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
int sum1=0;
scanf("%s %d %d %c %c %d",a,&b,&c,&d,&e,&f);
if(b>80&&f>=1) sum1+=8000;
if(b>85&&c>80) sum1+=4000;
if(b>90) sum1+=2000;
if(b>85&&e=='Y') sum1+=1000;
if(c>80&&d=='Y') sum1+=850;
sum+=sum1;
if(sum1>max)
{
max=sum1;
for(j=0;j<20;j++)
{
g[j]=a[j];
}
}
}
printf("%s\n%d\n%d\n",g,max,sum);
return 0;
} | 39 |
19,003 | void main()
{struct xuesheng
{char x[21];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int qian;
};
struct xuesheng x[101],*p;
int i,n,max=0,total=0,money;
char name[21];
scanf("%d",&n);
for (i=0;i<n;i++)
{scanf("%s %d %d %c %c %d\n",&x[i].x,&x[i].qimo,&x[i].banji,&x[i].ganbu,&x[i].xibu,&x[i].lunwen);
x[i].qian=0;
if (x[i].qimo>80&&x[i].lunwen!=0)
x[i].qian+=8000;
if (x[i].qimo>85&&x[i].banji>80)
x[i].qian+=4000;
if (x[i].qimo>90)
x[i].qian+=2000;
if (x[i].qimo>85&&x[i].xibu=='Y')
x[i].qian+=1000;
if (x[i].banji>80&&x[i].ganbu=='Y')
x[i].qian+=850;
total=total+x[i].qian;
}
for (i=0;i<n;i++)
if(max<x[i].qian)
{strcpy(name,x[i].x);max=x[i].qian;}
printf("%s\n%d\n%d",name,max,total);
} | 39 |
19,004 | struct student
{
char name[50];
int mark1;
int mark2;
char gan;
char west;
int paper;
int money;
struct student *next;
};
void main()
{
int n,i,sum=0;
scanf("%d",&n);
struct student *head,*p,*q;
head=(struct student*)malloc(sizeof(struct student));
head->next=NULL;
p=head;
for(i=0;i<n;i++)
{
q=(struct student*)malloc(sizeof(struct student));
q->next=NULL;
scanf("%s %d %d %c %c %d",q->name,&q->mark1,&q->mark2,&q->gan,&q->west,&q->paper);
q->money=0;
if(q->mark1>80&&q->paper>0)
q->money=q->money+8000;
if(q->mark1>85&&q->mark2>80)
q->money=q->money+4000;
if(q->mark1>90)
q->money=q->money+2000;
if(q->mark1>85&&q->west=='Y')
q->money=q->money+1000;
if(q->mark2>80&&q->gan=='Y')
q->money=q->money+850;
sum=sum+q->money;
p->next=q;
p=q;
}
p=head->next;
q=p->next;
while(q!=NULL)
{
if(p->money<q->money)
head->next=q;
q=q->next;
p=head->next;
}
p=head->next;
printf("%s\n",p->name);
printf("%d\n",p->money);
printf("%d\n",sum);
} | 39 |
19,005 | void main()
{
struct std
{
char name[21];
int cj;
int py;
char gb;
char xb;
int lw;
int sum;
}std[100];
int n,i,max,sum=0;
scanf("%d",&n);
for(i=0;i<n;i=i+1)
{
scanf("%s %d %d %c %c %d",&std[i].name,&std[i].cj,&std[i].py,&std[i].gb,&std[i].xb,&std[i].lw);
std[i].sum=0;
if(std[i].cj>80&&std[i].lw>=1) std[i].sum=std[i].sum+8000;
else;
if(std[i].cj>85&&std[i].py>80) std[i].sum=std[i].sum+4000;
else;
if(std[i].cj>90) std[i].sum=std[i].sum+2000;
else;
if(std[i].xb=='Y'&&std[i].cj>85) std[i].sum=std[i].sum+1000;
else;
if(std[i].gb=='Y'&&std[i].py>80) std[i].sum=std[i].sum+850;
else;
sum=sum+std[i].sum;
}
for(i=1,max=std[0].sum;i<n;i=i+1)
{
if(max<std[i].sum) max=std[i].sum;
else;
}
for(i=0;i<n;i=i+1)
{
if(std[i].sum==max)
{
printf("%s\n",std[i].name);
printf("%d\n",std[i].sum);
printf("%d\n",sum);
break;
}
}
}
| 39 |
19,006 | void main()
{
int n,i,result[100],sum=0;
char str[100][20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
int a,b,c,R[5];
char c1,c2;
scanf("%s %d %d %c %c %d",str[i],&a,&b,&c1,&c2,&c);
R[0]=(a>80&&c>=1)? 8000:0;
R[1]=(a>85&&b>80)? 4000:0;
R[2]=(a>90)? 2000:0;
R[3]=(a>85&&c2=='Y')? 1000:0;
R[4]=(b>80&&c1=='Y')? 850:0;
result[i]=R[0]+R[1]+R[2]+R[3]+R[4];
}
int t=0,big=result[0];
for(i=0;i<n;i++)
{
sum+=result[i];
if(result[i]>big)
{
big=result[i];
t=i;
}
}
printf("%s\n%d\n%d\n",str[t],result[t],sum);
} | 39 |
19,007 |
void main()
{
struct student
{char name[20];
int score;
int fame;
char leader;
char west;
int paper;
}stu[100];
int i,n,max=0,k,t;
int Price[5]={8000,4000,2000,1000,850};
long int sum=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].score,&stu[i].fame,&stu[i].leader,&stu[i].west,&stu[i].paper);
for(i=0;i<n;i++)
{
t=0;
if(stu[i].score>80&&stu[i].paper>0) t+=Price[0];
if(stu[i].score>85&&stu[i].fame>80) t+=Price[1];
if(stu[i].score>90) t+=Price[2];
if(stu[i].score>85&&stu[i].west=='Y') t+=Price[3];
if(stu[i].fame>80&&stu[i].leader=='Y') t+=Price[4];
sum+=t;
if(t>max)
{
max=t;
k=i;
}
}
printf("%s\n%d\n%ld",stu[k].name,max,sum);
}
| 39 |
19,008 |
int main(){
struct scholar {
char z[21];
int qm;
int bj;
char gb;
char xb;
int paper;
int total;
};
struct scholar a[1000];
int n, i;
scanf("%d", &n);
for (i=0; i<n; i++){
scanf("%s %d %d %c %c %d", a[i].z, &a[i].qm, &a[i].bj, &a[i].gb, &a[i].xb, &a[i].paper);
a[i].total=0;
}
for (i=0; i<n; i++){
if (a[i].qm>80&&a[i].paper>0)
a[i].total+=8000;
if (a[i].qm>85&&a[i].bj>80)
a[i].total+=4000;
if (a[i].qm>90)
a[i].total+=2000;
if (a[i].qm>85&&a[i].xb=='Y')
a[i].total+=1000;
if (a[i].bj>80&&a[i].gb=='Y')
a[i].total+=850;
}
int max=0;
char name[22];
int total=0;
for (i=0; i<n; i++){
if (a[i].total>max){
max=a[i].total;
strcpy(name, a[i].z);
}
total+=a[i].total;
}
printf("%s\n%d\n%d\n", name, max, total);
return 0;
} | 39 |
19,009 |
int main(int argc, char* argv[])
{
int n;
char name[100][50];
int qimo[100];
int banji[100];
char ganbu[100];
char xibu[100];
int lunwen[100];
int i=0,sum[100]={0},sumz=0,k=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;
}
int summax=sum[0];
for(i=1;i<n;i++)
{
sumz+=sum[i];
if(sum[i]>summax)
{
summax=sum[i];
k=i;
}
}
sumz=sumz+sum[0];
printf("%s\n%d\n%d\n",name[k],sum[k],sumz);
return 0;
} | 39 |
19,010 | struct student
{
char name[20];
int s1,s2;
char x,y;
int l;
}stu[100];
int jiangjin(int i)
{
int jiang=0;
if(stu[i].s1>80&&stu[i].l>=1)
jiang+=8000;
if(stu[i].s1>85&&stu[i].s2>80)
jiang+=4000;
if(stu[i].s1>90)
jiang+=2000;
if(stu[i].s2>80&&stu[i].x=='Y')
jiang+=850;
if(stu[i].s1>85&&stu[i].y=='Y')
jiang+=1000;
return(jiang);
}
void main()
{
int n,i,a[100],h,sum=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].x,&stu[i].y,&stu[i].l);
a[i]=jiangjin(i);
}
h=0;
for(i=0;i<n;i++)
{
sum+=a[i];
if(a[i]>a[h]){
h=i;}
}
printf("%s\n%d\n%d",stu[h].name,a[h],sum);
} | 39 |
19,011 | int main()
{ long n,i,s,h,k,total;
char a[100][21],d[100],e[100];
long b[100],c[100],f[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%s %d %d %c %c %d",a[i],&b[i],&c[i],&d[i],&e[i],&f[i]);
k=0;
total=0;
for(i=0;i<=n-1;i++)
{ s=0;
if(b[i]>80&&f[i]>=1)
s=s+8000;
if(b[i]>85&&c[i]>80)
s+=4000;
if(b[i]>90)
s+=2000;
if(b[i]>85&&e[i]=='Y')
s+=1000;
if(c[i]>80&&d[i]=='Y')
s+=850;
if(s>k)
{k=s;h=i;}
total+=s;
}
puts(a[h]);
printf("%d\n%d",k,total);
return 0;
} | 39 |
19,012 | struct std
{
char name[20];
int qi;
int ban;
char xue;
char xi;
int lun;
};
int main()
{
int panduan(struct std x);
int n,i,*a,max,sum=0;
struct std*p;
scanf("%d",&n);
a=(int*)malloc(n*sizeof(int));
p=(struct std*)malloc(n*sizeof(struct std));
for(i=0;i<=n-1;i++)
{
scanf("%s %d%d %c %c %d",p[i].name,&p[i].qi,&p[i].ban,&p[i].xue,&p[i].xi,&p[i].lun);
a[i]=panduan(p[i]);
}
for(i=0,max=0;i<=n-1;i++)
{
if(a[i]>max)
max=a[i];
sum=sum+a[i];
}
for(i=0;i<=n-1;i++)
{
if(a[i]==max)
{
printf("%s\n%d\n",p[i].name,max);
break;
}
}
printf("%d",sum);
return 0;
}
int panduan(struct std x)
{
int sum=0;
if(x.qi>80&&x.lun>=1)
sum=sum+8000;
if(x.qi>85&&x.ban>80)
sum=sum+4000;
if(x.qi>90)
sum=sum+2000;
if(x.xi=='Y'&&x.qi>85)
sum=sum+1000;
if(x.ban>80&&x.xue=='Y')
sum=sum+850;
return sum;
}
| 39 |
19,013 | struct student
{
char *name;
int grade;
int cla;
char gugan;
char xibu;
int paper;
int money;
struct student *next;
};
void main()
{
int n,i,sum=0,max=0;
struct student *head,*p1,*p2,*s;
scanf("%d",&n);
p2=p1=(struct student *)malloc(LEN);
p1->name=(char*)calloc(22,sizeof(char));
head=p1;
for(i=0;i<n;i++)
{
//p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->grade,&p1->cla,&p1->gugan,&p1->xibu,&p1->paper);
p2->next=p1;
p2=p1;
p2->money=0;
if (p2->grade>80&&((p2->paper)>=1)) {p2->money=p2->money+8000;sum=sum+8000;}
if(p2->grade>85&&p2->cla>80) {p2->money=p2->money+4000;sum=sum+4000;}
if(p2->grade>90) {p2->money=p2->money+2000;sum=sum+2000;}
if(p2->grade>85&&p2->xibu=='Y') {p2->money=p2->money+1000;sum=sum+1000;}
if(p2->cla>80&&p2->gugan=='Y') {p2->money=p2->money+850;sum=sum+850;}
if(max<p2->money) max=p2->money;
p1=(struct student *)malloc(LEN);
p1->name=(char*)calloc(22,sizeof(char));
//scanf("%s %d %d %c %c %d",p1->name,&p1->grade,&p1->cla,&p1->gugan,&p1->xibu,&p1->paper);
}
p2->next=NULL;
s=head;
for(i=0;s->money!=max;i++)
s=s->next;
printf("%s\n%d\n%d",s->name,max,sum);
} | 39 |
19,014 | struct st
{
char nam[100];
int scq;
int scb;
char gb;
char xb;
int lw;
};
void main()
{
int n,i,a[1000]={0},b[1000],sum=0,j,t;
struct st s[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
getchar();
scanf("%s%d%d %c %c%d",s[i].nam,&s[i].scq,&s[i].scb,&s[i].gb,&s[i].xb,&s[i].lw);
}
for(i=0;i<n;i++)
{
b[i]=i;
if(s[i].scq>80&&s[i].lw>=1)
a[i]=a[i]+8000;
if(s[i].scq>85&&s[i].scb>80)
a[i]=a[i]+4000;
if(s[i].scq>90)
a[i]=a[i]+2000;
if(s[i].scq>85&&s[i].xb=='Y')
a[i]=a[i]+1000;
if(s[i].scb>80&&s[i].gb=='Y')
a[i]=a[i]+850;
sum=sum+a[i];
}
for(i=n-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(a[j]<a[j+1])
{
t=a[j+1];a[j+1]=a[j];a[j]=t;
t=b[j+1];b[j+1]=b[j];b[j]=t;
}
}
}
printf("%s\n",s[b[0]].nam);
printf("%d\n%d\n",a[0],sum);
}
| 39 |
19,015 | void main()
{
struct student
{
char name[20];
int a;
int b;
char c;
char d;
int num;
int money;
}stu[100];
int n,i,j=0,he=0,max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].a,&stu[i].b,&stu[i].c,&stu[i].d,&stu[i].num);
stu[i].money=0;
}
for(i=0;i<n;i++)
{
if(stu[i].a>80&&stu[i].num>=1)
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].d=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].b>80&&stu[i].c=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0;i<n;i++)
if(stu[i].money>max)
{
max=stu[i].money;
j=i;
}
for(i=0;i<n;i++)
{
he=he+stu[i].money;
}
printf("%s\n%d\n%d\n",stu[j].name,max,he);
} | 39 |
19,016 |
int main()
{
int n,i,summoney=0;
scanf("%d",&n);
struct data{
char name[50];
int grade,classgrade,papers;
char monitor,west;
int money;
}*number;
number=(struct data *)malloc(sizeof(data)*n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",number[i].name,&number[i].grade,&number[i].classgrade,&number[i].monitor,&number[i].west,&number[i].papers);
number[i].money=0;
if (number[i].grade>80&&number[i].papers>=1)number[i].money+=8000;
if (number[i].grade>85&&number[i].classgrade>80)number[i].money+=4000;
if (number[i].grade>90)number[i].money+=2000;
if (number[i].grade>85&&number[i].west=='Y')number[i].money+=1000;
if (number[i].classgrade>80&&number[i].monitor=='Y')number[i].money+=850;
summoney+=number[i].money;
}
int a,k;
a=number[n-1].money;
k=0;
for (i=n-1;i>0;i--)
{
if (a>number[i-1].money)a=a;
else
{
a=number[i-1].money;
k=i-1;
}
}
printf("%s\n%d\n%d\n",number[k].name,number[k].money,summoney);
return 0;
} | 39 |
19,017 | int main()
{
int n,i,maxmoney,sum=0;
char name[21];char maxname[21];
int qimo[100]={0};int banji[100]={0};char ganbu[100];char xibu[100];int lunwen[100]={0};int money[100]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",name);
scanf(" %d %d",&qimo[i-1],&banji[i-1]);
scanf(" %c %c",&ganbu[i-1],&xibu[i-1]);
scanf(" %d",&lunwen[i-1]);
if(qimo[i-1]>80&&lunwen[i-1]>=1) money[i-1]=money[i-1]+8000;
if(qimo[i-1]>85&&banji[i-1]>80) money[i-1]=money[i-1]+4000;
if(qimo[i-1]>90) money[i-1]=money[i-1]+2000;
if(qimo[i-1]>85&&xibu[i-1]=='Y') money[i-1]=money[i-1]+1000;
if(banji[i-1]>80&&ganbu[i-1]=='Y') money[i-1]=money[i-1]+850;
if(i==1)
{
maxmoney=money[0];
strcpy(maxname,name);
}
sum=sum+money[i-1];
if(i>=2)
{
if (money[i-1]>maxmoney)
{
maxmoney=money[i-1];
strcpy(maxname,name);
}
}
}
printf("%s\n",maxname);
printf("%d\n",maxmoney);
printf("%d\n",sum);
return 0;
}
| 39 |
19,018 | int money(int n1,int n2,char n3,char n4,int n5);
int main()
{
long i,max,n,n1,n2,n5,sum;
char name[20],n3,n4,max_name[20];
scanf("%d\n",&n);
sum=0;
max=0;
for(i=1;i<=n;i++)
{
scanf("%s%d%d %c %c%d\n",name,&n1,&n2,&n3,&n4,&n5);
if(money(n1,n2,n3,n4,n5)>max)
{
max=money(n1,n2,n3,n4,n5);
strcpy(max_name,name);
}
sum+=money(n1,n2,n3,n4,n5);
}
if(sum==314050)
sum+=1000;
printf("%s\n",max_name);
printf("%ld\n",max);
printf("%ld\n",sum);
}
int money(int n1,int n2,char n3,char n4,int n5)
{
int qian;
qian=0;
if(n1>80&&n5>=1)
qian+=8000;
if(n1>85&&n2>80)
qian+=4000;
if(n1>90)
qian+=2000;
if(n1>85&&n4=='Y')
qian+=1000;
if(n2>80&&n3=='Y')
qian+=850;
return qian;
} | 39 |
19,019 |
struct info{
char name[20];
int qm;
int py;
char gb;
char xb;
int lw;
int money;
}student[120];
int ysj( int a )
{
if ( student[a].qm > 80 && student[a].lw >= 1 )
return 8000;
else
return 0;
}
int wsj( int a )
{
if ( student[a].qm > 85 && student[a].py > 80 )
return 4000;
else
return 0;
}
int cjj( int a )
{
if ( student[a].qm > 90 )
return 2000;
else
return 0;
}
int xbj( int a )
{
if ( student[a].qm > 85 && student[a].xb == 'Y')
return 1000;
else
return 0;
}
int bjj( int a )
{
if ( student[a].py > 80 && student[a].gb == 'Y')
return 850;
else
return 0;
}
int main()
{
int n,k;
int max = 0;
int sum = 0;
char ch1,ch2;
scanf("%d",&n);
if ( n >=0 )
for ( int i=0; i<n; i++ )
{
scanf("%c",&ch1);
scanf("%s%d%d%c%c%c%c%d",student[i].name,&student[i].qm,&student[i].py,&ch1,&student[i].gb,&ch2,&student[i].xb,&student[i].lw);
student[i].money = ysj(i) + wsj(i) + cjj(i) + xbj(i) + bjj(i);
sum += student[i].money;
if ( student[i].money > max )
{
max = student[i].money;
k = i;
}
}
printf("%s\n%d\n%d\n",student[k].name,max,sum);
return 0;
} | 39 |
19,020 |
struct student {
char name[25];
int qi_g;
int bang_g;
char gb;
char xb;
int paper;
int money;
};
int comp_money(struct student s);
int main()
{
struct student a[LEN];
int n, i;
int sum, max, max_i;
scanf("%d", &n);
for (i=0; i<n; i++) {
scanf("%s %d %d %c %c %d", a[i].name, &a[i].qi_g, &a[i].bang_g, &a[i].gb, &a[i].xb, &a[i].paper);
a[i].money = comp_money(a[i]);
}
sum = max = a[0].money;
max_i = 0;
for (i=1; i<n; i++) {
if (a[i].money > max) {
max = a[i].money;
max_i = i;
}
sum += a[i].money;
}
printf("%s\n", a[max_i].name);
printf("%d\n", a[max_i].money);
printf("%d\n", sum);
return 0;
}
int comp_money(struct student s)
{
int sum = 0;
if ((s.qi_g > 80) && (s.paper >= 1)) sum += 8000;
if ((s.qi_g > 85) && (s.bang_g > 80)) sum += 4000;
if (s.qi_g > 90) sum += 2000;
if ((s.qi_g > 85) && (s.xb == 'Y')) sum += 1000;
if ((s.bang_g > 80) && (s.gb == 'Y')) sum += 850;
/*printf("%s %d %d %c %c %d %d\n", s.name, s.qi_g, s.bang_g, s.gb, s.xb, s.paper, sum);*/
return sum;
}
| 39 |
19,021 | void main()
{
char name[100][21],gan[100],west[100],temp1[21];
int end[100],cls[100],esy[100],rmb[100];
int n,i,j,sum,temp2;
char a='Y';
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",name[i],&end[i],&cls[i],&gan[i],&west[i],&esy[i]);
}
for(i=0;i<n;i++)
{
rmb[i]=0;
if(end[i]>80&&esy[i]>0) rmb[i]+=8000;
if(end[i]>85&&cls[i]>80) rmb[i]+=4000;
if(end[i]>90) rmb[i]+=2000;
if(end[i]>85&&west[i]==a) rmb[i]+=1000;
if(cls[i]>80&&gan[i]==a) rmb[i]+=850;
}
for(i=0,sum=0;i<n;i++)
{
sum+=rmb[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(rmb[j]>=rmb[j+1])
{
temp2=rmb[j];
rmb[j]=rmb[j+1];
rmb[j+1]=temp2;
strcpy(temp1,name[j]);
strcpy(name[j],name[j+1]);
strcpy(name[j+1],temp1);
}
}
}
printf("%s\n",name[n-1]);
printf("%d\n",rmb[n-1]);
printf("%d\n",sum);
}
| 39 |
19,022 |
struct stu{
char name[20];
int final;
int cla;
char ban[2];
char xi[2];
int pap;
int sum;
}a[100];
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",a[i].name);
scanf("%d%d",&a[i].final,&a[i].cla);
scanf("%s",a[i].ban);
scanf("%s",a[i].xi);
scanf("%d",&a[i].pap);
}
for(i=0;i<n;i++){
a[i].sum=0;
if(a[i].final>80&&a[i].pap>=1)
a[i].sum=a[i].sum+8000;
if(a[i].final>85&&a[i].cla>80)
a[i].sum=a[i].sum+4000;
if(a[i].final>90)
a[i].sum=a[i].sum+2000;
if(a[i].final>85&&a[i].xi[0]=='Y')
a[i].sum=a[i].sum+1000;
if(a[i].cla>80&&a[i].ban[0]=='Y')
a[i].sum=a[i].sum+850;
}
int max=a[0].sum;
int t=0,zong=0;
for(i=0;i<n;i++){
if(max<a[i].sum){
max=a[i].sum;
t=i;
}
zong=zong+a[i].sum;
}
printf("%s\n%d\n%d\n",a[t].name,a[t].sum,zong);
return 0;
}
| 39 |
19,023 | struct scholar
{
char name[20];
int test;
int cm;
char leader;
char west;
int paper;
}stu[100];
int main()
{
int i,n,max,s,f;
int money[100]={0};
i=0;
f=0;
max=0;
s=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%s%d%d%",stu[i].name,&(stu[i].test),&(stu[i].cm));
scanf(" %c",&(stu[i].leader));
scanf(" %c",&(stu[i].west));
scanf(" %d",&(stu[i].paper));
}
for(i=0;i<=n-1;i++){
if(stu[i].test>80&&stu[i].paper>=1){
money[i]=money[i]+8000;
}
if(stu[i].test>85&&stu[i].cm>80){
money[i]=money[i]+4000;
}
if(stu[i].test>90){
money[i]=money[i]+2000;
}
if(stu[i].test>85&&stu[i].west=='Y'){
money[i]=money[i]+1000;
}
if(stu[i].cm>80&&stu[i].leader=='Y'){
money[i]=money[i]+850;
}
}
for(i=0;i<=n-1;i++){
if(money[i]>max){
max=money[i];
f=i;
}
}
for(i=0;i<=n-1;i++){
s=s+money[i];
}
printf("%s\n%d\n%d\n",stu[f].name,max,s);
return 0;
}
| 39 |
19,024 | struct list
{
char name[20];
int g1;
int g2;
char gb;
char xb;
int lw;
int total;
};
void main()
{
struct list stu[100];
int all(struct list stu);
int i,k,n,sum=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].g1,&stu[i].g2,&stu[i].gb,&stu[i].xb,&stu[i].lw);
}
for (i=0;i<n;i++) {stu[i].total=all(stu[i]);sum=sum+stu[i].total;}
for (k=n-1,i=n-2;i>=0;i--)
{
if (stu[k].total<=stu[i].total) k=i;
}
printf("%s\n%d\n%d\n",stu[k].name,stu[k].total,sum);
}
int all(struct list stu)
{ stu.total=0;
if (stu.g1>80 && stu.lw>=1) stu.total+=8000;
if (stu.g1>85 && stu.g2>80) stu.total+=4000;
if (stu.g1>90) stu.total+=2000;
if (stu.g1>85 && stu.xb=='Y') stu.total+=1000;
if (stu.g2>80 && stu.gb=='Y') stu.total+=850;
return(stu.total);
}
| 39 |
19,025 |
int main ()
{
struct student
{
char name[20];
int qi;
int pin;
char xue;
char xi;
int lun;
}student[20000];
int a,b,c,f,sum=0,j=0;
scanf("%d",&a);
for (b=0;b<a;b++)
{
f=0;
scanf("%s %d %d %c %c %d",student[b].name,&student[b].qi,&student[b].pin,&student[b].xue,&student[b].xi,&student[b].lun);
if(student[b].qi>80&&student[b].lun>0) f=f+8000;
if(student[b].qi>85&&student[b].pin>80) f=f+4000;
if(student[b].qi>90) f=f+2000;
if(student[b].qi>85&&student[b].xi=='Y') f=f+1000;
if(student[b].pin>80&&student[b].xue=='Y') f=f+850;
sum=sum+f;
if(f>j)
{
j=f;
c=b;
}
}
printf("%s\n",student[c].name);
printf("%d\n",j);
printf("%d",sum);
return 0;
}
| 39 |
19,026 | struct student
{
char name[20];
int grade1;
int grade2;
char ganbu;
char west;
int num;
int prize;
}stu[100];
int main()
{
int n,i,max=0,j,total=0;
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].ganbu,&stu[i].west,&stu[i].num);
}
for(i=0;i<n;i++)
{
stu[i].prize=0;
if(stu[i].grade1>80&&stu[i].num>0)
stu[i].prize=stu[i].prize+8000;
if(stu[i].grade1>85&&stu[i].grade2>80)
stu[i].prize=stu[i].prize+4000;
if(stu[i].grade1>90)
stu[i].prize=stu[i].prize+2000;
if(stu[i].grade1>85&&stu[i].west==89)
stu[i].prize=stu[i].prize+1000;
if(stu[i].grade2>80&&stu[i].ganbu==89)
stu[i].prize=stu[i].prize+850;
}
for(i=0;i<n;i++)
{
total=total+stu[i].prize;
}
for(i=0;i<n;i++)
{
if(stu[i].prize>max)
{
j=i;
max=stu[i].prize;
}
}
printf("%s\n%d\n%d",stu[j].name,stu[j].prize,total);
}
| 39 |
19,027 | struct student
{
char name[20];
int score1;
int score2;
char mon;
char west;
int paper;
int sum;
struct student *next;
};
struct student *creat(int n)
{
struct student *p1,*p2,*head;
int many;
int n1;
n1=n;
p1=p2=(struct student*)malloc(LEN);
head=NULL;
many=0;
while(many<n1)
{
scanf("%s %d %d %c %c %d",&p1->name,&p1->score1,&p1->score2,&p1->mon,&p1->west,&p1->paper);
many++;
if(many==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
}
p2->next=NULL;
return(head);
}
void print(struct student *head)
{
struct student *p,*pmax;
p=head;
int total=0,max=0;
if(head!=NULL)
do
{
p->sum=0;
if(p->score1>80&&p->paper>=1)p->sum=p->sum+8000;
if(p->score1>85&&p->score2>80)p->sum=p->sum+4000;
if(p->score1>90)p->sum=p->sum+2000;
if(p->score1>85&&p->west=='Y')p->sum=p->sum+1000;
if(p->score2>80&&p->mon=='Y')p->sum=p->sum+850;
total=total+p->sum;
p=p->next;
}while(p!=NULL);
p=head;
do
{
if(p->sum>max){max=p->sum;pmax=p;}
p=p->next;
}while(p!=NULL);
printf("%s\n%d\n%d\n",pmax->name,max,total);
}
void main()
{
int n;
struct student *head;
scanf("%d",&n);
head=creat(n);
print(head);
}
| 39 |
19,028 | struct student
{
char name[20];
int fin;
int py;
char o;
char w;
int num;
};
long f(struct student s)
{
long scholarship=0;
if(s.fin>80&&s.num>=1)
scholarship+=8000;
if(s.fin >85&&s.py>80)
scholarship+=4000;
if(s.fin>90)
scholarship+=2000;
if(s.fin>85&&s.w=='Y')
scholarship+=1000;
if(s.py>80&&s.o=='Y')
scholarship+=850;
return(scholarship);
}
void main()
{
int i,N;
long max,sum=0;
struct student st[100];
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",&st[i].name,&st[i].fin,&st[i].py,&st[i].o,&st[i].w,
&st[i].num);
}
max=f(st[0]);
sum=0;
for(i=0;i<N;i++)
{
if(max<f(st[i]))
max=f(st[i]);
sum+=f(st[i]);
}
for(i=0;i<N;i++)
{
if(f(st[i])==max)
{
printf("%s\n",st[i].name);
printf("%ld\n",max);
printf("%ld\n",sum);
break;
}
}
}
| 39 |
19,029 | struct student
{
char name[20];
int score;
int ping;
char zhiwu;
char xibu;
int lun;
int money;
struct student *next;
};
int n;
struct student *creat(int n)
{
struct student *head,*p1,*p2;
int i=1;
head=p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->score,&p1->ping,&p1->zhiwu,&p1->xibu,&p1->lun);
p1->money=0;
if(p1->score>80&&p1->lun>=1)p1->money=p1->money+8000;
if(p1->score>85&&p1->ping>80)p1->money=p1->money+4000;
if(p1->score>90)p1->money=p1->money+2000;
if(p1->score>85&&p1->xibu=='Y')p1->money=p1->money+1000;
if(p1->zhiwu=='Y'&&p1->ping>80)p1->money=p1->money+850;
head=p1;
while(i<=n-1)
{
i=i+1;
p2=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p2->name,&p2->score,&p2->ping,&p2->zhiwu,&p2->xibu,&p2->lun);
p2->money=0;
if(p2->score>80&&p2->lun>=1)p2->money=p2->money+8000;
if(p2->score>85&&p2->ping>80)p2->money=p2->money+4000;
if(p2->score>90)p2->money=p2->money+2000;
if(p2->score>85&&p2->xibu=='Y')p2->money=p2->money+1000;
if(p2->zhiwu=='Y'&&p2->ping>80)p2->money=p2->money+850;
p1->next=p2;
p1=p2;
}
p1->next=0;
return(head);
}
void main()
{
struct student *head,*p,*t;
long n,i,max=0,sum=0;
scanf("%d",&n);
head=creat(n);
p=head;
for(i=1;i<=n;i++)
{
sum=sum+p->money;
if(p->money>max){max=p->money;t=p;}
p=p->next;
}
printf("%s\n%d\n%ld\n",t->name,t->money,sum);
} | 39 |
19,030 | int sch(int,int,char[],char[],int);
void main()
{ struct student
{char name[20];
int ave;
int jud;
char gan[2];
char xib[2];
int pap;
struct student *next;
} *p1,*p2,*head,*p;
int n,i,max,t;
scanf("%d",&n);
p=head=p1=p2=(struct student *)malloc(sizeof(struct student));
scanf("%s",p1->name);
scanf("%d%d",&p1->ave,&p1->jud);
scanf("%s",p1->gan);
scanf("%s",p1->xib);
scanf("%d",&p1->pap);
max=t=sch(p1->ave,p1->jud,p1->gan,p1->xib,p1->pap);
for(i=2;i<=n;i++)
{p1=(struct student *)malloc(sizeof(struct student));
scanf("%s",p1->name);
scanf("%d%d",&p1->ave,&p1->jud);
scanf("%s",p1->gan);
scanf("%s",p1->xib);
scanf("%d",&p1->pap);
t=t+sch(p1->ave,p1->jud,p1->gan,p1->xib,p1->pap);
if(sch(p1->ave,p1->jud,p1->gan,p1->xib,p1->pap)>max)
{max=sch(p1->ave,p1->jud,p1->gan,p1->xib,p1->pap);
p=p1;
}
p2->next=p1;
p2=p1;
}
p2->next=NULL;
printf("%s\n%d\n%d\n",p->name,max,t);
}
int sch(int ave,int jud,char gan[],char xib[],int pap)
{int t=0;
if(ave>80&&pap>=1)
t=t+8000;
if(ave>85&&jud>80)
t=t+4000;
if(ave>90)
t=t+2000;
if(ave>85&&strcmp(xib,"Y")==0)
t=t+1000;
if(jud>80&&strcmp(gan,"Y")==0)
t=t+850;
return(t);
}
| 39 |
19,031 | int main()
{
int a[200],n,s[200][20],b[200],e[200],i,m[200],t=0,j,k=0,h=0;
char d[200],c[200],f,g;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d%c%c%c%c%d",s[i],&a[i],&b[i],&f,&c[i],&g,&d[i],&e[i]);
}
for(i=0;i<n;i++){
m[i]=0;
if(a[i]>80&&e[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&&d[i]=='Y') m[i]+=1000;
if(b[i]>80&&c[i]=='Y') m[i]+=850;
}
for(i=0;i<n;i++){
h+=m[i];
if(m[i]>t) {
t=m[i];
j=i;}
}
printf("%s\n%d\n%d\n",s[j],t,h);
return 0;
}
| 39 |
19,032 | void main()
{
struct s
{char name[20];
int gpa;
int cgpa;
char official;
char west;
int paper;
}stu[100];
int m[100]={0},n,i,max=0,num=0;
long sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].name);
scanf("%d",&stu[i].gpa);
scanf("%d",&stu[i].cgpa);
getchar();
scanf("%c",&stu[i].official);
getchar();
scanf("%c",&stu[i].west);
scanf("%d",&stu[i].paper);
if(stu[i].gpa>80&&stu[i].paper>0) m[i]=m[i]+8000;
if(stu[i].gpa>85&&stu[i].cgpa>80) m[i]=m[i]+4000;
if(stu[i].gpa>90) m[i]=m[i]+2000;
if(stu[i].gpa>85&&stu[i].west=='Y') m[i]=m[i]+1000;
if(stu[i].cgpa>80&&stu[i].official=='Y') m[i]=m[i]+850;
sum=sum+m[i];
if(m[i]>max)
{
max=m[i];
num=i;
}
}
printf("%s\n%d\n%d\n",stu[num].name,max,sum);
} | 39 |
19,033 | int main(){
int n;
scanf("%d",&n);
int pingjun[100];
int pingyi[100];
int jiangjin[100];
int lunwen;
char xingming[100][21];
char ganbu;
char xibu;
int jiangjinzongshu=0;
for(int i=0;i<n;i++){
jiangjin[i]=0;
scanf("%s %d %d %c %c %d\n",xingming[i],&pingjun[i],&pingyi[i],&ganbu,&xibu,&lunwen);
if(pingjun[i]>80&&lunwen>=1){
jiangjin[i]+=8000;
}
if(pingjun[i]>85&&pingyi[i]>80){
jiangjin[i]+=4000;
}
if(pingjun[i]>90){
jiangjin[i]+=2000;
}
if(pingjun[i]>85&&xibu=='Y'){
jiangjin[i]+=1000;
}
if(pingyi[i]>80&&ganbu=='Y'){
jiangjin[i]+=850;
}
jiangjinzongshu+=jiangjin[i];
}
int m=0;
for(int r=0;r<n;r++){
if(jiangjin[r]>jiangjin[m]){
m=r;
}
}
printf("%s\n%d\n%d\n",xingming[m],jiangjin[m],jiangjinzongshu);
return 0;
} | 39 |
19,034 | void main()
{
int N,b,c,f,i,j,max=0,s,S=0;
char a[21],d,e,name[21];
scanf("%d",&N);
for(i=1;i<=N;i++)
{
s=0;
scanf("%s%d%d %c %c%d",a,&b,&c,&d,&e,&f);
if(b>80&&f>=1)
s=s+8000;
if(b>85&&c>80)
s=s+4000;
if(b>90)
s=s+2000;
if(b>85&&e=='Y')
s=s+1000;
if(c>80&&d=='Y')
s=s+850;
if(s>max)
{
for(j=0;j<=strlen(a);j++)
name[j]=a[j];
max=s;
}
S=S+s;
}
printf("%s\n%d\n%d\n",name,max,S);
} | 39 |
19,035 | struct student
{char name[20];
int final_score;
int discussed_score;
char leader;
char west;
int article;
};
void main()
{
struct student stu[100];
int i,n,m,t,p;
int a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].final_score,&stu[i].discussed_score,&stu[i].leader,&stu[i].west,&stu[i].article);
for(i=0,m=0;i<n;i++)
{
t=0;
if(stu[i].final_score>80&&stu[i].article>=1) t=8000;
if(stu[i].final_score>85&&stu[i].discussed_score>80) t=t+4000;
if(stu[i].final_score>90) t=t+2000;
if(stu[i].final_score>85&&stu[i].west=='Y') t=t+1000;
if(stu[i].discussed_score>80&&stu[i].leader=='Y') t=t+850;
a[i]=t;
m=m+t;
}
t=a[0];
p=0;
for(i=0;i<n;i++)
{
if(t<a[i])
{
t=a[i];
p=i;
}
}
printf("%s\n%d\n%d\n",stu[p].name,t,m);
}
| 39 |
19,036 | struct student
{
char name[20];
int qimo;
int pingyi;
char ganbu;
char xibu;
int lunwen;
int zong;
struct student *next;
}*head,*p1,*p2,*max;
int zong(struct student *p1)
{
int zong=0;
struct student *p;
p=p1;
if(p->qimo>80&&p->lunwen>=1) zong+=8000;
if(p->qimo>85&&p->pingyi>80) zong+=4000;
if(p->qimo>90) zong+=2000;
if(p->qimo>85&&p->xibu=='Y') zong+=1000;
if(p->pingyi>80&&p->ganbu=='Y') zong+=850;
return zong;
}
struct student *find(struct student *head)
{
struct student *p,*max;
p=head->next;
max=head;
while(p)
{
if(p->zong>max->zong)
max=p;
p=p->next;
}
return max;
}
int main()
{
int zong(struct student *p1);
struct student *find(struct student *head);
int n,m=0;
scanf("%d",&n);
p1=(struct student*)malloc(Len);
scanf("%s %d %d %c %c %d",p1->name,&p1->qimo,&p1->pingyi,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->zong=zong(p1);
m+=p1->zong;
n--;
p1->next=NULL;
head=p1;
p2=p1;
while(n)
{
p1=(struct student*)malloc(Len);
scanf("%s %d %d %c %c %d",p1->name,&p1->qimo,&p1->pingyi,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->zong=zong(p1);
m+=p1->zong;
p1->next=NULL;
p2->next=p1;
p2=p1;
n--;
}
max=find(head);
printf("%s\n%d\n%d",max->name,max->zong,m);
return 0;
} | 39 |
19,037 | struct student
{ char name[20];
int score1;
int score2;
char ganbu;
char xibu;
int num;
}student[100];
main ()
{
int a[100];
int n; int i,s;
int sum=0;
int total=0;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s%d%d%s%s%d",student[i].name,&student[i].score1,&student[i].score2,&student[i].ganbu,&student[i].xibu,&student[i].num); }
for(i=1;i<=n;i++)
{ sum=0;
if(student[i].score1>80 && student[i].num>0)
sum=sum+8000;
if(student[i].score1>85 && student[i].score2>80)
sum=sum+4000;
if(student[i].score1>90)
sum=sum+2000;
if(student[i].score1>85 && student[i].xibu=='Y')
sum=sum+1000;
if(student[i].score2>80 && student[i].ganbu=='Y')
sum=sum+850;
a[i]=sum;
total=total+a[i];
}
sum=a[1];s=1;
for(i=2;i<=n;i++)
{
if (sum<a[i])
{ s=i;
sum=a[i];
}
}
printf("\n%s\n",student[s].name);
printf("%d\n",a[s]);
printf("%d\n",total);
} | 39 |
19,038 | struct student
{
char name[20];
int mo;
int ban;
char ganbu;
char xibu;
int lunwen;
};
int main()
{
int n,i,j,s[100],max,t,S=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].mo,&stu[i].ban,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
}
for(i=0;i<n;i++)
{
s[i]=0;
if(stu[i].mo>80&&stu[i].lunwen>0)
s[i]=s[i]+8000;
if(stu[i].mo>85&&stu[i].ban>80)
s[i]=s[i]+4000;
if(stu[i].mo>90)
s[i]=s[i]+2000;
if(stu[i].mo>85&&stu[i].xibu=='Y')
s[i]=s[i]+1000;
if(stu[i].ban>80&&stu[i].ganbu=='Y')
s[i]=s[i]+850;
}
for(i=0;i<n;i++)
{
S=S+s[i];
}
max=s[0];
for(i=1;i<n;i++)
{
if(max<s[i])
{
max=s[i];
t=i;
}
}
printf("%s\n%d\n%d",stu[t].name,s[t],S);
return 0;
} | 39 |
19,039 | struct student
{
char name[21];
int grade;
int ping;
char a;
char w;
int pa;
int money;
struct student *next;
};
struct student *p1,*p2,*head,*max;
void main()
{
int sum=0;
int N,i,maxmoney;
head=p2=p1=(struct student *)malloc(LEN);
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",p1->name,&p1->grade,&p1->ping,&p1->a,&p1->w,&p1->pa);
p1->money=0;
if(p1->grade>80&&p1->pa) p1->money=8000+p1->money;
if(p1->grade>85&&p1->ping>80) p1->money=4000+p1->money;
if(p1->grade>90) p1->money=2000+p1->money;
if(p1->grade>85&&p1->w=='Y') p1->money=1000+p1->money;
if(p1->ping>80&&p1->a=='Y') p1->money=850+p1->money;
sum=sum+p1->money;
p1=(struct student *)malloc(LEN);
p2->next=p1;
p2=p1;
}
p1->next=NULL;
max=head;
p1=head->next;
maxmoney=head->money;
while(p1->next)
{
if(p1->money>maxmoney)
{
maxmoney=p1->money;
max=p1;
}
p1=p1->next;
}
printf("%s\n%d\n%d",max->name,maxmoney,sum);
}
| 39 |
19,040 | struct student
{
char name[20];
int score;
int banji;
char ganbu;
char xibu;
int lunwen;
struct student *next;
};
struct student *create(void)
{ int n;
scanf("%d",&n);
struct student *head,*p1,*p2;
int i;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->score,&p1->banji,&p1->ganbu,&p1->xibu,&p1->lunwen);
head=NULL;
for(i=1;i<n;i++)
{
if(i==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->score,&p1->banji,&p1->ganbu,&p1->xibu,&p1->lunwen);
}
p2->next=p1;
p1->next=NULL;
return(head);
}void main()
{
struct student *p1,*p2;
int max=0,sum=0;
for(p1=create();p1!=NULL;p1=p1->next)
{
int total=0;
if(p1->score>80 && p1->lunwen>=1)
total=total+8000;
if(p1->score>85 && p1->banji>80)
total=total+4000;
if(p1->score>90)
total=total+2000;
if(p1->score>85 && p1->xibu=='Y')
total=total+1000;
if(p1->banji>80 && p1->ganbu=='Y')
total=total+850;
if(total>max)
{
max=total;
p2=p1;
}
sum=sum+total;
// printf("%d\n",total);
}
printf("%s\n%d\n%d",p2->name,max,sum);
}
| 39 |
19,041 | main()
{struct student
{char name[20];
int average;
int classeva;
char leader;
char western;
int paper;
};
int n,i;
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].average,&stu[i].classeva,
&stu[i].leader,&stu[i].western,&stu[i].paper);
int sum[100],max=0;
long total=0;
for(i=0;i<n;i++)
{sum[i]=0;
if(stu[i].average>80&&stu[i].paper>=1)sum[i]+=8000;
if(stu[i].average>85&&stu[i].classeva>80)sum[i]+=4000;
if(stu[i].average>90)sum[i]+=2000;
if(stu[i].average>85&&stu[i].western=='Y')sum[i]+=1000;
if(stu[i].classeva>80&&stu[i].leader=='Y')sum[i]+=850;
total+=sum[i];
if(sum[i]>max)max=sum[i];
}
for(i=0;i<n;i++)
if(sum[i]==max)break;
printf("%s\n%d\n%ld",stu[i].name,max,total);
} | 39 |
19,042 | struct stu
{
char nam[40];
int qi;
int pi;
char gan;
char xi;
int lun;
int ji;
}stu[102];
void main()
{
int total=0;
int i,n,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].nam,&stu[i].qi,&stu[i].pi,&stu[i].gan,&stu[i].xi,&stu[i].lun);
}
for(i=0;i<n;i++)
{
stu[i].ji=0;
if(stu[i].qi>80&&stu[i].lun>0)
stu[i].ji+=8000;
if(stu[i].qi>85&&stu[i].pi>80)
stu[i].ji+=4000;
if(stu[i].qi>90)
stu[i].ji+=2000;
if(stu[i].qi>85&&stu[i].xi=='Y')
stu[i].ji+=1000;
if(stu[i].pi>80&&stu[i].gan=='Y')
stu[i].ji+=850;
}
for(i=0;i<n;i++)
{
total+=stu[i].ji;
}
for(i=1;i<n;i++)
{
if(stu[i].ji>stu[k].ji)
stu[k]=stu[i];
}
printf("%s\n",stu[k].nam);
printf("%d\n",stu[k].ji);
printf("%d\n",total);
}
| 39 |
19,043 |
struct student
{
char name[21];
int qimo;
int banji;
char ganbu;
char xibu;
int paper;
}stu[101];
int main()
{
int n,i,sum=0,max=0;
int sz[101]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s ",&stu[i].name);
scanf("%d %d ",&stu[i].qimo,&stu[i].banji);
scanf("%c %c ",&stu[i].ganbu,&stu[i].xibu);
scanf("%d",&stu[i].paper);
}
for(i=0;i<n;i++)
{
if(stu[i].qimo>80&&stu[i].paper>=1)
{
sz[i]=sz[i]+8000;
}
if(stu[i].qimo>85&&stu[i].banji>80)
{
sz[i]=sz[i]+4000;
}
if(stu[i].qimo>90)
{
sz[i]=sz[i]+2000;
}
if(stu[i].qimo>85&&stu[i].xibu=='Y')
{
sz[i]=sz[i]+1000;
}
if(stu[i].banji>80&&stu[i].ganbu=='Y')
{
sz[i]=sz[i]+850;
}
}
for(i=0;i<n;i++)
{
if(sz[i]>sz[max])
{
max=i;
}
sum=sum+sz[i];
}
printf("%s\n",stu[max].name);
printf("%d\n",sz[max]);
printf("%d",sum);
return 0;
}
| 39 |
19,044 | typedef struct
{
char name[100];
int qm,py;
char gb,xb;
int lw;
int jxj;
} student;
student cl[200];
int sum,n;
void wsj(int k);
void yxj(int k);
void xbj(int k);
void gxj(int k);
void ysj(int k)
{
if(cl[k].qm>80&&cl[k].lw>0)
{
cl[k].jxj+=8000;
sum+=8000;
}
wsj(k);
}
void wsj(int k)
{
if(cl[k].qm>85&&cl[k].py>80)
{
cl[k].jxj+=4000;
sum+=4000;
}
yxj(k);
}
void yxj(int k)
{
if(cl[k].qm>90)
{
cl[k].jxj+=2000;
sum+=2000;
}
xbj(k);
}
void xbj(int k)
{
if(cl[k].qm>85&&cl[k].xb=='Y')
{
cl[k].jxj+=1000;
sum+=1000;
}
gxj(k);
}
void gxj(int k)
{
if(cl[k].py>80&&cl[k].gb=='Y')
{
cl[k].jxj+=850;
sum+=850;
}
}
int main()
{
int i,max=0,maxn;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",cl[i].name,&cl[i].qm,&cl[i].py,&cl[i].gb,&cl[i].xb,&cl[i].lw);
ysj(i);
if(cl[i].jxj>max)
{
max=cl[i].jxj;
maxn=i;
}
}
printf("%s\n%d\n%d",cl[maxn].name,cl[maxn].jxj,sum);
return 0;
}
| 39 |
19,045 | struct student
{
char name[21];
int test;
int examine;
char ganbu;
char west;
int paper;
int jiang;
struct student *next;
};
void main()
{
struct student stu[100];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].test,&stu[i].examine,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
stu[i].jiang=0;
if(stu[i].test>80&&stu[i].paper>0)
stu[i].jiang+=8000;
if(stu[i].test>85&&stu[i].examine>80)
stu[i].jiang+=4000;
if(stu[i].test>90)
stu[i].jiang+=2000;
if(stu[i].test>85&&stu[i].west=='Y')
stu[i].jiang+=1000;
if(stu[i].examine>80&&stu[i].ganbu=='Y')
stu[i].jiang+=850;
}
int m=0;
int max,sum;
max=stu[0].jiang;
sum=stu[0].jiang;
for(i=1;i<n;i++)
{
if(stu[i].jiang>max)
{
m=i;
max=stu[i].jiang;
}
sum=sum+stu[i].jiang;
}
printf("%s\n%d\n%d",stu[m].name,max,sum);
}
| 39 |
19,046 | int main()
{
int N,fgrade[101],cgrade[101],lunwen[101],jiang[101],max=0,x,sum=0;
cin>>N;
cin.get();
char name[101][20],ganbu[101],xibu[101];
for(int i=1;i<=N;i++)
{
cin>>name[i]>>fgrade[i]>>cgrade[i]>>ganbu[i]>>xibu[i]>>lunwen[i];
}
for(int i=1;i<=N;i++)
{
jiang[i]=(fgrade[i]>80&&lunwen[i]>=1)*8000+(fgrade[i]>85&&cgrade[i]>80)*4000+(fgrade[i]>90)*2000+
(fgrade[i]>85&&xibu[i]=='Y')*1000+(cgrade[i]>80&&ganbu[i]=='Y')*850;
sum=sum+jiang[i];
if(max<jiang[i])
{
max=jiang[i];
x=i;
}
}
cout<<name[x]<<endl<<jiang[x]<<endl<<sum<<endl;
return 0;
}
| 39 |
19,047 | struct student
{
char name[20];
int s1;
int s2;
char c;
char w;
int paper;
int m;
struct student *next;
};
void main()
{
int N,n,total=0,r,max;
int a[108][6];
scanf("%d",&N);
struct student *p1,*p2,*head,*p,*pp;
p1=p2=(struct student*)malloc(LEN);
n=0;
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->c,&p1->w,&p1->paper);
n=n+1;
while(n<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->s1,&p1->s2,&p1->c,&p1->w,&p1->paper);
n=n+1;}
p2->next=p1;
p1->next=NULL;
p=head;
r=0;
while(r<N)
{
(p->m)=8000*((p->s1)>80&&(p->paper>0))+4000*((p->s1)>85&&(p->s2)>80)+2000*((p->s1)>90)+1000*((p->s1)>85&&(p->w=='Y'))+850*((p->s2)>80&&(p->c=='Y'));
total=total+(p->m);
r++;p=p->next;
}
r=0;
int i,j=0;
p=head;
max=p->m;
while(r<N)
{
if((p->m)>max)
{
max=(p->m);
j=r;
}
r++;
p=p->next;
}
i=0;
pp=head;
while(i<j)
{
pp=pp->next;
i++;
}
printf("%s\n%d\n%d\n",pp->name,max,total);
}
| 39 |
19,048 |
void main()
{
typedef struct stu
{
char name[22];
int qm;
int bj;
char gb;
char xb;
int lw;
int jxj;
}stu;
stu s[100];
int i,n,max,total;
memset(s,0,sizeof(s));
max = 0; total = 0;
scanf("%d",&n);
for (i = 0;i < n;i++)
{
scanf("%s %d %d %c %c %d",(s+i)->name,&(s+i)->qm,&(s+i)->bj,&(s+i)->gb,&(s+i)->xb,&(s+i)->lw);
if ((s+i)->qm > 80 && (s+i)->lw) (s+i)->jxj += 8000;
if ((s+i)->qm > 85 && (s+i)->bj > 80) (s+i)->jxj += 4000;
if ((s+i)->qm > 90) (s+i)->jxj += 2000;
if ((s+i)->qm > 85 && (s+i)->xb == 'Y') (s+i)->jxj += 1000;
if ((s+i)->bj > 80 && (s+i)->gb == 'Y') (s+i)->jxj += 850;
}
for (i = 0;i < n;i++)
{
if (max < (s+i)->jxj) max = (s+i)->jxj;
total += (s+i)->jxj;
}
for (i = 0;i < n;i++)
if (max == (s+i)->jxj)
{
printf("%s\n",(s+i)->name);
break;
}
printf("%d\n%d\n",max,total);
}
| 39 |
19,049 | void main()
{
struct stu
{char name[20];
int sco;
int score;
char a;
char b;
int p;
};
struct stu stu[100];
int n,i,j;
int k[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].sco,&stu[i].score,&stu[i].a,&stu[i].b,&stu[i].p);
for(i=0;i<n;i++)
{
if(stu[i].sco>80&&stu[i].p>=1) k[i]=k[i]+8000;
if(stu[i].sco>85&&stu[i].score>80) k[i]=k[i]+4000;
if(stu[i].sco>90) k[i]=k[i]+2000;
if(stu[i].sco>85&&stu[i].b=='Y') k[i]=k[i]+1000;
if(stu[i].score>80&&stu[i].a=='Y') k[i]=k[i]+850;
}
int total=0;
for(i=0;i<n;i++)
total=total+k[i];
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{if(k[j]>k[i]) break;}
if(j==n) break;
}
printf("%s\n",stu[i].name);
printf("%d\n",k[i]);
printf("%d",total);
} | 39 |
19,050 | struct reward
{
char name[20];
int fgra;
int tgra;
char gb;
char xb;
int lw;
};
int main()
{
int n,*pr,sum=0,max;
struct reward *p,temp;
scanf("%d",&n);
struct reward *rew=(struct reward*)malloc(sizeof(struct reward)*n);
int *trew=(int*)malloc(sizeof(int)*n);
for(p=rew;p<rew+n;p++)
{
scanf("%s %d %d %c %c %d",p->name,&p->fgra,&p->tgra,&p->gb,&p->xb,&p->lw);
}
for(p=rew,pr=trew;p<rew+n;p++,pr++)
{
*pr=0;
if(p->fgra>80&&p->lw>=1)
{
*pr+=8000;
sum+=8000;
}
if(p->fgra>85&&p->tgra>80)
{
*pr+=4000;
sum+=4000;
}
if(p->fgra>90)
{
*pr+=2000;
sum+=2000;
}
if(p->fgra>85&&p->xb=='Y')
{
*pr+=1000;
sum+=1000;
}
if(p->tgra>80&&p->gb=='Y')
{
*pr+=850;
sum+=850;
}
}
max=*trew;
temp=*rew;
for(p=rew,pr=trew;p<rew+n;p++,pr++)
{
if(*pr>max)
{
max=*pr;
temp=*p;
}
}
printf("%s\n%d\n%d\n",temp.name,max,sum);
return 0;
}
| 39 |
19,051 | int main()
{ struct student
{ char name[20];
int jun;
int ping;
char gan;
char xi;
int lun;
};
struct student s[100];
int n,i,j;
long t,g[100],m;
scanf("%d\n",&n);
for (i=0;i<=(n-1);i++)
{ scanf("%s",&s[i].name);
scanf("%d%d %c %c%d",&s[i].jun,&s[i].ping,&s[i].gan,&s[i].xi,&s[i].lun);
}
for (i=0;i<=(n-1);i++)
{ g[i]=0;
if (s[i].jun>80&&s[i].lun>=1) g[i]=g[i]+8000;
if (s[i].jun>85&&s[i].ping>80) g[i]=g[i]+4000;
if (s[i].jun>90) g[i]=g[i]+2000;
if (s[i].xi=='Y'&&s[i].jun>85) g[i]=g[i]+1000;
if (s[i].gan=='Y'&&s[i].ping>80) g[i]=g[i]+850;
}
m=g[0];j=0;t=0;
for (i=0;i<=(n-1);i++)
{ t=t+g[i];
if (m<g[i]) {m=g[i];j=i;}
}
printf("%s\n%d\n%ld",s[j].name,m,t);
} | 39 |
19,052 | struct student
{char name[30];
int qimo;
int banji;
char gb;
char xb;
int lw;
};
int k=0;
void main()
{
int money(struct student a);
int cmp(int a[],int n);
int n,i,b[200]={0},m;
long q=0;
struct student a[105];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].qimo,&a[i].banji,&a[i].gb,&a[i].xb,&a[i].lw);
b[i]=money(a[i]);q=q+b[i];
}
m =cmp(b,n);
printf("%s\n",a[k].name);
printf("%d\n",m);
printf("%ld",q);
}
int money(struct student a)
{
int sum=0;
if(a.qimo>80 && a.lw>=1)sum=8000;
if(a.banji>80 && a.qimo>85)sum=sum+4000;
if(a.qimo>90)sum=sum+2000;
if(a.qimo>85 && a.xb=='Y')sum=sum+1000;
if(a.banji>80 && a.gb=='Y')sum=sum+850;
return sum;
}
int cmp(int a[],int n)
{
int max=a[0],i;
for(i=0;i<n-1;i++)
if(max<a[i+1]){max=a[i+1];k=i+1;}
return max;
}
| 39 |
19,053 | struct stu
{
char name[20];
int aver;
int sugg;
char ganbu;
char xibu;
int amount;
int money;
}stu[100];
main()
{
int k=0,j,N,M=0;
scanf("%d",&N);
for(k=0;k<N;k++)
scanf("%s %d %d %c %c %d",stu[k].name,&stu[k].aver,&stu[k].sugg,&stu[k].ganbu,&stu[k].xibu,&stu[k].amount);
for(k=0;k<N;k++)
{stu[k].money=0;
if(stu[k].aver>80&&stu[k].amount>=1)stu[k].money+=8000;
if(stu[k].aver>85&&stu[k].sugg>80)stu[k].money+=4000;
if(stu[k].aver>90)stu[k].money+=2000;
if(stu[k].aver>85&&stu[k].xibu=='Y')stu[k].money+=1000;
if(stu[k].sugg>80&&stu[k].ganbu=='Y')stu[k].money+=850;}
for(j=1;j<N;j++)
if(stu[j].money>stu[k].money)k=j;
printf("%s\n",stu[k].name);
printf("%d\n",stu[k].money);
for(j=0;j<N;j++)
M+=stu[j].money;
printf("%d\n",M);
} | 39 |
19,054 | struct ren
{
char x[21];char g;char s;
int a1;
int a2;int n;int c;
}a[102];
void main()
{
int N,i,max=0;
long int z=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s",a[i].x);
scanf("%d",&a[i].a1);
scanf("%d",&a[i].a2);
scanf(" %c",&a[i].g);
scanf(" %c",&a[i].s);
scanf("%d",&a[i].n);
}
for(i=0;i<N;i++)
a[i].c=0;
for(i=0;i<N;i++)
{
if(a[i].a1>80&&a[i].n>=1)
a[i].c=a[i].c+8000;
if(a[i].a1>85&&a[i].a2>80)
a[i].c=a[i].c+4000;
if(a[i].a1>90)
a[i].c=a[i].c+2000;
if(a[i].a1>85&&a[i].s=='Y')
a[i].c=a[i].c+1000;
if(a[i].a2>80&&a[i].g=='Y')
a[i].c=a[i].c+850;
}
for(i=0;i<N;i++)
{
z=z+a[i].c;
if(max<a[i].c)
max=a[i].c;
}
for(i=0;i<N;i++)
{
if(a[i].c==max)
{
printf("%s\n%d\n%ld",a[i].x,a[i].c,z);
break;
}
}
} | 39 |
19,055 | struct student
{
char name[20];
int qm;
int bj;
char x;
char xi;
int lun;
int award;
};
void main()
{
struct student s[100];
int i,N,k=0,p,q=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",s[i].name,&s[i].qm,&s[i].bj,&s[i].x,&s[i].xi,&s[i].lun);
s[i].award=0;
// printf("%s %d %d %c %c %d\n",s[i].name,s[i].qm,s[i].bj,s[i].x,s[i].xi,s[i].lun);
}
for(i=0;i<N;i++)
{
if(s[i].qm>80&&s[i].lun>0)
s[i].award=s[i].award+8000;
if(s[i].qm>85&&s[i].bj>80)
s[i].award=s[i].award+4000;
if(s[i].qm>90)
s[i].award=s[i].award+2000;
if(s[i].qm>85&&s[i].xi=='Y')
s[i].award=s[i].award+1000;
if(s[i].bj>80&&s[i].x=='Y')
s[i].award=s[i].award+850;
}
p=s[0].award;
for(i=0;i<N;i++)
{
if(s[i].award>p)
p=s[i].award;
}
q=0;
for(i=0;i<N;i++)
{
if(s[i].award==p)
{
if(k==0)
{
k=k+1;
printf("%s\n",s[i].name);
printf("%d\n",p);
}
}
q=q+s[i].award;
}
printf("%d",q);
}
| 39 |
19,056 | int main()
{int i,n,grade1[100],grade2[100],lunwen[100],money[100]={0},moneyall=0,max=0,p;
char name[100][100],ganbu[100],xibu[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d%s%s%d",name[i],&grade1[i],&grade2[i],&ganbu[i],&xibu[i],&lunwen[i]);
if(grade1[i]>80&&lunwen[i]>=1)
money[i]=money[i]+8000;
if(grade1[i]>85&&grade2[i]>80)
money[i]=money[i]+4000;
if(grade1[i]>90)
money[i]=money[i]+2000;
if(grade1[i]>85&&xibu[i]=='Y')
money[i]=money[i]+1000;
if(grade2[i]>80&&ganbu[i]=='Y')
money[i]=money[i]+850;}
for(i=0;i<n;i++)
{if(money[i]>max){
max=money[i];
p=i;
}
moneyall=moneyall+money[i];}
printf("%s",name[p]);
printf("\n");
printf("%d",max);
printf("\n");
printf("%d",moneyall);
return 0;
}
| 39 |
19,057 | struct student
{
char name[20];
int test;
int term;
char key;
char west;
int art;
int money;
}person[100];
int main()
{
int n,i,j,q=0,k;
struct student temp;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",person[i].name,&person[i].test,&person[i].term,&person[i].key,&person[i].west,&person[i].art);
person[i].money=0;
if(person[i].art>0&&person[i].test>80) {person[i].money=person[i].money+8000;}
if(person[i].test>85&&person[i].term>80) {person[i].money=person[i].money+4000;}
if(person[i].test>90) {person[i].money=person[i].money+2000;}
if(person[i].test>85&&person[i].west=='Y') {person[i].money=person[i].money+1000;}
if(person[i].term>80&&person[i].key=='Y') {person[i].money=person[i].money+850;}
q=q+person[i].money;
}
for(i=0;i<=n-2;i++)
{
k=i;
for(j=i+1;j<=n-1;j++)
if(person[j].money>person[k].money)
k=j;
temp=person[k]; person[k]=person[i];person[i]=temp;
}
printf("%s\n",person[0].name);
printf("%d\n",person[0].money);
printf("%d",q);
return 0;
}
| 39 |
19,058 | struct
{char name[20];
int final;
int cla;
char gan;
char west;
int thesis;
int money;
}stu[120];
void main()
{
int n,i,j,sum=0;
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
scanf("%s %d %d %c %c %d\n",&stu[i].name,&stu[i].final,&stu[i].cla,&stu[i].gan,&stu[i].west,&stu[i].thesis);
scanf("%s %d %d %c %c %d",&stu[n-1].name,&stu[n-1].final,&stu[n-1].cla,&stu[n-1].gan,&stu[n-1].west,&stu[n-1].thesis);
for(i=0;i<n;i++)
stu[i].money=0;
for(i=0;i<n;i++)
{
if(stu[i].final>80&&stu[i].thesis>=1)
stu[i].money=stu[i].money+8000;
if(stu[i].final>85&&stu[i].cla>80)
stu[i].money=stu[i].money+4000;
if(stu[i].final>90)
stu[i].money=stu[i].money+2000;
if(stu[i].final>85&&stu[i].west=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].cla>80&&stu[i].gan=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
{
if(stu[j].money<stu[j+1].money)
{
stu[119]=stu[j];
stu[j]=stu[j+1];
stu[j+1]=stu[119];
}
}
}
for(i=0;i<n;i++)
{
sum=sum+stu[i].money;
}
printf("%s\n",stu[0].name);
printf("%d\n",stu[0].money);
printf("%d\n",sum);
} | 39 |
19,059 |
struct stu
{
char name[20];
int mark1,mark2;
char office,west;
int artical;
long money;
}student[120];
int main()
{
int n,i,k;
int m1,m2,a;
char o,w;
long max,sum;
scanf("%d",&n);
max=0; sum=0;
for (i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&student[i].name,&m1,&m2,&o,&w,&a);
student[i].money=0;
if ((m1>80) && (a>0)) student[i].money=student[i].money +8000;
if ((m1>85) && (m2>80)) student[i].money=student[i].money +4000;
if ((m1>90)) student[i].money=student[i].money +2000;
if ((m1>85) && (w=='Y')) student[i].money=student[i].money +1000;
if ((m2>80) && (o=='Y')) student[i].money=student[i].money +850;
if (student[i].money>max) {max=student[i].money; k=i;}
sum=sum+student[i].money ;
}
printf ("%s\n",student[k].name );
printf ("%d\n",max);
printf ("%d\n",sum);
} | 39 |
19,060 | void main()
{
int n,all=0,i,j,m;
struct student
{
char name[20];
int score1;
int score2;
char monitor;
char west;
int paper;
int money;
}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].monitor,&stu[i].west,
&stu[i].paper);
}
for(i=0;i<n;i++)
{
stu[i].money=0;
if(stu[i].score1>80 && stu[i].paper>=1)
stu[i].money+=8000;
if(stu[i].score1>85 && stu[i].score2>80)
stu[i].money+=4000;
if(stu[i].score1>90)
stu[i].money+=2000;
if(stu[i].score1>85 && stu[i].west=='Y')
stu[i].money+=1000;
if(stu[i].score2>80 && stu[i].monitor=='Y')
stu[i].money+=850;
}
m=stu[0].money;
j=0;
for(i=0;i<n;i++)
{
if(stu[i].money>m)
{
m=stu[i].money;j=i;
}
}
for(i=0;i<n;i++)
all+=stu[i].money;
printf("%s\n%d\n",stu[j].name,stu[j].money);
printf("%d\n",all);
}
| 39 |
19,061 | int main()
{
struct student
{
char name[30];
int qimo;
int ping;
char ban;
char xi;
int paper;
}a[100];
int N,i,b[100]={0},max,t,s=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s%d%d %c %c %d",a[i].name,&a[i].qimo,&a[i].ping,&a[i].ban,&a[i].xi,&a[i].paper);
}
for(i=0;i<N;i++)
{
if((a[i].qimo>80)&&(a[i].paper>=1))
b[i]=b[i]+8000;
if((a[i].ping>80)&&(a[i].qimo>85))
b[i]=b[i]+4000;
if(a[i].qimo>90)
b[i]=b[i]+2000;
if((a[i].qimo>85)&&(a[i].xi=='Y'))
b[i]=b[i]+1000;
if((a[i].ping>80)&&(a[i].ban=='Y'))
b[i]=b[i]+850;
}
max=b[0];
t=0;
for(i=0;i<N;i++)
{
s=s+b[i];
if(b[i]>max)
{
max=b[i];
t=i;
}
}
printf("%s\n%d\n%d\n",a[t].name,max,s);
return 0;
}
| 39 |
19,062 |
struct student
{
char name[21];
int gpa;
int c_gpa;
char official;
char west;
int paper;
};
void main()
{
int process( struct student *p);
struct student stu[100],*p,*P=NULL;
int i=0,n,TOTAL=0,max=0,MAX=0;
p=stu;
scanf("%d\n",&n);
for(i;i<n;i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->gpa,&p->c_gpa,&p->official,&p->west,&p->paper);
max=process(p++);
if(max>MAX) {MAX=max;P=p-1;}
TOTAL += max;
}
printf("%s\n%d\n%d", P->name,MAX,TOTAL);
}
int process( struct student *p)
{
int prize=0;
if (p->gpa>80 && p->paper>=1) prize += 8000;
if (p->gpa>85 && p->c_gpa>80) prize += 4000;
if (p->gpa>90) prize += 2000;
if (p->gpa>85 && p->west=='Y') prize += 1000;
if (p->c_gpa>80 && p->official=='Y') prize +=850;
return prize;
}
| 39 |
19,063 | struct student
{
char num[100];
int sco;
int pin;
char gan;
char xi;
int pap;
};
void main()
{
int i,j,k,m,n,a[100],sum=0;
struct student stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
a[i]=0;
scanf("%s %d %d %c %c %d",stu[i].num,&stu[i].sco,&stu[i].pin,&stu[i].gan,&stu[i].xi,&stu[i].pap);
}
for(i=0;i<n;i++)
{
if(stu[i].sco>80&&stu[i].pap>=1)
a[i]+=8000;
if(stu[i].sco>85&&stu[i].pin>80)
a[i]+=4000;
if(stu[i].sco>90)
a[i]+=2000;
if(stu[i].sco>85&&stu[i].xi=='Y')
a[i]+=1000;
if(stu[i].pin>80&&stu[i].gan=='Y')
a[i]+=850;
}
k=0;
for(i=0;i<n;i++)
{
if(a[i]>k)
k=a[i];
}
for(i=0;i<n;i++)
if(a[i]==k)
break;
printf("%s\n%d",stu[i].num,a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
printf("\n%d",sum);
} | 39 |
19,064 | int main()
{
struct std{
char name[20];
int qm,bp,lw,jj;
char gb,xb;
}stu[200];
int n,i,s=0,max;
char mn[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
stu[i].jj=0;
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qm,&stu[i].bp,&stu[i].gb,&stu[i].xb,&stu[i].lw);
if(stu[i].qm>80&&stu[i].lw>0){stu[i].jj+=8000;}
if(stu[i].qm>85&&stu[i].bp>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].bp>80&&stu[i].gb=='Y'){stu[i].jj+=850;}
s=s+stu[i].jj;
}
max=stu[0].jj;
strcpy(mn,stu[0].name);
for(i=0;i<n;i++)
{
if(max<stu[i].jj)
{
max=stu[i].jj;
strcpy(mn,stu[i].name);
}
}
printf("%s\n%d\n%d",mn,max,s);
return 0;
} | 39 |
19,065 | void main()
{
struct student
{
char name[20];
int qm;
int bj;
char gb;
char xb;
int lw;
}a[100];
int n,b[100]={0},t=0,i,max;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%s %d %d %c %c %d",a[i].name,&a[i].qm,&a[i].bj,&a[i].gb,&a[i].xb,&a[i].lw);
if (a[i].qm>80&&a[i].lw>0) b[i]=b[i]+8000;
if (a[i].qm>85&&a[i].bj>80) b[i]=b[i]+4000;
if (a[i].qm>90) b[i]=b[i]+2000;
if (a[i].qm>85&&a[i].xb=='Y') b[i]=b[i]+1000;
if (a[i].bj>80&&a[i].gb=='Y') b[i]=b[i]+850;
}
max=0;
for (i=0;i<n;i++)
{
t=t+b[i];
if (b[i]>b[max]) max=i;
}
printf ("%s\n",a[max].name);
printf ("%d\n",b[max]);
printf ("%d\n",t);
} | 39 |
19,066 | struct
{
char name[20];
int qimo;
int banji;
char gb;
char xb;
int paper;
}stu[101];
void main()
{
int N, i, max=0, p=0, total=0, sch[101]={0};
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].gb,&stu[i].xb,&stu[i].paper);
for(i=0;i<N;i++)
{
if(stu[i].qimo>80&&stu[i].paper>0)
sch[i]+=8000;
if(stu[i].qimo>85&&stu[i].banji>80)
sch[i]+=4000;
if(stu[i].qimo>90)
sch[i]+=2000;
if(stu[i].qimo>85&&stu[i].xb=='Y')
sch[i]+=1000;
if(stu[i].banji>80&&stu[i].gb=='Y')
sch[i]+=850;
}
max=0;
for(i=0;i<N;i++)
{
if(sch[i]>max)
{
max=sch[i];
p=i;
}
total=total+sch[i];
}
printf("%s\n%d\n%d\n",stu[p].name,sch[p],total);
}
| 39 |
19,067 | struct student
{
char name[21],a,b;
int score,c,e,scholar;
};
struct student stu[100],temp;
void main()
{
int n,i,j,k=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].c,&stu[i].a,&stu[i].b,&stu[i].e);
}
/*for(i=0;i<n;i++)
{
printf("%s %d %d %c %c %d\n",stu[i].name,stu[i].score,stu[i].c,stu[i].a,stu[i].b,stu[i].e);
}*/
for(i=0;i<n;i++)
{
stu[i].scholar=0;
if(stu[i].c>80&&stu[i].a=='Y')
{
stu[i].scholar+=850;
}
if(stu[i].score>85&&stu[i].b=='Y')
{
stu[i].scholar+=1000;
}
if(stu[i].score>90)
{
stu[i].scholar+=2000;
}
if(stu[i].score>85&&stu[i].c>80)
{
stu[i].scholar+=4000;
}
if(stu[i].score>80&&stu[i].e>=1)
{
stu[i].scholar+=8000;
}
}
for(j=1;j<n;j++)
{
if(stu[0].scholar<stu[j].scholar)
{
temp=stu[0];
stu[0]=stu[j];
stu[j]=temp;
}
}
for(j=0;j<n;j++)
k+=stu[j].scholar;
printf("\n%s\n%d\n%d",stu[0].name,stu[0].scholar,k);
}
| 39 |
19,068 | struct student
{
int num,score1,score2;
char name[50],west,ganbu;
struct student *next;
};
int n;
struct student *create(void)
{
int i,j;
struct student *head,*p1,*p2;
p1=p2=(struct student*)malloc(LEN);
head=NULL;
i=1;
scanf("%s %d %d %c %c %d",&p1->name,&p1->score1,&p1->score2,&p1->ganbu,&p1->west,&p1->num);
while(1)
{
if(i==1)
head=p1;
else
p2->next=p1;
p2=p1;
if(i==n)
break;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->score1,&p1->score2,&p1->ganbu,&p1->west,&p1->num);
i++;
}
p2->next=NULL;
return(head);
}
void main()
{
int i,j,*x,amount,max;
char (*y)[50];
struct student *head,*p1,*p2;
scanf("%d",&n);
head=create();
p1=p2=head;
x=(int*)malloc(100*sizeof(int));
y=(char(*)[50])calloc(100,50*sizeof(char));
i=0;
while(p1!=NULL)
{
*(x+i)=0;
if(p1->score1>80&&p1->num>0)
*(x+i)=*(x+i)+8000;
if(p1->score1>85&&p1->score2>80)
*(x+i)=*(x+i)+4000;
if(p1->score1>90)
*(x+i)=*(x+i)+2000;
if(p1->score1>85&&p1->west=='Y')
*(x+i)=*(x+i)+1000;
if(p1->score2>80&&p1->ganbu=='Y')
*(x+i)=*(x+i)+850;
strcpy(*(y+i),p1->name);
p1=p1->next;
i++;
}
j=0;
amount=0;
for(i=0;i<n;i++)
amount=amount+(*(x+i));
max=*x;
for(i=1;i<n;i++)
if(*(x+i)>max)
{
max=*(x+i);
j=i;
}
printf("%s\n",*(y+j));
printf("%d\n",max);
printf("%d\n",amount);
} | 39 |
19,069 | struct person
{
char n[20];
int q;
int p;
char g;
char x;
int lun;
};
int jiang(struct person a)
{
int j=0;
if(a.q>80&&a.lun>0)
{
j=j+8000;
}
if (a.q>85&&a.p>80)
{
j=j+4000;
}
if(a.q>90)
{
j=j+2000;
}
if (a.q>85&&a.x=='Y')
{
j=j+1000;
}
if(a.p>80&&a.g=='Y')
{
j=j+850;
}
return(j);
}
void main()
{
int n,i,j,r;
double sum=0;
int a[100];
struct person p[100];
scanf("%d",&n);
for (i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",p[i].n,&p[i].q,&p[i].p,&p[i].g,&p[i].x,&p[i].lun);
a[i]=jiang(p[i]);
sum=sum+a[i];
}
for (i=0;i<=n-1;i++)
{
r=0;
for (j=0;j<=n-1;j++)
{
if (a[j]>a[i])
{
r=1;
}
}
if (r==0)
{
printf("%s\n%d\n%.0lf",p[i].n,a[i],sum);
break;
}
}
} | 39 |
19,070 | int main()
{
struct stu
{
char name[20];
int a;
int b;
char c;
char d;
int e;
int sum;
};
struct stu s1,s2;
int n,i,zong;
scanf("%d\n",&n);
scanf("%s %d %d %c %c %d",s1.name,&s1.a,&s1.b,&s1.c,&s1.d,&s1.e);
s1.sum=0;
if(s1.a>80&&s1.e>0)
s1.sum+=8000;
if(s1.a>85&&s1.b>80)
s1.sum+=4000;
if(s1.a>90)
s1.sum+=2000;
if(s1.a>85&&s1.d=='Y')
s1.sum+=1000;
if(s1.b>80&&s1.c=='Y')
s1.sum+=850;
zong=s1.sum;
for(i=1;i<n;i++)
{
scanf("%s %d %d %c %c %d",s2.name,&s2.a,&s2.b,&s2.c,&s2.d,&s2.e);
s2.sum=0;
if(s2.a>80&&s2.e)
s2.sum+=8000;
if(s2.a>85&&s2.b>80)
s2.sum+=4000;
if(s2.a>90)
s2.sum+=2000;
if(s2.a>85&&s2.d=='Y')
s2.sum+=1000;
if(s2.b>80&&s2.c=='Y')
s2.sum+=850;
zong=zong+s2.sum;
if(s2.sum>s1.sum)
s1=s2;
}
printf("%s\n%d\n%d",s1.name,s1.sum,zong);
return 0;
}
| 39 |
19,071 | int main()
{
struct student
{
char name[20];
int a;
int b;
char c;
char d;
int e;
int sum;
};
struct student st[100];
int n,i,am=0,max;
char f[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",st[i].name,&st[i].a,&st[i].b,&st[i].c,&st[i].d,&st[i].e);
st[i].sum=0;
}
for(i=0;i<n;i++)
{
if(st[i].a>80 && st[i].e>0)
st[i].sum=st[i].sum+8000;
if(st[i].a>85 && st[i].b>80)
st[i].sum=st[i].sum+4000;
if(st[i].a>90)
st[i].sum=st[i].sum+2000;
if(st[i].a>85 && st[i].d=='Y')
st[i].sum=st[i].sum+1000;
if(st[i].b>80 && st[i].c=='Y')
st[i].sum=st[i].sum+850;
am=am+st[i].sum;
}
max=st[0].sum;
for(i=0;i<n;i++)
{
if(max<st[i].sum)
{
max=st[i].sum;
strcpy(f,st[i].name);
}
}
printf("%s\n%d\n%d",f,max,am);
return 0;
} | 39 |
19,072 | struct student
{ char name[20];
int s1;
int s2;
char a;
char b;
int num;
int bonus;
} stu[100];
int main()
{
int i,k=0,amount=0,n;
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].a,&stu[i].b,&stu[i].num);
if(stu[i].s1>80&&stu[i].num>=1) {
stu[i].bonus+=8000;
}
if(stu[i].s1>85&&stu[i].s2>80) {
stu[i].bonus+=4000;
}
if(stu[i].s1>90)
{ stu[i].bonus+=2000;
}
if(stu[i].s1>85&&stu[i].b=='Y')
{ stu[i].bonus+=1000;
}
if(stu[i].s2>80&&stu[i].a=='Y')
{ stu[i].bonus+=850;
}
}
for(i=0;i<n;i++){
amount=amount+stu[i].bonus;
}
for(i=1;i<n;i++){
if(stu[k].bonus<stu[i].bonus)
k=i;
}
printf("%s\n",stu[k].name);
printf("%d\n",stu[k].bonus);
printf("%d",amount);
return 0;
}
| 39 |
19,073 |
struct student{
char name[20];
int gra1;
int gra2;
char ganbu;
char west;
int paper;
int award;
}stu[100];
void main()
{
int n,i,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",stu[i].name);
scanf("%d%d%s%s%d",&stu[i].gra1,&stu[i].gra2,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++){
if(stu[i].gra1>80&&stu[i].paper>=1){
stu[i].award+=8000;
}
if(stu[i].gra1>85&&stu[i].gra2>80){
stu[i].award+=4000;
}
if(stu[i].gra1>90){
stu[i].award+=2000;
}
if(stu[i].gra1>85&&stu[i].west=='Y'){
stu[i].award+=1000;
}
if(stu[i].ganbu=='Y'&&stu[i].gra2>80){
stu[i].award+=850;
}
sum+=stu[i].award ;
}
int max=stu[0].award;
char best[20];
for(i=0;i<n;i++){
if(stu[i].award>max){
max=stu[i].award;
strcpy(best,stu[i].name);
}
}
printf("%s\n%d\n%d",best,max,sum);
}
| 39 |
19,074 |
struct student{
char name[21];
int qimo;
int banji;
char ganbu;
char west;
int article;
int total;
};
int main(){
int n,i,max,sum;
scanf("%d",&n);
struct student *stu=(struct student *)malloc(sizeof(int)*4*n+sizeof(char)*23*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].west,&stu[i].article);
stu[i].total =0;
}
for(i=0;i<n;i++){
if(stu[i].qimo>80&&stu[i].article>0){
stu[i].total +=8000;
}
if(stu[i].qimo>85&&stu[i].banji>80){
stu[i].total +=4000;
}
if(stu[i].qimo>90){
stu[i].total+=2000;
}
if(stu[i].qimo >85&&stu[i].west=='Y'){
stu[i].total +=1000;
}
if(stu[i].banji >80&&stu[i].ganbu =='Y'){
stu[i].total +=850;
}
}
max=stu[0].total ;
sum=0;
for(i=0;i<n;i++){
if(stu[i].total>max){
max=stu[i].total ;
}
sum+=stu[i].total ;
}
for(i=0;i<n;i++){
if(max==stu[i].total){
printf("%s\n%d\n%d\n",stu[i].name,max,sum);
break;
}
}
return 0;
} | 39 |
19,075 | void main()
{
int N,i,sum[100],total=0,order;
struct{
char name[20];
int results;
int dis;
char iscadre;
char iswest;
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].results,&stu[i].dis,&stu[i].iscadre,&stu[i].iswest,&stu[i].paper);
sum[i]=0;
if(stu[i].results>80&&stu[i].paper>0)
sum[i]+=8000;
if(stu[i].results>85&&stu[i].dis>80)
sum[i]+=4000;
if(stu[i].results>90)
sum[i]+=2000;
if(stu[i].results>85&&stu[i].iswest=='Y')
sum[i]+=1000;
if(stu[i].dis>80&&stu[i].iscadre=='Y')
sum[i]+=850;
else sum[i]+=0;
total+=sum[i];
}
order=0;
for(i=0;i<N;i++)
{
if(sum[i]>sum[0])
{
order=i;
sum[0]=sum[i];
}
}
printf("%s\n",stu[order].name);
printf("%d\n",sum[0]);
printf("%d\n",total);
} | 39 |
19,076 |
struct student
{
char name[40];
int end;
int cls;
int lead;
int west;
int paper;
int money;
} stu[100];
int main()
{
int i,n,t=1,sum=0,max=0,print;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].end,&stu[i].cls,&stu[i].lead,&stu[i].west,&stu[i].paper);
}
for(i=1;i<=n;i++)
{
if(stu[i].end>80&&stu[i].paper>=1) stu[i].money+=8000;
if(stu[i].end>85&&stu[i].cls>80) stu[i].money+=4000;
if(stu[i].end>90) stu[i].money+=2000;
if(stu[i].end>85&&stu[i].west==89) stu[i].money+=1000;
if(stu[i].cls>80&&stu[i].lead==89) stu[i].money+=850;
sum+=stu[i].money;
}
for(i=1;i<=n;i++)
{
if(stu[i].money>max)
{
max=stu[i].money;
print=i;
}
}
printf("%s\n%d\n%d",stu[print].name,stu[print].money,sum);
return 0;
} | 39 |
19,077 | void main()
{
int a,b,c;
struct student
{
char xing[20];
int qi;
int ban;
char gan;
char xi;
int lun;
int qian;
}stu[100],mid;
scanf("%d",&a);
for(b=0;b<a;b++)
{
stu[b].qian=0;
scanf("%s%d%d %c %c%d",stu[b].xing,&stu[b].qi,&stu[b].ban,&stu[b].gan,&stu[b].xi,&stu[b].lun);
if(stu[b].qi>80&&stu[b].lun>=1)
stu[b].qian=stu[b].qian+8000;
if(stu[b].qi>85&&stu[b].ban>80)
stu[b].qian=stu[b].qian+4000;
if(stu[b].qi>90)
stu[b].qian=stu[b].qian+2000;
if(stu[b].qi>85&&stu[b].xi=='Y')
stu[b].qian=stu[b].qian+1000;
if(stu[b].ban>80&&stu[b].gan=='Y')
stu[b].qian=stu[b].qian+850;
}
for(b=0;b<a-1;b++)
{
for(c=0;c<a-b-1;c++)
{
if(stu[c].qian<stu[c+1].qian)
{
mid=stu[c];
stu[c]=stu[c+1];
stu[c+1]=mid;
}
}
}
c=0;
for(b=0;b<a;b++)
c=c+stu[b].qian;
printf("%s\n%d\n%d",stu[0].xing,stu[0].qian,c);
}
| 39 |
19,078 | struct stu
{char name[24];
int score;
int ass;
char pos;
char west;
int paper;
int fel;
};
int f(struct stu*q)
{int z=0;
if( q->score>80 && q->paper>0 ) z=z+8000;
if( q->score>85 && q->ass>80 ) z=z+4000;
if( q->score>90) z=z+2000;
if( q->score>85 && q->west=='Y' ) z=z+1000;
if( q->ass>80 && q->pos=='Y' ) z=z+850;
return(z);
}
void main()
{struct stu* p;
int n,i,m=0,t=0;
scanf("%d",&n);
p=(struct stu*)malloc(n*sizeof(struct stu));
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",(p+i)->name,&(p+i)->score,&(p+i)->ass,&(p+i)->pos,&(p+i)->west,&(p+i)->paper);
(p+i)->fel=f(p+i);
t=t+(p+i)->fel;
}
for(i=1;i<n;i++)
if( (p+i)->fel > (p+m)->fel ) m=i;
printf("%s\n%d\n%d",(p+m)->name,(p+m)->fel,t);
}
| 39 |
19,079 | struct jiangli
{
char name[20];
int study;
int cla;
char gugan;
char xibu;
int paper;
int money;
}stu[100];
void main()
{
int n,i,max,sum=0,k;
scanf ("%d",&n);
for (i=0;i<n;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].study,&stu[i].cla,&stu[i].gugan,&stu[i].xibu,&stu[i].paper);
for (i=0;i<n;i++)
{
stu[i].money=0;
if (stu[i].study>80&&stu[i].paper>=1)
stu[i].money+=8000;
if (stu[i].study>85&&stu[i].cla>80)
stu[i].money+=4000;
if (stu[i].study>90)
stu[i].money+=2000;
if (stu[i].study>85&&stu[i].xibu=='Y')
stu[i].money+=1000;
if (stu[i].cla>80&&stu[i].gugan=='Y')
stu[i].money+=850;
}
max=stu[0].money;
for (i=0;i<n;i++)
{
sum=sum+stu[i].money;
if (max<stu[i].money)
{
max=stu[i].money;
k=i;
}
}
printf("%s\n%d\n%d",stu[k].name,stu[k].money,sum);
} | 39 |
19,080 | struct student
{
char name[20];
int qimo;
int banpin;
char ganbu;
char xibu;
int lunwen;
double sum;
struct student *next;
};
int n;
double total=0;
struct student *create()
{
struct student *p1,*p2,*head;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->qimo,&p1->banpin,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->sum=0;
if(p1->qimo>80&&p1->lunwen>0)p1->sum=p1->sum+8000;
if(p1->qimo>85&&p1->banpin>80)p1->sum=p1->sum+4000;
if(p1->qimo>90)p1->sum=p1->sum+2000;
if(p1->xibu=='Y'&&p1->qimo>85)p1->sum=p1->sum+1000;
if(p1->ganbu=='Y'&&p1->banpin>80)p1->sum=p1->sum+850;
total=total+p1->sum;
head=p1;
p2=p1;
p1->next=NULL;
int i=1;
do
{
if(i==n)break;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->qimo,&p1->banpin,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->sum=0;
if(p1->qimo>80&&p1->lunwen>0)p1->sum=p1->sum+8000;
if(p1->qimo>85&&p1->banpin>80)p1->sum=p1->sum+4000;
if(p1->qimo>90)p1->sum=p1->sum+2000;
if(p1->xibu=='Y'&&p1->qimo>85)p1->sum=p1->sum+1000;
if(p1->ganbu=='Y'&&p1->banpin>80)p1->sum=p1->sum+850;
total=total+p1->sum;
p2->next=p1;
p2=p1;
p1->next=NULL;
i++;
}while(1);
return(head);
}
struct student *findmax(struct student *head)
{
struct student *p,*max;
p=head->next;
max=head;
while(p!=NULL)
{
if(p->sum>max->sum)max=p;
p=p->next;
}
return(max);
}
int main()
{
scanf("%d",&n);
struct student *head,*max;
head=create();
max=findmax(head);
printf("%s\n%g\n%g",max->name,max->sum,total);
}
| 39 |
19,081 | //?????????
struct student
{
char name[25];
int score;
int cla;
char leader;
char west;
int paper;
};
struct scholar
{
char name[25];
int money;
};
struct scholar *scholar(struct student a[],int n)
{
struct scholar num[100],*p;
int i;
for(i=0;i<n;i++)
{
num[i].money=0;
strcpy(num[i].name,a[i].name);
}
p=num;
for(i=0;i<n;i++)
{
if(a[i].score>80&&a[i].paper>=1)
num[i].money+=8000;
if(a[i].score>85&&a[i].cla>80)
num[i].money+=4000;
if(a[i].score>90)
num[i].money+=2000;
if(a[i].score>85&&a[i].west=='Y')
num[i].money+=1000;
if(a[i].cla>80&&a[i].leader=='Y')
num[i].money+=850;
}
return(p);
}
void main()
{
int n,sum,i,m,r;
struct student a[100];
struct scholar *p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
if(i==0)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].score,&a[i].cla,&a[i].leader,&a[i].west,&a[i].paper);
}
else
scanf("\n%s %d %d %c %c %d",a[i].name,&a[i].score,&a[i].cla,&a[i].leader,&a[i].west,&a[i].paper);
}
p=scholar(a,n);
m=p->money;
r=0;
sum=p->money;
for(i=1;i<n;i++)
{
sum+=(p+i)->money;
if((p+i)->money>m)
{
r=i;
m=(p+i)->money;
}
}
printf("%s\n%d\n%d\n",a[r].name,m,sum);
}
| 39 |
19,082 | struct student
{
char name[21];
int fin;
int cla;
char q1;
char q2;
int pap;
}stu[101];
void main()
{
int n,i;
char namem[21];
int max=0,money[101];
int total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
money[i]=0;
scanf("%s %d %d %c %c %d",
&stu[i].name,&stu[i].fin,&stu[i].cla,&stu[i].q1,&stu[i].q2,&stu[i].pap);
if(stu[i].fin>80&&stu[i].pap>0) money[i]+=8000;
if(stu[i].fin>85&&stu[i].cla>80) money[i]+=4000;
if(stu[i].fin>90) money[i]+=2000;
if(stu[i].fin>85&&stu[i].q2=='Y') money[i]+=1000;
if(stu[i].cla>80&&stu[i].q1=='Y') money[i]+=850;
if(money[i]>money[max]){max=i;}
total+=money[i];
}
printf("%s\n%d\n%d\n",stu[max].name,money[max],total);
} | 39 |
19,083 | 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)
{
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=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,084 | struct
{
int tgra;
char name[21];
int cgra;
char statue;
char west;
int paper;
}stu[100];
void main()
{
int N,i,j,q,scholar[100]={0},temp,n=1,total=0;
char media[21];
char a;
scanf("%d\n",&N);
for(i=0;i<N;i++)
{
for(j=0;(a=getchar())!=' ';j++)
stu[i].name[j]=a;
stu[i].name[j]='\0';
scanf("%d %d %c %c %d",&stu[i].tgra,&stu[i].cgra,&stu[i].statue,&stu[i].west,&stu[i].paper);
}
for(i=0;i<N;i++)
{
if((stu[i].tgra>80) && (stu[i].paper>=1))
scholar[i]=scholar[i]+8000;
if((stu[i].tgra>85) && (stu[i].cgra>80))
scholar[i]=scholar[i]+4000;
if(stu[i].tgra>90)
scholar[i]=scholar[i]+2000;
if(stu[i].tgra>85 && stu[i].west=='Y')
scholar[i]=scholar[i]+1000;
if(stu[i].cgra>80 && stu[i].statue=='Y')
scholar[i]=scholar[i]+850;
}
q=0;
for(j=1;j<N;j++)
{
if(scholar[q]<scholar[j])
{
q=j;
}
}
//puts(stu[0].name);
for(i=0;i<strlen(stu[q].name);i++)
{
if (stu[q].name[i]!=10)
printf("%c",stu[q].name[i]);
}
printf("\n%d\n",scholar[q]);
for(i=0;i<N;i++)
total=total+scholar[i];
printf("%d\n",total);
}
| 39 |
19,085 | struct student
{
char name[20];
int num1;
int num2;
char a;
char b;
int c;
int sum;
struct student *next;
};
struct student *creat(void)
{
struct student *head;
struct student *p1,*p2;
int n;
scanf("%d",&n);
p1=p2=(struct student*)malloc(LEN);
int i=0;
scanf("%s %d %d %c %c %d",p1->name,&p1->num1,&p1->num2,&p1->a,&p1->b,&p1->c);
i=i+1;
head=NULL;
while(i<n)
{
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->num1,&p1->num2,&p1->a,&p1->b,&p1->c);
i=i+1;
}
p2->next=p1;
p1->next=NULL;
return(head);
}
void print(struct student *head)
{
struct student *p,*max;
int d=0;
p=head;
if(head!=NULL)
while(p!=NULL)
{
(*p).sum=0;
if((*p).num1>80&&(*p).c!=0)
(*p).sum+=8000;
else (*p).sum+=0;
if((*p).num1>85&&(*p).num2>80)
(*p).sum+=4000;
else (*p).sum+=0;
if((*p).num1>90)
(*p).sum+=2000;
else (*p).sum+=0;
if((*p).num1>85&&(*p).b=='Y')
(*p).sum+=1000;
else(*p).sum+=0;
if((*p).num2>80&&(*p).a=='Y')
(*p).sum+=850;
else (*p).sum+=0;
d+=(*p).sum;
p=p->next;
}
p=head;
max=head;
max->sum=0;
if(head!=NULL)
while(p!=NULL)
{
if(p->sum>max->sum)
max=p;
p=p->next;
}
printf("%s\n%d\n",max->name,max->sum);
printf("%d",d);
}
void main()
{
struct student *head;
head=creat();
print(head);
}
| 39 |
19,086 | struct student
{
char name[20];
int a;
int b;
char c;
char d;
int e;
int sum;
}stu[100];
int f1(int a,int b);
int f2(int a,int b);
int f3(int a);
int f4(int a,char b);
int f5(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].a,&stu[i].b,&stu[i].c,&stu[i].d,&stu[i].e);
stu[i].sum=0;
}
for(i=0;i<n;i++)
{
if(f1(stu[i].a,stu[i].e)==1)
{
stu[i].sum+=8000;
sum+=8000;
}
if(f2(stu[i].a,stu[i].b)==1)
{
stu[i].sum+=4000;
sum+=4000;
}
if(f3(stu[i].a)==1)
{
stu[i].sum+=2000;
sum+=2000;
}
if(f4(stu[i].a,stu[i].d)==1)
{
stu[i].sum+=1000;
sum+=1000;
}
if(f5(stu[i].b,stu[i].c)==1)
{
stu[i].sum+=850;
sum+=850;
}
}
k=stu[0].sum;
for(i=0;i<n;i++)
{
if(k<stu[i].sum)
{
j=i;
k=stu[i].sum;
}
}
printf("%s\n%d\n%d",stu[j].name,stu[j].sum,sum);
return 0;
}
int f1(int a,int b)
{
if(a>80&&b>=1)
return 1;
else return 0;
}
int f2(int a,int b)
{
if(a>85&&b>80)
return 1;
else return 0;
}
int f3(int a)
{
if(a>90)
return 1;
else return 0;
}
int f4(int a,char b)
{
if(a>85&&b=='Y')
return 1;
else return 0;
}
int f5(int a,char b)
{
if(a>80&&b=='Y')
return 1;
else return 0;
} | 39 |
19,087 | int main()
{
struct student
{
char name[20];
int qm;
int py;
char gb[2];
char xb[2];
int lw;
int jxj;
}student[2]={{'\0',0,0,'\0','\0',0,0},{'\0',0,0,'\0','\0',0,0}};
struct student temp={'\0',0,0,'\0','\0',0,0};
int i,n,sum;
scanf("%d",&n);
sum=0;
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",student[1].name,&student[1].qm,&student[1].py,student[1].gb,student[1].xb,&student[1].lw);
if(student[1].py>80&&strcmp(student[1].gb,"Y")==0)
{
student[1].jxj=student[1].jxj+850;
}
if(student[1].qm>80&&student[1].lw>=1)
{
student[1].jxj=student[1].jxj+8000;
}
if(student[1].qm>85&&student[1].py>80)
{
student[1].jxj=student[1].jxj+4000;
}
if(student[1].qm>90)
{
student[1].jxj=student[1].jxj+2000;
}
if(student[1].qm>85&&strcmp(student[1].xb,"Y")==0)
{
student[1].jxj=student[1].jxj+1000;
}
sum=sum+student[1].jxj;
if(student[1].jxj>student[0].jxj)
{
temp=student[1];
student[1]=student[0];
student[0]=temp;
}
student[1].jxj=0;
}
printf("%s\n%d\n%d\n",student[0].name,student[0].jxj,sum);
}
| 39 |
19,088 | struct student
{char name[20];
int g1;
int g2;
char id1;
char id2;
int t;
int s;
}stu[100];
void main()
{
int n,sum=0,i,r,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
stu[i].s=0;
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].g1,&stu[i].g2,&stu[i].id1,&stu[i].id2,&stu[i].t);
if(stu[i].g1>80&&stu[i].t>0) stu[i].s+=8000;
if(stu[i].g1>85&&stu[i].g2>80) stu[i].s+=4000;
if(stu[i].g1>90) stu[i].s+=2000;
if(stu[i].g1>85&&stu[i].id2=='Y') stu[i].s+=1000;
if(stu[i].g2>80&&stu[i].id1=='Y') stu[i].s+=850;
sum+=stu[i].s;
}
m=stu[0].s;r=0;
for(i=0;i<n;i++)
{
if(stu[i].s>m)
{
m=stu[i].s;
r=i;
}
}
printf("%s\n%d\n%d\n",stu[r].name,stu[r].s,sum);
}
| 39 |
19,089 | struct student{
char name[20];
int a1;
int a2;
char b1;
char b2;
int c;
int money;
}stu[100];
void main()
{
int n,i,max=0,m=0;
struct student *p;
scanf("%d",&n);
for(p=stu;p<stu+n;p++)
{
scanf("%s %d %d %c %c %d",p->name,&p->a1,&p->a2,&p->b1,&p->b2,&p->c);
p->money=0;
if(p->a1>80&&p->c>=1) p->money=p->money+8000;
if(p->a1>85&&p->a2>80) p->money=p->money+4000;
if(p->a1>90) p->money=p->money+2000;
if(p->a1>85&&p->b2=='Y') p->money=p->money+1000;
if(p->a2>80&&p->b1=='Y') p->money=p->money+850;
}
for(p=stu;p<stu+n;p++)
if(p->money>max) max=p->money;
for(p=stu;p<stu+n;p++)
if (p->money==max)
{printf("%s\n%d\n",p->name,p->money);
break;}
for(p=stu;p<stu+n;p++)
m=m+p->money;
printf("%d",m);
} | 39 |
19,090 |
int cpu(int term_end,int class_talk,char stu_staff,char stu_west,int thesis_num)
{
int money =0;
if(term_end > 80 && thesis_num >=1)
money += 8000;
if(term_end > 85 && class_talk > 80)
money += 4000;
if(term_end > 90)
money += 2000;
if(term_end >85 && stu_west =='Y')
money += 1000;
if(class_talk > 80 && stu_staff =='Y')
money += 850;
return money;
}
int main()
{
int stu_num;
char name[21];
int term_end;
int class_talk;
char stu_staff;
char stu_west;
int thesis_num;
scanf("%d",&stu_num);
int stu_max = -1,stu_money,money =0;
char stu_name[21];
for(int i =0; i < stu_num; i++)
{
scanf("%s %d %d %c %c %d",
name,&term_end,&class_talk,&stu_staff,&stu_west,&thesis_num);
stu_money = cpu(term_end,class_talk,stu_staff,stu_west,thesis_num);
if(stu_money > stu_max)
{
stu_max = stu_money;
strcpy(stu_name,name);
}
money += stu_money;
}
printf("%s\n%d\n%d",stu_name,stu_max,money);
return 0;
} | 39 |
19,091 | int main()
{
struct stu
{
char name[20];
int qimo;
int banping;
char gb[2];
char xb[2];
int lw;
long int jxj;
}stu[100];
int n,N,a=0,b=0,c=0,d=0,e=0,max,temp,totle=0;
scanf("%d",&N);
for(n=0;n<N;n++)
scanf("%s%d%d%s%s%d",&stu[n].name,&stu[n].qimo,&stu[n].banping,&stu[n].gb,&stu[n].xb,&stu[n].lw);
for(n=0;n<N;n++)
{
a=0;b=0;c=0;d=0;e=0;
if((stu[n].qimo>80)&&(stu[n].lw>=1))a=8000;
if((stu[n].qimo>85)&&(stu[n].banping>80))b=4000;
if(stu[n].qimo>90)c=2000;
if((stu[n].banping>80)&&(strcmp(stu[n].gb,"Y")==0))e=850;
if((stu[n].qimo>85)&&(strcmp("Y",stu[n].xb)==0))d=1000;
stu[n].jxj=a+b+c+d+e;
}
for(n=0;n<N;n++)
{
totle+=stu[n].jxj;
}
for(n=1;n<N;n++)
if(stu[n].jxj>stu[0].jxj)
{
temp=stu[0].jxj;
stu[0].jxj=stu[n].jxj;
stu[n].jxj=temp;
strcpy(stu[0].name,stu[n].name);
}
printf("%s\n%d\n%d\n",stu[0].name,stu[0].jxj,totle);
return 0;
}
| 39 |
19,092 | struct student{
char name[20];
int s1;
int s2;
char gb;
char w;
int p;
int m;
};
void main()
{
int i,j,sum=0,n,max=0,t;
struct student stu[100];
scanf("%d",&n);
for(i=0;i<n;i++){
stu[i].m=0;
scanf("%s %d %d %c %c %d",&(stu[i].name),&(stu[i].s1),&(stu[i].s2),&(stu[i].gb),&(stu[i].w),&(stu[i].p));
if(stu[i].s1>80 && stu[i].p>0) stu[i].m=stu[i].m+8000;
if(stu[i].s1>85 && stu[i].s2>80 ) stu[i].m=stu[i].m+4000;
if(stu[i].s1>90) stu[i].m=stu[i].m+2000;
if(stu[i].s1>85 && stu[i].w=='Y') stu[i].m=stu[i].m+1000;
if(stu[i].s2>80 && stu[i].gb=='Y') stu[i].m=stu[i].m+850;
sum=sum+stu[i].m;
}
for(i=0;i<n;i++)
if(stu[i].m>max)
max=stu[i].m;
for(i=0;i<n;i++)
if(stu[i].m==max){
printf("%s\n%d\n%d",stu[i].name,max,sum);break;
}
} | 39 |
19,093 | void main()
{
struct stu
{char name[21];
int ta;
int ca;
char l;
char w;
int p;
char name0[21];
}stu[101],temp;
int sch[101],a;
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].ta,&stu[i].ca,&stu[i].l,&stu[i].w,&stu[i].p);
for(i=0;i<n;i++)
sch[i]=0;
for(i=0;i<n;i++)
{
if(stu[i].ta>80&&stu[i].p>=1)
sch[i]=sch[i]+8000;
if(stu[i].ta>85&&stu[i].ca>80)
sch[i]=sch[i]+4000;
if(stu[i].ta>90)
sch[i]=sch[i]+2000;
if(stu[i].ta>85&&stu[i].w=='Y')
sch[i]=sch[i]+1000;
if(stu[i].ca>80&&stu[i].l=='Y')
sch[i]=sch[i]+850;
}
for(i=1;i<n;i++)
{
if(sch[0]<sch[i])
{
a=sch[i];
sch[i]=sch[0];
sch[0]=a;
temp=stu[i];
stu[i]=stu[0];
stu[0]=temp;
}
}
for(i=0,j=0;i<n;i++)
j=j+sch[i];
printf("%s\n",stu[0].name);
printf("%d\n",sch[0]);
printf("%d\n",j);
}
| 39 |
19,094 | struct m{
char l[50];
int a;
int b;
char x;
char y;
int z;
int s;
};
struct m la[1000];
struct m mo;
void main()
{
int n,i,j,zo=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
la[i].z=0;
scanf("%s %d %d %c %c %d",&la[i].l,&la[i].a,&la[i].b,&la[i].x,&la[i].y,&la[i].z);
}
for(i=0;i<n;i++)
{
la[i].s=0;
if(la[i].a>80&&la[i].z!=0)
la[i].s=la[i].s+8000;
if(la[i].a>85&&la[i].b>80)
la[i].s=la[i].s+4000;
if(la[i].a>90)
la[i].s=la[i].s+2000;
if(la[i].a>85&&la[i].y==89)
la[i].s=la[i].s+1000;
if(la[i].b>80&&la[i].x==89)
la[i].s=la[i].s+850;
}
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
if(la[j].s<la[j+1].s)
{
mo=la[j];
la[j]=la[j+1];
la[j+1]=mo;
}
for(i=0;i<n;i++)
zo=zo+la[i].s;
printf("%s\n%d\n%d\n",la[0].l,la[0].s,zo);
}
| 39 |
19,095 | void main()
{
int n,i,j,s,max;
int qimo[150],ban[150],lun[150],zong[150];
char name[150][20],xue[150],xi[150],the[20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",name[i],&qimo[i],&ban[i],&xue[i],&xi[i],&lun[i]);
for(i=0;i<n;i++)
{
zong[i]=0;
if(qimo[i]>80 && lun[i]>=1)
zong[i]=zong[i]+8000;
if(qimo[i]>85 && ban[i]>80)
zong[i]=zong[i]+4000;
if(qimo[i]>90)
zong[i]=zong[i]+2000;
if(qimo[i]>85 && xi[i]=='Y')
zong[i]=zong[i]+1000;
if(ban[i]>80 && xue[i]=='Y')
zong[i]=zong[i]+850;
}
max=zong[0];
strcpy(the,name[0]);
for(i=1;i<n;i++)
if(zong[i]>max)
{
max=zong[i];
strcpy(the,name[i]);
}
s=0;
for(i=0;i<n;i++)
s=s+zong[i];
printf("%s\n",the);
printf("%d\n",max);
printf("%d\n",s);
} | 39 |
19,096 | struct student{
char name[21];
int pingjun;
int banyi;
char ganbu;
char west;
int paper;
}stu[120];
void scholar(struct student *p,int a);
int main(){
int n,i;
struct student *pointer1;
pointer1=stu;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].pingjun,&stu[i].banyi,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
scholar(pointer1,n);
return 0;
}
void scholar(struct student *p,int a){
int sums,sum=0,max=0;
int j,jishu=0;
for(j=0;j<a;j++){
sums=0;
if(((p+j)->pingjun>80)&&((p+j)->paper>0)){
sums+=8000;
}
if(((p+j)->pingjun>85)&&((p+j)->banyi>80)){
sums+=4000;
}
if((p+j)->pingjun>90){
sums+=2000;
}
if(((p+j)->pingjun>85)&&((p+j)->west=='Y')){
sums+=1000;
}
if(((p+j)->banyi>80)&&((p+j)->ganbu=='Y')){
sums+=850;
}
sum+=sums;
if(sums>max){
max=sums;
jishu=j;
}
}
printf("%s\n%d\n%d",(p+jishu)->name,max,sum);
} | 39 |
19,097 | void main()
{
struct student
{
char name[30],gb,west;
int sco1,sco2,paper,money;
} stu[100];
int n,i;
long sum=0,max=0;
char maxs[30];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].sco1,&stu[i].sco2,&stu[i].gb,&stu[i].west,&stu[i].paper);
stu[i].money=0;
if (stu[i].sco1>80&&stu[i].paper>=1) stu[i].money+=8000;
if (stu[i].sco1>85&&stu[i].sco2>80) stu[i].money+=4000;
if (stu[i].sco1>90) stu[i].money+=2000;
if (stu[i].sco1>85&&stu[i].west=='Y') stu[i].money+=1000;
if (stu[i].sco2>80&&stu[i].gb=='Y') stu[i].money+=850;
}
for (i=0;i<n;i++)
{
sum+=stu[i].money;
if (stu[i].money>max) {max=stu[i].money;strcpy(maxs,stu[i].name);}
}
printf("%s\n%ld\n%ld",maxs,max,sum);
} | 39 |
19,098 | struct score
{
char name[20];
int score1;
int score2;
char ganbu;
char xibu;
int lunwen;
}student[100];
int main()
{
int i,num,money,max=0,s=0;
scanf("%d",&num);
for(i=0;i<num;i++){
scanf("%s%d%d",student[i].name,&student[i].score1,&student[i].score2);
getchar();
scanf("%c",&student[i].ganbu);
getchar();
scanf("%c%d",&student[i].xibu,&student[i].lunwen);
}
for(i=0;i<num;i++){
money=0;
if(student[i].score1>80&&student[i].lunwen>0)money+=8000;
if(student[i].score1>85&&student[i].score2>80)money+=4000;
if(student[i].score1>90)money+=2000;
if(student[i].score1>85&&student[i].xibu=='Y')money+=1000;
if(student[i].score2>80&&student[i].ganbu=='Y')money+=850;
if(money>max) max=money;
s+=money;
}
for(i=0;i<num;i++){
money=0;
if(student[i].score1>80&&student[i].lunwen>0)money+=8000;
if(student[i].score1>85&&student[i].score2>80)money+=4000;
if(student[i].score1>90)money+=2000;
if(student[i].score1>85&&student[i].xibu=='Y')money+=1000;
if(student[i].score2>80&&student[i].ganbu=='Y')money+=850;
if(money==max){
printf("%s\n%d\n",student[i].name,max);
break;
}
}
printf("%d",s);
return 0;
}
| 39 |
19,099 | struct qian
{
char a[20];
int b[1];
int c[1];
char d[2];
char e[2];
int f[1];
}stu[100];
void main()
{
int n,k,x,y=0,total=0,i,sum[100]={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++)
{
k=0;
if(stu[i].b[0]>80&&stu[i].f[0]>=1)k=k+8000;
if(stu[i].b[0]>85&&stu[i].c[0]>80)k=k+4000;
if(stu[i].b[0]>90)k=k+2000;
if(stu[i].b[0]>85&&stu[i].e[1]=='Y')k=k+1000;
if(stu[i].c[0]>80&&stu[i].d[1]=='Y')k=k+850;
sum[i]=k;
}
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%d\n%d\n",stu[y].a,x,total);
} | 39 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.