label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
39
|
19400
|
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
|
19401
|
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
|
19402
|
struct student
{char name[20];
int qimo;
int banji;
char xs;
char xb;
int lw;
};
int f(struct student *p)
{
int num=0;
if(((p->qimo)>80)&&((p->lw)>=1))
num=num+8000;
if(((p->qimo)>85)&&((p->banji)>80))
num=num+4000;
if((p->qimo)>90)
num=num+2000;
if(((p->qimo)>85)&&((p->xb)=='Y'))
num=num+1000;
if(((p->banji)>80)&&((p->xs)=='Y'))
num=num+850;
return num;
}
void main()
{
int f(struct student *p);
struct student stu[100],*p;
int n,i,a[100]={0},*ap,b=0,k,m;
p=stu;ap=a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->qimo,&p->banji,&p->xs,&p->xb,&p->lw);
p=p+1;
}
p=stu;
for(i=0;i<n;i++)
{
*(ap+i)=f(p+i);
b=b+(*(ap+i));
}
k=a[0];
for(i=0;i<n;i++)
{
if(a[i]>k)
{ k=a[i];m=i;}
}
printf("%s\n%d\n%d\n",(stu+m)->name,k,b);
}
|
39
|
19403
|
struct Student{
char name[20];
int Academy;
int Class;
char Stujob;
char west;
int paper;
};
void main()
{
int N,i,j,scolar[100][6],max;
long int sum=0;
struct Student stu[100];
struct Student* p;
scanf("%d",&N);
for(i=0;i<N;i++)
for(j=0;j<6;j++)
scolar[i][j]=0;
for(p=stu;p<stu+N;p++)
scanf("%s %d %d %c %c %d",p->name,&p->Academy,&p->Class,&p->Stujob,&p->west,&p->paper);
for(i=0;i<N;i++)
{
if(stu[i].Academy>80&&stu[i].paper>=1)
scolar[i][0]=8000;
if(stu[i].Academy>85&&stu[i].Class>80)
scolar[i][1]=4000;
if(stu[i].Academy>90)
scolar[i][2]=2000;
if(stu[i].Academy>85&&stu[i].west=='Y')
scolar[i][3]=1000;
if(stu[i].Class>80&&stu[i].Stujob=='Y')
scolar[i][4]=850;
}
for(i=0;i<N;i++)
for(j=4;j>=0;j--)
scolar[i][5]=scolar[i][5]+scolar[i][j];
max=scolar[0][5];j=0;
for(i=0;i<N;i++)
if(scolar[i][5]>max)
{ max=scolar[i][5];j=i;}
printf("%s\n%d\n",stu[j].name,scolar[j][5]);
for(i=0;i<N;i++)
sum=sum+scolar[i][5];
printf("%ld",sum);
}
|
39
|
19404
|
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
|
19405
|
struct SCL
{
char stu[20];
int avg;
int rev;
char ldr;
char wst;
int ppr;
int sum;
}SCL[100];
int main()
{
int n, max=0, sum=0;
char *name;
struct SCL *p;
scanf("%d", &n);
for(p=SCL; p<SCL+n; p++)
{
scanf("%s %d %d %c %c %d", p->stu, &p->avg, &p->rev, &p->ldr, &p->wst, &p->ppr);
p->sum=0;
if(p->avg>80 && p->ppr>0)
p->sum+=8000;
if(p->avg>85 && p->rev>80)
p->sum+=4000;
if(p->avg>90)
p->sum+=2000;
if(p->avg>85 && p->wst=='Y')
p->sum+=1000;
if(p->rev>80 && p->ldr=='Y')
p->sum+=850;
}
for(p=SCL; p<SCL+n; p++)
{
if(p->sum>max)
{
max=p->sum;
name=p->stu;
}
sum+=p->sum;
}
printf("%s\n%d\n%d\n", name, max, sum);
return 0;
}
|
39
|
19406
|
struct student
{
char name[20];
int ss;
int cs;
char g[2];
char w[2];
int pa;
int m;
struct student *next;
};
void main()
{
int i,n,mm=0,all=0;
scanf("%d",&n);
struct student *head,*p1,*p2,*p,*q;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %s %s %d",p1->name,&p1->ss,&p1->cs,p1->g,p1->w,&p1->pa);
head=NULL;
while(mm<n-1)
{
mm=mm+1;
if(mm==1) head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %s %s %d",p1->name,&p1->ss,&p1->cs,p1->g,p1->w,&p1->pa);
}
p2->next=p1;
p2=p1;
p2->next=NULL;
/*?????*/
p=head;
do
{
p->m=0;
if(p->ss>80&&p->pa>=1)
p->m=p->m+8000;
if(p->ss>85&&p->cs>80)
p->m=p->m+4000;
if(p->ss>90)
p->m=p->m+2000;
if(p->ss>85&&strcmp(p->w,"Y")==0)
p->m=p->m+1000;
if(p->cs>80&&strcmp(p->g,"Y")==0)
p->m=p->m+850;
p=p->next;
}while(p!=NULL);
p=q=head;
do
{
all=all+q->m;
if(p->m<q->m)
p=q;
q=q->next;
}while(q!=NULL);
printf("%s\n%d\n%d\n",p->name,p->m,all);
}
|
39
|
19407
|
/*????????????????????????????????????????????
1) ????????8000??????????80??>80??
?????????1??1?????????????
2) ????????4000??????????85??>85??
??????????80??>80?????????
3) ????????2000??????????90??>90?
????????
4) ????????1000??????????85??>85?
????????????
5) ????????850??????????80??>80?
??????????
????????????????????????????????????????????????????????87????????82????????????????????????????????????????4850??
??????????????????????????????????????????????????
????
?????????????????????????????????????????????????????????????????????????????????????????N?????????????
????
4
YaoLin 87 82 Y N 0
ChenRuiyi 88 78 N Y 1
LiXin 92 88 N N 0
ZhangQin 83 87 Y N 1
????
ChenRuiyi
9000
28700
*/
struct student{
char name[30];
int qimo,banji;
char ganbu,xibu;
int lunwen;
int money;
};
int suan(struct student *s){
//1) ????????8000??????????80??>80??
//?????????1??1?????????????
int mon=0;
if (s->qimo >80&&s->lunwen>=1) mon+=8000;
// 2) ????????4000??????????85??>85??????????
//??80??>80?????????
if (s->qimo >85&&s->banji >80) mon+=4000;
// 3) ????????2000??????????90??>90?????????
if (s->qimo >90) mon+=2000;
//4) ????????1000??????????85??>85?????????????
if (s->qimo >85&&s->xibu =='Y') mon+=1000;
//5) ????????850??????????80??>80???????????
if (s->banji >80&&s->ganbu =='Y') mon+=850;
return mon;
}
int main()
{
long int n,sum=0;
int i;
char tmp;
struct student *stu,*max;
scanf("%d",&n);
stu=(struct student *)malloc(sizeof(struct student)*n);
for (i=0;i<n;i++){ //ChenRuiyi 88 78 N Y 1
scanf("%s%d%d%c%c%c%c%d",stu[i].name,&(stu[i].qimo),&(stu[i].banji),&tmp,&(stu[i].ganbu),&tmp,&(stu[i].xibu),&(stu[i].lunwen));
stu[i].money=suan(stu+i);
sum+=stu[i].money;
}
max=stu+n-1;
for (i=n-1;i>0;i--)
if (max->money<=stu[i].money) max=stu+i;
printf("%s\n%d\n%d\n",max->name,max->money,sum);
}
|
39
|
19408
|
struct student
{
char name[20];
int score1;
int score2;
char lead;
char west;
int paper;
int sum;
struct student *next;
};
int money(struct student *p)
{
int z=0;
if((p->score1>80)&&(p->paper>=1))
z+=8000;
if((p->score1>85)&&(p->score2>80))
z+=4000;
if(p->score1>90)
z+=2000;
if((p->score1>85)&&(p->west=='Y'))
z+=1000;
if((p->score2>80)&&(p->lead=='Y'))
z+=850;
return(z);
}
void main()
{
long total=0;
struct student *p1,*p2,*p0,*head;
int n,i;
scanf("%d",&n);
p1=p2=(struct student*)malloc(LEN);
head=NULL;
scanf("%s %d %d %c %c %d\n",p1->name,&p1->score1,&p1->score2,&p1->lead,&p1->west,&p1->paper);
p0=p1;
p1->sum=money(p1);
total+=p1->sum;
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\n",p1->name,&p1->score1,&p1->score2,&p1->lead,&p1->west,&p1->paper);
p1->sum=money(p1);
if(p0->sum<p1->sum)p0=p1;
total+=p1->sum;
}
printf("%s\n%d\n%ld\n",p0->name,p0->sum,total);
}
|
39
|
19409
|
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
|
19410
|
int main()
{
int n,i,e=0;
struct student
{char name[20];
int scorea;
int scoreb;
char a;
char f;
int b;
int c;
}d[100],s;
s.c=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s%d%d %c %c %d",d[i].name,&d[i].scorea,&d[i].scoreb,&d[i].a,&d[i].f,&d[i].b);
d[i].c=0;
if(d[i].scorea>80&&d[i].b>0)
d[i].c=d[i].c+8000;
if(d[i].scorea>85&&d[i].scoreb>80)
d[i].c=d[i].c+4000;
if(d[i].scorea>90)
d[i].c=d[i].c+2000;
if(d[i].scorea>85&&d[i].f=='Y')
d[i].c=d[i].c+1000;
if(d[i].scoreb>80&&d[i].a=='Y')
d[i].c=d[i].c+850;
e=e+d[i].c;
}
for(i=0;i<n;i++)
{if(d[i].c>s.c)
s=d[i];}
printf("%s\n%d\n%d",s.name,s.c,e);
return 0;
}
|
39
|
19411
|
void main()
{
struct stu
{
char name[21];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int zongjiangjin;
}stu[100];
struct stu temp;
int n,i,j;
int sum;
int total=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);
sum=0;
if(stu[i].qimo>80&&stu[i].lunwen>=1)
sum=sum+8000;
if(stu[i].qimo>85&&stu[i].banji>80)
sum=sum+4000;
if(stu[i].qimo>90)
sum=sum+2000;
if(stu[i].qimo>85&&stu[i].xibu=='Y')
sum=sum+1000;
if(stu[i].banji>80&&stu[i].ganbu=='Y')
sum=sum+850;
stu[i].zongjiangjin=sum;
total=total+sum;
}
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
if(stu[i].zongjiangjin<stu[i+1].zongjiangjin)
{
temp=stu[i];
stu[i]=stu[i+1];
stu[i+1]=temp;
}
printf("%s\n",stu[0].name);
printf("%d\n",stu[0].zongjiangjin);
printf("%d\n",total);
}
|
39
|
19412
|
int main()
{
int n, i;
scanf("%d", &n);
int sum[100]={0}, total=0;
char name[100][20];
for(i=0;i<n;i++)
{
int a, b;
char p[2], q[2];
int l;
scanf("%s%d%d%s%s%d", &name[i], &a, &b, &p, &q, &l);
if(a>80&&l!=0)
{
sum[i]+=8000;
}
if(a>85&&b>80)
{
sum[i]+=4000;
}
if(a>90)
{
sum[i]+=2000;
}
if(a>85&&strcmp(q,"Y")==0)
{
sum[i]+=1000;
}
if(b>80&&strcmp(p,"Y")==0)
{
sum[i]+=850;
}
total+=sum[i];
}
int max=0, k;
for(i=0;i<n;i++)
{
if(sum[i]>max)
{
max=sum[i];
k=i;
}
}
printf("%s\n%d\n%d\n", name[k], sum[k], total);
return 0;
}
|
39
|
19413
|
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
|
19414
|
void main()
{
int sum[100]={0},i,n,p=0;
struct student
{
char name[21];
int a;
int b;
char c;
char d;
int e;
}stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].a,&stu[i].b,
&stu[i].c,&stu[i].d,&stu[i].e);
}
for(i=0;i<n;i++)
{
if(stu[i].a>80&&stu[i].e>=1)
sum[i]+=8000;
if(stu[i].a>85&&stu[i].b>80)
sum[i]+=4000;
if(stu[i].a>90)
sum[i]+=2000;
if(stu[i].a>85&&stu[i].d=='Y')
sum[i]+=1000;
if(stu[i].b>80&&stu[i].c=='Y')
sum[i]+=850;
}
for(i=0;i<n;i++)
{p+=sum[i];}
for(i=1;i<n;i++)
{
if(sum[0]<sum[i])
{stu[0]=stu[i];
sum[0]=sum[i];}
}
printf("%s\n",stu[0].name);
printf("%d\n",sum[0]);
printf("%d",p);
}
|
39
|
19415
|
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
|
19416
|
void main()
{
struct student
{
char name[100];
int num1,num2;
char c1,c2;
int paper;
}stu[100];
int N,sum=0,i,m,b[100],max=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].num1,&stu[i].num2,&stu[i].c1,&stu[i].c2,&stu[i].paper);
b[i]=0;
if(stu[i].num1>80&&stu[i].paper>0)b[i]+=8000;
if(stu[i].num1>85&&stu[i].num2>80)b[i]+=4000;
if(stu[i].num1>90)b[i]+=2000;
if(stu[i].num1>85&&stu[i].c2=='Y')b[i]+=1000;
if(stu[i].num2>80&&stu[i].c1=='Y')b[i]+=850;
sum+=b[i];
if(b[i]>max)
{
max=b[i];
m=i;
}
}
printf("%s\n%d\n%d",stu[m].name,b[m],sum);
}
|
39
|
19417
|
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
|
19418
|
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
|
19419
|
int main(){
int i,n,m,a,b,k,max;
char c1,c2;
char na[100][100];
long sum,s[1000]={0};
scanf("%d",&n);
sum=0;max=0;
for (i=0;i<n;i++){
s[i]=0;
scanf("%s %d %d %c %c %d",na[i],&a,&b,&c1,&c2,&k);
if (a>80&&k>=1) s[i]+=8000;
if (a>85&&b>80) s[i]+=4000;
if (a>90) s[i]+=2000;
if (a>85&&c2=='Y') s[i]+=1000;
if (b>80&&c1=='Y') s[i]+=850;
sum+=s[i];
if (max<s[i]) {max=s[i];m=i;}
}
printf("%s\n",na[m]);
printf("%d\n",s[m]);
printf("%d\n",sum);
return 0;
}
|
39
|
19420
|
int main()
{
struct stu
{
char name[20];
int a;
int b;
char c[2];
char d[2];
int e;
int m;
};
struct stu *p;
int n,i,max=0,t,sum=0;
scanf("%d",&n);
p=(struct stu *)malloc(n*sizeof(struct stu));
for(i=0;i<n;i++)
scanf("%s%d%d%s%s%d",(p+i)->name,&(p+i)->a,&(p+i)->b,(p+i)->c,(p+i)->d,&(p+i)->e);
for(i=0;i<n;i++)
(p+i)->m=0;
for(i=0;i<n;i++)
{
if((((p+i)->a)>80)&&(((p+i)->e)>0))
(p+i)->m+=8000;
if((((p+i)->a)>85)&&(((p+i)->b)>80))
(p+i)->m+=4000;
if(((p+i)->a)>90)
(p+i)->m+=2000;
if((((p+i)->a)>85)&&(((p+i)->d[0])=='A'+24))
(p+i)->m+=1000;
if((((p+i)->b)>80)&&(((p+i)->c[0])=='A'+24))
(p+i)->m+=850;
}
for(i=0;i<n;i++)
if(((p+i)->m)>max)
{
max=(p+i)->m;
t=i;
}
for(i=0;i<n;i++)
sum+=(p+i)->m;
printf("%s\n",(p+t)->name);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
|
39
|
19421
|
int main(int argc, char* argv[])
{
int n,s1,s2,paper,i,money[100],m=0,sum=0,a;
char name[100][20],c1=0,c2=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
money[i]=0;
scanf("%s %d %d %c %c %d\n",name[i],&s1,&s2,&c1,&c2,&paper);
if(s1>80&&paper>=1)
{
money[i]=money[i]+8000;
}
if(s1>85&&s2>80)
{
money[i]=money[i]+4000;
}
if(s1>90)
{
money[i]=money[i]+2000;
}
if(s1>85&&c2=='Y')
{
money[i]=money[i]+1000;
}
if(s2>80&&c1=='Y')
{
money[i]=money[i]+850;
}
if(money[i]>m)
{
m=money[i];
a=i;
}
sum=sum+money[i];
}
printf("%s\n%d\n%d",name[a],m,sum);
return 0;
}
|
39
|
19422
|
struct student
{
char name[20];
int a;
int b;
char cla;
char west;
int paper;
int total;
}s[100];
int main()
{
int n,i,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",s[i].name);
scanf("%d%d %c %c%d",&s[i].a,&s[i].b,&s[i].cla,&s[i].west,&s[i].paper);
s[i].total=0;
if(s[i].a>80&&s[i].paper>=1)
s[i].total+=8000;
if(s[i].a>85&&s[i].b>80)
s[i].total+=4000;
if(s[i].a>90)
s[i].total+=2000;
if(s[i].a>85&&s[i].west=='Y')
s[i].total+=1000;
if(s[i].b>80&&s[i].cla=='Y')
s[i].total+=850;
sum+=s[i].total;
}
for(i=1;i<n;i++)
{
if(s[i].total>s[0].total)
s[0]=s[i];
}
printf("%s\n",s[0].name);
printf("%d\n",s[0].total);
printf("%d",sum);
return 0;
}
|
39
|
19423
|
struct stu
{char num[200];
int qimo;
int banji;
char gan;
char sheng;
int lun;
int qian;
struct stu * next;
};
void sort(struct stu * head,struct stu * q)
{
struct stu *pre=head,*p=pre->next,*s;
s=(struct stu *)malloc(sizeof(struct stu));
s->banji=q->banji;strcpy(s->num,q->num);s->qimo=q->qimo;s->qian=q->qian;s->sheng=q->sheng;s->gan=q->gan;
s->next=NULL;
while((p!=NULL)&&(s->qian<=p->qian))
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
void main()
{
int n,k,i,all,tol=0;
float m;
char num[20];
struct stu *head;
struct stu *p,*q;
head=(struct stu *)malloc(sizeof(struct stu));
head->next=NULL;
scanf("%d",&n);
for (i=1;i<=n;i++)
{ all=0;
p=(struct stu *)malloc(sizeof(struct stu));
scanf("%s %d %d %c %c %d",p->num,&p->qimo,&p->banji,&p->gan,&p->sheng,&p->lun);
if((p->qimo>80)&&(p->lun>0)) all=all+8000;
if((p->qimo>85)&&(p->banji>80)) all=all+4000;
if(p->qimo>90) all=all+2000;
if((p->qimo>85)&&(p->sheng=='Y')) all=all+1000;
if((p->banji>80)&&(p->gan=='Y')) all=all+850;
p->qian=all;
tol=tol+all;
sort(head,p);
}
p=head->next;
printf("%s\n",p->num);
printf("%d\n",p->qian);
printf("%d\n",tol);
}
|
39
|
19424
|
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
|
19425
|
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
|
19426
|
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
|
19427
|
int main()
{
int n,i,a[200],b[200],c[200],m[200],s=0,max,maxj;
char d[200][40],e[200],f[200];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d %c %c %d",d[i],&a[i],&b[i],&e[i],&f[i],&c[i]);
}
for(i=0;i<n;i++){
m[i]=0;
if(a[i]>80 && c[i]>0){
m[i]+=8000;
}
if(a[i]>85 && b[i]>80){
m[i]+=4000;
}
if(a[i]>90){
m[i]+=2000;
}
if(a[i]>85 && f[i]=='Y'){
m[i]+=1000;
}
if(b[i]>80 && e[i]=='Y'){
m[i]+=850;
}
}
for(i=0;i<n;i++){
s+=m[i];
}
max=m[0];
maxj=0;
for(i=1;i<n;i++){
if(m[i]>max){
max=m[i];
maxj=i;
}
}
printf("%s\n%d\n%d",d[maxj],max,s);
return 0;
}
|
39
|
19428
|
struct data
{
char name[21];
int final;
int assess;
char servant;
char west;
int pub;
int bonus;
}student[100], *medium;
void yuanshi(struct data *student)
{
if(student->final>80&&student->pub>0)
student->bonus=student->bonus+8000;
}
void wusi(struct data *student)
{
if(student->final>85&&student->assess>80)
student->bonus=student->bonus+4000;
}
void chengji(struct data *student)
{
if(student->final>90)
student->bonus=student->bonus+2000;
}
void xibu(struct data *student)
{
if(student->final>85&&student->west=='Y')
student->bonus=student->bonus+1000;
}
void banji(struct data *student)
{
if(student->assess>80&&student->servant=='Y')
student->bonus=student->bonus+850;
}
int main()
{
int n;
int i, j, index;
int max=0, sum=0;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%s %d %d %c %c %d", student[i].name, &student[i].final, &student[i].assess, &student[i].servant, &student[i].west, &student[i].pub);
student[i].bonus=0;
}
medium=student;
for(i=0; i<n; i++)
{
banji(medium+i);
xibu(medium+i);
chengji(medium+i);
yuanshi(medium+i);
wusi(medium+i);
}
for(i=0; i<n; i++)
{
if(max<student[i].bonus)
{
max=student[i].bonus;
index=i;
}
sum=sum+student[i].bonus;
}
printf("%s\n%d\n%d", student[index].name, max, sum);
return 0;
}
|
39
|
19429
|
struct student
{
char name[21];
int score;
int point;
char s1[2];
char s2[2];
int paper;
}stu[100];
void main()
{
int n,i,total=0,t[100]={0},max=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{scanf("%s%d%d%s%s%d",stu[i].name,&stu[i].score,&stu[i].point,stu[i].s1,stu[i].s2,&stu[i].paper);}
for(i=0;i<n;i++)
{
if(stu[i].score>80)
{
if(stu[i].paper!=0)
t[i]+=8000;
if(stu[i].score>85&&stu[i].point>80)
t[i]+=4000;
if(stu[i].score>85&&stu[i].s2[0]=='Y')
t[i]+=1000;
if(stu[i].score>90)
t[i]+=2000;
}
if(stu[i].point>80&&stu[i].s1[0]=='Y')
t[i]+=850;
}
for(i=0;i<n;i++)
{ max=max>t[i]?max:t[i];}
for(i=0;i<n;i++)
{
if(max==t[i])
{
printf("%s\n%d\n",stu[i].name,max);break;
}
}
for(i=0;i<n;i++)
{ total+=t[i];
}
printf("%d\n",total);
}
|
39
|
19430
|
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
|
19431
|
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
|
19432
|
struct student
{
char name[20];
int final;
int cla;
char west;
char cadre;
int eas;
int sum;
}stu[100];
void main()
{
int n,i;
int all=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].cla,&stu[i].cadre,&stu[i].west,&stu[i].eas);
if((stu[i].final>80)&&(stu[i].eas>=1))
stu[i].sum=stu[i].sum+8000;
if((stu[i].final>85)&&(stu[i].cla>80))
stu[i].sum=stu[i].sum+4000;
if(stu[i].final>90)
stu[i].sum=stu[i].sum+2000;
if((stu[i].final>85)&&(stu[i].west=='Y'))
stu[i].sum=stu[i].sum+1000;
if((stu[i].cla>80)&&(stu[i].cadre=='Y'))
stu[i].sum=stu[i].sum+850;
}
for(i=0;i<n;i++)
{
all=all+stu[i].sum;
}
int most=0;
for(i=1;i<n;i++)
{
if(stu[i].sum>stu[most].sum)
most=i;
}
printf("%s\n%d\n%d\n",stu[most].name,stu[most].sum,all);
}
|
39
|
19433
|
main()
{
int n,i,k,sut=0,sum=0;
struct
{
char na[21];
int sc;
int op;
char ga;
char we;
int nu;
int su;
}stu[100];
for (i=0;i<100;i++)
{
stu[i].su=0;
}
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",stu[i].na);
scanf("%d",&stu[i].sc);
scanf("%d ",&stu[i].op);
scanf("%c ",&stu[i].ga);
scanf("%c",&stu[i].we);
scanf("%d",&stu[i].nu);
}
for (i=0;i<n;i++)
{
if ((stu[i].sc>80)&&(stu[i].nu>0))
stu[i].su+=8000;
if ((stu[i].sc>85)&&(stu[i].op>80))
stu[i].su+=4000;
if (stu[i].sc>90)
stu[i].su+=2000;
if ((stu[i].sc>85)&&(stu[i].we=='Y'))
stu[i].su+=1000;
if ((stu[i].op>80)&&(stu[i].ga=='Y'))
stu[i].su+=850;
}
for (i=0;i<n;i++)
{
if (sut<stu[i].su)
{
k=i;
sut=stu[i].su;
}
}
for (i=0;i<n;i++)
sum+=stu[i].su;
printf("%s\n%d\n%d\n",stu[k].na,sut,sum);
}
|
39
|
19434
|
struct stu
{
char name[20];
int mark1;
int mark2;
char gan;
char west;
int paper;
int money;
struct stu *next;
};
void main()
{
int i,n,max=0,sum=0;
struct stu *head,*p1,*p2,*p;
scanf("%d\n",&n);
p1=(struct stu*)malloc(sizeof(struct stu));
p2=p1;
head=p1;
scanf("%s %d %d %c %c %d\n",p1->name,&p1->mark1,&p1->mark2,&p1->gan,&p1->west,&p1->paper);
p1->money=0;
for(i=1;i<n;i++)
{
p1=(struct stu*)malloc(sizeof(struct stu));
p2->next=p1;
p2=p1;
scanf("%s %d %d %c %c %d\n",p1->name,&p1->mark1,&p1->mark2,&p1->gan,&p1->west,&p1->paper);
p1->money=0;
}
p2->next=NULL;
for(p=head;p!=NULL;p=p->next)
{
if((p->mark1>80)&&(p->paper>=1)){p->money+=8000;}
if((p->mark1>85)&&(p->mark2>80)){p->money+=4000;}
if(p->mark1>90){p->money+=2000;}
if((p->mark1>85)&&(p->west=='Y')){p->money+=1000;}
if((p->mark2>80)&&(p->gan=='Y')){p->money+=850;}
}
for(p=head;p!=NULL;p=p->next)
{
sum+=p->money;
if(p->money>max)
{max=p->money;}
}
for(p=head;p!=NULL;p=p->next)
{
if(p->money==max)
{printf("%s\n%d\n%d",p->name,p->money,sum);break;}
}
}
|
39
|
19435
|
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
|
19436
|
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
|
19437
|
int main(int argc, char* argv[])
{
struct stu
{ char name[20];
int fen;
int ban;
char gan[1];
char xi[1];
int wen;
}s[100];
int n,i,j,money=0,mon=0,mona=0;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s",s[i].name);
scanf("%d",&s[i].fen);
scanf("%d",&s[i].ban);
scanf("%s",s[i].gan);
scanf("%s",s[i].xi);
scanf("%d",&s[i].wen);
if (s[i].fen>80&&s[i].wen>=1)
money=money+8000;
if (s[i].fen>85&&s[i].ban>80)
money=money+4000;
if (s[i].fen>90)
money=money+2000;
if (s[i].fen>85&&s[i].xi[0]=='Y')
money=money+1000;
if (s[i].ban>80&&s[i].gan[0]=='Y')
money=money+850;
if (money>mon){
mon=money;
j=i;
}
mona=mona+money;
money=0;
}
printf("%s\n",s[j].name);
printf("%d\n",mon);
printf("%d\n",mona);
return 0;
}
|
39
|
19438
|
void main()
{
struct student
{char name[21];
int term,cla;
char lead,west;
int dis,sum;
}s,s1;
int n,i,money[5],total;
scanf("%d",&n);
s1.sum=-1;
total=0;
for(i=0;i<n;i++)
{ money[0]=money[1]=money[2]=money[3]=money[4]=0;
scanf("%s %d %d %c %c %d",s.name,&s.term,&s.cla,&s.lead,&s.west,&s.dis);
if(s.term>80&&s.dis>0) money[0]=8000;
if(s.term>85&&s.cla>80) money[1]=4000;
if(s.term>90) money[2]=2000;
if(s.term>85&&s.west=='Y') money[3]=1000;
if(s.cla>80&&s.lead=='Y') money[4]=850;
s.sum=money[0]+money[1]+money[2]+money[3]+money[4];
total+=s.sum;
if(s.sum>s1.sum) s1=s;
}
printf("%s\n%d\n%d\n",s1.name,s1.sum,total);
}
|
39
|
19439
|
void main()
{
struct student
{
char name[30];//??????????\0
int as;
int cs;
char pos;
char xibu;
int paper;
int money;
}stu[100],*p;
p=stu;
int i,n,sum=0,mark,max=0;
scanf("%d",&n);
for(i=0;i<n;i++,p++)
{
scanf("%s%d%d %c %c%d",&p->name,&p->as,&p->cs,&p->pos,&p->xibu,&p->paper);// ???%C?????
p->money=0;
if(p->as>80&&p->paper>=1)
p->money=p->money+8000;
if(p->as>85&&p->cs>80)
p->money=p->money+4000;
if(p->as>90)
p->money=p->money+2000;
if(p->as>85&&p->xibu=='Y')
p->money=p->money+1000;
if(p->pos=='Y'&&p->cs>80)
p->money=p->money+850;
sum=sum+p->money;
}
p=stu;//????????
for(i=0;i<n-1;i++,p++)
{
if(p->money>max)
{
max=p->money;
mark=i;
}
}
printf("%s\n%d\n%d",stu[mark].name,max,sum);
}
|
39
|
19440
|
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
|
19441
|
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
|
19442
|
struct student
{
char name[20];//?????//
int final;//??????//
int a;//??????//
char b;//???????//
char c;//???????//
int d;//??????//
int scholarship;
struct student *next;
};
int main()
{
int N,i,j,money;
long int sum=0;
char a[20];
scanf("%d",&N);
struct student *p1,*p2,*head;
for(i=0;i<N;i++)
{
p1=(struct student *)malloc(Len);
p1->scholarship=0;
if(i==0)
{
head=p1;
}
else
{
p2->next=p1;
}
p2=p1;
scanf("%s %d %d %c %c %d",p1->name,&p1->final,&p1->a,&p1->b,&p1->c,&p1->d);
}
p2->next=NULL;
p1=head;
for(i=0;i<N;i++)
{
if(p1->final>80&&p1->d>=1)//????80???????>=1//
{
p1->scholarship+=8000;
}
if(p1->final>85&&p1->a>80)//????85?????????80???//
{
p1->scholarship+=4000;
}
if(p1->final>90)//????90???//
{
p1->scholarship+=2000;
}
if(p1->final>85&&p1->c=='Y')//????85???????//
{
p1->scholarship+=1000;
}
if(p1->a>80&&p1->b=='Y')//??????80????????//
{
p1->scholarship+=850;
}
p1=p1->next;
}
p1=head;
for(i=0;i<N;i++)
{
sum+=p1->scholarship;
p1=p1->next;
}
p1=head;
for(j=0;j<N-1;j++)
{
p2=p1->next;
for(i=0;i<N-1-j;i++)
{
if(p1->scholarship<p2->scholarship)
{
strcpy(a,p1->name);
strcpy(p1->name,p2->name);
strcpy(p2->name,a);
money=p1->scholarship;
p1->scholarship=p2->scholarship;
p2->scholarship=money;
}
p2=p2->next;
}
p1=p1->next;
}
p1=head;
printf("%s\n%d\n%ld",p1->name,p1->scholarship,sum);
return 0;
}
|
39
|
19443
|
struct student
{
char name[20];
int grade_1;
int grade_2;
char a;
char b;
int paper;
int sum; /*the money one get */
int flag; /*1 means the most abudant one*/
struct student *next;
};
int n,k;
int j;
struct student *creat(void)
{
struct student *head;
struct student *p1,*p2;
int i;
j=0;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->grade_1,&p1->grade_2,&p1->a,&p1->b,&p1->paper);
p1->sum = 0;
p1->flag = 0;
if(p1->grade_1>80&&p1->paper>0)
p1->sum+=8000;
if(p1->grade_1>85&&p1->grade_2>80)
p1->sum+=4000;
if(p1->grade_1>90)
p1->sum+=2000;
if(p1->grade_1>85&&p1->b=='Y')
p1->sum+=1000;
if(p1->grade_2>80&&p1->a=='Y')
p1->sum+=850;
// printf("%s %d %d %c %c %d %d",p1->name,p1->grade_1,p1->grade_2,p1->a,p1->b,p1->paper,p1->sum);
head=NULL;
for(i=0;;i++)
{
//printf("i = %d\n",i);
j=j+1;
if(j==1)
{
head=p1;
}
else
{
p2->next=p1;
}
p2=p1;
if(i>=n-1)
{
break;
}
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->grade_1,&p1->grade_2,&p1->a,&p1->b,&p1->paper);
p1->sum = 0;
p1->flag = 0;
if(p1->grade_1>80&&p1->paper>0)
p1->sum+=8000;
if(p1->grade_1>85&&p1->grade_2>80)
p1->sum+=4000;
if(p1->grade_1>90)
p1->sum+=2000;
if(p1->grade_1>85&&p1->b=='Y')
p1->sum+=1000;
if(p1->grade_2>80&&p1->a=='Y')
p1->sum+=850;
// printf("%s %d %d %c %c %d %d",p1->name,p1->grade_1,p1->grade_2,p1->a,p1->b,p1->paper,p1->sum);
}
p2->next=NULL;
return(head);
}
void output(struct student *p)
{
int total; /* total is all they get*/
int i,max; /* max is the most one -> flag ==1*/
struct student *tmp;
tmp = p;
max = 0;
total = 0;
tmp = p;
while(tmp!=NULL)
{
total+=tmp->sum;
// printf("again\n");
if(tmp->flag == 1)
{
tmp = tmp->next;
continue;
}
if(max<tmp->sum)
{
max = tmp->sum;
}
tmp = tmp->next;
}
// printf("%d\n",max);
tmp = p;
while(tmp!=NULL)
{
if(tmp->flag == 1)
{
tmp = tmp->next;
continue;
}
if(max!=tmp->sum)
{
tmp=tmp->next;
}
else
{
tmp->flag = 1;
break;
}
}
if (tmp->flag==1)
printf("%s\n",tmp->name);
printf("%d\n%d",max,total);
}
int main()
{
scanf("%d",&n);
struct student *p = creat();
output(p);
}
|
39
|
19444
|
int main()
{
int n,maxmoney,i;
char maxname[20];
struct
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int paper;
}student[101];
int money[101];
scanf("%d", &n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&student[i].name, &student[i].qimo,&student[i].banji,
&student[i].ganbu,&student[i].xibu,&student[i].paper);
}
int total=0;
for(i=1;i<=n;i++)
{
money[i]=0;
//printf("%d %d\n",student[i].qimo,student[i].paper);
if((student[i].qimo>80) && (student[i].paper>=1))
{
money[i] += 8000;
//printf("%d\n",money[i]);
}
if((student[i].qimo>85) && (student[i].banji>80))
{
money[i] += 4000;
//printf("%d\n",money[i]);
}
if(student[i].qimo>90)
money[i] += 2000;
//printf("%d\n",money[i]);
if((student[i].qimo>85) && (student[i].xibu=='Y'))
money[i] += 1000;
//printf("%d\n",money[i]);
if((student[i].banji>80) && (student[i].ganbu=='Y'))
money[i] += 850;
//printf("%d\n",money[i]);*/
total = total + money[i];
}
maxmoney = money[1];
strcpy(maxname , student[1].name);
for(i=2;i<=n;i++)
{
if(money[i] > maxmoney)
{
maxmoney=money[i];
strcpy(maxname,student[i].name);
}
}
printf("%s\n%d\n%d\n",maxname,maxmoney,total);
return 0;
}
|
39
|
19445
|
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
|
19446
|
struct Node;
typedef struct Node *pNode;
struct Node
{
int av,py,thesis,sum;
char name[20],west,gb;
pNode next;
};
pNode create()
{
pNode p;
p=(pNode)malloc(sizeof(struct Node));
p->next=NULL;
return p;
}
int main()
{
int i,n,max,sum=0;
pNode q=NULL,p=NULL,head=NULL,maxn=NULL;
scanf("%d",&n);
head=create();
q=head;
for (i=1;i<=n;i++)
{p=(pNode)malloc(sizeof(struct Node));
if (p!=NULL)
{
scanf("%s %d %d %c %c %d",&(p->name),&(p->av),&(p->py),&(p->gb),&(p->west),&(p->thesis));
p->sum=0;
if (p->av>80&&p->thesis>0)
p->sum+=8000;
if (p->av>85&&p->py>80)
p->sum+=4000;
if (p->av>90)
p->sum+=2000;
if (p->av>85&&p->west=='Y')
p->sum+=1000;
if (p->py>80&&p->gb=='Y')
p->sum+=850;
p->next=NULL;
q->next=p;
sum+=p->sum;
q=p;
}
}
maxn=head->next;
p=head->next;
while(1)
{
if (p->sum>maxn->sum)
maxn=p;
if (p->next==NULL)
break;
p=p->next;
}
printf("%s\n%d\n%d", maxn->name,maxn->sum,sum);
return 0;
}
|
39
|
19447
|
struct student
{
char name[50];
int score;
int pin;
char stu;
char west;
int num;
};
void main()
{
struct student a[100];
long int n,i,j,k,sum[100]={0},total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].score,&a[i].pin,&a[i].stu,&a[i].west,&a[i].num);
if(a[i].score>80&&a[i].num>=1) sum[i]=sum[i]+8000;
if(a[i].score>85&&a[i].pin>80) sum[i]=sum[i]+4000;
if(a[i].score>90) sum[i]=sum[i]+2000;
if(a[i].score>85&&a[i].west=='Y') sum[i]=sum[i]+1000;
if(a[i].pin>80&&a[i].stu=='Y') sum[i]=sum[i]+850;
total=total+sum[i];
}
k=sum[0];
for(i=1;i<n;i++)
{
if(k<sum[i])
{
k=sum[i];
j=i;
}
}
printf("%s\n%ld\n%ld\n",a[j].name,sum[j],total);
}
|
39
|
19448
|
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
|
19449
|
int main()
{
char name[105][20];
int qimo[105];
int banji[105];
int lunwen[105];
char xibu[105];
char ganbu[105];
int money[105]={0};
int i,j,k,l,m,n,max=0;
scanf("%d",&n);
getchar();
for (i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&name[i],&qimo[i],&banji[i],&ganbu[i],&xibu[i],&lunwen[i]);
}
for (i=1;i<=n;i++)
{
if (qimo[i]>80 && lunwen[i]>=1)
{
money[i]=money[i]+8000;
}
if (qimo[i]>85 && banji[i]>80)
{
money[i]=money[i]+4000;
}
if (qimo[i]>90)
{
money[i]=money[i]+2000;
}
if (qimo[i]>85 && xibu[i]=='Y')
{
money[i]=money[i]+1000;
}
if (banji[i]>80 && ganbu[i]=='Y')
{
money[i]=money[i]+850;
}
}
for (i=1;i<=n;i++)
{
if (money[i]>max) max=money[i];
}
for (i=1;i<=n;i++)
{
if (money[i]==max)
{
printf("%s\n",name[i]);
break;
}
}
printf("%d\n",max);
m=0;
for (i=1;i<=n;i++)
{
m=m+money[i];
}
printf("%d\n",m);
return 0;
}
|
39
|
19450
|
int main(){
char s[20];
char p[20];
char a,b;
int n,i,num=0,sum=0;
int c,d,e;
int m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",s,&c,&d,&a,&b,&e);
if(c>80&&e>=1)
num=num+8000;
if(c>85&&d>80)
num=num+4000;
if(c>90)
num=num+2000;
if(b=='Y'&&c>85)
num=num+1000;
if(a=='Y'&&d>80)
num=num+850;
if(num>m)
{
m=num;
strcpy(p,s);
}
sum=sum+num;
num=0;
}
printf("%s\n%d\n%d\n",p,m,sum);
}
|
39
|
19451
|
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
|
19452
|
void main()
{
struct student{
char name[21];
int fin;
int cls;
char off;
char wst;
int pap;
}s[100];
int n,i,m[100]={0},sum=0,max,maxi;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",s[i].name,&s[i].fin,&s[i].cls,&s[i].off,&s[i].wst,&s[i].pap);
for(i=0;i<n;i++){
if(s[i].fin>80&&s[i].pap>=1)
m[i]+=8000;
if(s[i].fin>85&&s[i].cls>80)
m[i]+=4000;
if(s[i].fin>90)
m[i]+=2000;
if(s[i].fin>85&&s[i].wst=='Y')
m[i]+=1000;
if(s[i].cls>80&&s[i].off=='Y')
m[i]+=850;
sum+=m[i];
if(i==0){
max=m[i];
maxi=i;
}
else if(m[i]>max){
max=m[i];
maxi=i;
}
}
printf("%s\n%d\n%d\n",s[maxi].name,m[maxi],sum);
}
|
39
|
19453
|
int main()
{
struct student
{
char name[21];
int score1;
int score2;
char leader;
char west;
int essay;
struct student *next,*last;
};
struct student *p;
int n,i,sum=0,scholar,max=0;
char goodstudent[21];
scanf("%d",&n);
for(i=0;i<n;i++)
{
p=(struct student*)malloc(sizeof(struct student));
scanf("%s%d%d %c %c%d",p->name,&p->score1,&p->score2,&p->leader,&p->west,&p->essay);
scholar=0;
if(p->score1>80&&p->essay>=1) scholar+=8000;
if(p->score1>85&&p->score2>80) scholar+=4000;
if(p->score1>90) scholar+=2000;
if(p->score1>85&&p->west=='Y') scholar+=1000;
if(p->score2>80&&p->leader=='Y') scholar+=850;
sum+=scholar;
if(scholar>max)
{
max=scholar;
strcpy(goodstudent,"");
strcpy(goodstudent,p->name);
}
free(p);
}
printf("%s\n%d\n%d",goodstudent,max,sum);
return 0;
}
|
39
|
19454
|
void main ()
{
struct stu
{
char name[20];
int final;
int argue;
char leader;
char west;
int art;
}stu[100];
struct stu term;
int n,i,sum[100]={0},t=0,m,j;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].final,&stu[i].argue,&stu[i].leader,&stu[i].west,&stu[i].art);
for(i=0;i<=n-1;i++)
{
if(stu[i].final>80&&stu[i].art>=1)
sum[i]=sum[i]+8000;
if(stu[i].final>85&&stu[i].argue>80)
sum[i]=sum[i]+4000;
if(stu[i].final>90)
sum[i]=sum[i]+2000;
if(stu[i].final>85&&stu[i].west=='Y')
sum[i]=sum[i]+1000;
if(stu[i].argue>80&&stu[i].leader=='Y')
sum[i]=sum[i]+850;
}
for (i=0;i<n-1;i++)
for (j=0;j<n-1-i;j++)
if(sum[j]<sum[j+1])
{
term=stu[j];
stu[j]=stu[j+1];
stu[j+1]=term;
m=sum[j];
sum[j]=sum[j+1];
sum[j+1]=m;
}
for(i=0;i<=n-1;i++)
t=t+sum[i];
printf ("%s\n",stu[0].name);
printf("%d\n",sum[0]);
printf("%d\n",t);
}
|
39
|
19455
|
int main(){
struct student{
char name[20];
int grade1;
int grade2;
char jerk;
char west;
int paper;
};
struct student nerd[100];
int n,i,j,blame[100]={0},max=0,sin=0;
scanf("%d",&n);
for(i=0;i<=(n-1);i++){
scanf("%s %d %d %c %c %d",nerd[i].name,&nerd[i].grade1,&nerd[i].grade2,&nerd[i].jerk,&nerd[i].west,&nerd[i].paper);
}
for(i=0;i<n;i++){
if(nerd[i].grade1>80&&nerd[i].paper>=1){
blame[i]+=8000;
}
if(nerd[i].grade1>85&&nerd[i].grade2>80){
blame[i]+=4000;
}
if(nerd[i].grade1>90){
blame[i]+=2000;
}
if(nerd[i].grade1>85&&nerd[i].west=='Y'){
blame[i]+=1000;
}
if(nerd[i].grade2>80&&nerd[i].jerk=='Y'){
blame[i]+=850;
}
}
for(i=0;i<n;i++){
if(blame[i]>max){
j=i;
max=blame[i];
}
sin+=blame[i];
}
printf("%s\n",nerd[j].name);
printf("%d\n%d",max,sin);
return 0;
}
|
39
|
19456
|
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
|
19457
|
void main()
{
int a[100]={0},i,j,n,sum=0,p;
struct student
{
char name[20];
int qimo;
int banpin;
char ganbu;
char pro;
int pap;
}stu[101];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].qimo,&stu[i].banpin,&stu[i].ganbu,&stu[i].pro,&stu[i].pap);
for(i=0;i<n;i++)
{
if(stu[i].qimo>80&&stu[i].pap>=1)
a[i]=a[i]+8000;
if(stu[i].qimo>85&&stu[i].banpin>80)
a[i]=a[i]+4000;
if(stu[i].qimo>90)
a[i]=a[i]+2000;
if(stu[i].qimo>85&&stu[i].pro=='Y')
a[i]=a[i]+1000;
if(stu[i].banpin>80&&stu[i].ganbu=='Y')
a[i]=a[i]+850;
}
for(i=0;i<n;i++)
sum=sum+a[i];
for(i=0;i<n;i++)
for(j=0;j<n-1;j++)
if(a[j]<a[j+1])
{
p=a[j+1];
a[j+1]=a[j];
a[j]=p;
stu[100]=stu[j+1];
stu[j+1]=stu[j];
stu[j]=stu[100];
}
printf("%s\n%d\n%d\n",stu[0].name,a[0],sum);
}
|
39
|
19458
|
void main()
{
/*1) ????????8000??????????80??>80???????????1??1?????????????
2) ????????4000??????????85??>85????????????80??>80?????????
3) ????????2000??????????90??>90?????????
4) ????????1000??????????85??>85?????????????
5) ????????850??????????80??>80???????????
???????????????????????????????????????????????????*/
char name[1000][100];
int fen[1000];
int ban[1000];
char gan[1000];
char xi[1000];
int lun[1000];
int jiang[1000];
int n,i,max,xue,sum;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d %d %c %c %d",name[i],&fen[i],&ban[i],&gan[i],&xi[i],&lun[i]);
jiang[i]=0;
if(fen[i]>80&&lun[i]>=1) jiang[i]=8000;
if(fen[i]>85&&ban[i]>80) jiang[i]=jiang[i]+4000;
if(fen[i]>90) jiang[i]=jiang[i]+2000;
if(fen[i]>85&&xi[i]=='Y') jiang[i]=jiang[i]+1000;
if(ban[i]>80&&gan[i]=='Y') jiang[i]=jiang[i]+850;
}
max=jiang[0];
xue=0;
for(i=0;i<n;i++)
{
if(jiang[i]>max)
{
max=jiang[i];
xue=i;
}
}
sum=0;
for(i=0;i<n;i++)
{
sum=sum+jiang[i];
}
printf("%s\n",name[xue]);
printf("%d\n",jiang[xue]);
printf("%d\n",sum);
}
|
39
|
19459
|
int main(int argc, char* argv[])
{
int n,sum[100],i,j;
scanf("%d",&n);
struct{
char name[20];
int average;
int clas;
char gan;
char xi;
int lun;
}a[100];
for(i=0;i<n;i++){
sum[i]=0;
scanf("%s %d %d %c %c %d",a[i].name,&a[i].average,&a[i].clas,&a[i].gan,&a[i].xi,&a[i].lun);
}
for(i=0;i<n;i++)
{
if(a[i].average > 80 && a[i].lun >= 1)
sum[i]+=8000;
if(a[i].average > 85 && a[i].clas > 80 )
sum[i]+=4000;
if(a[i].average > 90)
sum[i]+=2000;
if(a[i].average > 85 && a[i].xi=='Y' )
sum[i]+=1000;
if(a[i].clas > 80 && a[i].gan=='Y')
sum[i]+=850;
}
int s=sum[0],d=sum[0];
for(i=1;i<n;i++)
{ d+=sum[i];
if(sum[i]>s)
{s=sum[i];
j=i;}
}
printf("%s\n",a[j].name);
printf("%d\n",sum[j]);
printf("%d\n",d);
return 0;
}
|
39
|
19460
|
struct student
{
char name[20];
int score;
int pingyi;
char ganbu;
char west;
int paper;
};
int main()
{
int n,i,t,x,y=0,a[100]={0};
struct student stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].score,&stu[i].pingyi,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++)
{if(stu[i].score>80&&stu[i].paper>0) {a[i]=a[i]+8000;}
if(stu[i].score>85&&stu[i].pingyi>80) {a[i]=a[i]+4000;}
if(stu[i].score>90){a[i]=a[i]+2000;}
if(stu[i].score>85&&stu[i].west=='Y'){a[i]=a[i]+1000;}
if(stu[i].pingyi>80&&stu[i].ganbu=='Y'){a[i]=a[i]+850;}
}
t=a[0];x=0;
for(i=0;i<n;i++)
{if(a[i]>t) {t=a[i];x=i;}
y=y+a[i];}
printf("%s\n%d\n%d\n",stu[x].name,a[x],y);
}
|
39
|
19461
|
struct stu
{
char name[25];
int score1;
int score2;
char a;
char b;
int num;
int sum;
};
void main()
{
int i,n,t=0,pos,max;
struct stu *p1;
scanf("%d",&n);
p1=(struct stu*)calloc(n,sizeof(struct stu));
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",p1[i].name,&(p1[i].score1),&(p1[i].score2),&(p1[i].a),&(p1[i].b),&(p1[i].num));
if(p1[i].score1>80&&p1[i].num>=1)
{
p1[i].sum+=8000;
t+=8000;
}
if(p1[i].score1>85&&p1[i].score2>80)
{
p1[i].sum+=4000;
t+=4000;
}
if(p1[i].score1>90)
{
p1[i].sum+=2000;
t+=2000;
}
if(p1[i].score1>85&&p1[i].b=='Y')
{
p1[i].sum+=1000;
t+=1000;
}
if(p1[i].score2>80&&p1[i].a=='Y')
{
p1[i].sum+=850;
t+=850;
}
}
max=p1[0].sum;
for(i=1;i<n;i++)
if(p1[i].sum>max)
{
pos=i;
max=p1[i].sum;
}
printf("%s\n%d\n%d",p1[pos].name,p1[pos].sum,t);
}
|
39
|
19462
|
struct student
{
char name[20];
int qipin;
int banpin;
char ganbu;
char xixue;
int lunwen;
int jj;
};
void main()
{
int max(struct student s[100],int n);
struct student stu[100];
int i,m=0,sum=0,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].name);
scanf("%d %d %c %c %d",&stu[i].qipin,&stu[i].banpin,&stu[i].ganbu,&stu[i].xixue,&stu[i].lunwen);
stu[i].jj=0;
if(stu[i].qipin>80&&stu[i].lunwen>0)
stu[i].jj=stu[i].jj+8000;
if(stu[i].qipin>85&&stu[i].banpin>80)
stu[i].jj=stu[i].jj+4000;
if(stu[i].qipin>90)
stu[i].jj=stu[i].jj+2000;
if(stu[i].qipin>85&&stu[i].xixue=='Y')
stu[i].jj=stu[i].jj+1000;
if(stu[i].banpin>80&&stu[i].ganbu=='Y')
stu[i].jj=stu[i].jj+850;
}
for(i=0;i<n;i++)
sum=sum+stu[i].jj;
m=max(stu,n);
puts(stu[0].name);
printf("%d\n%d\n",m,sum);
}
int max(struct student s[100],int n)
{
int i,j;
struct student t;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(s[i].jj<s[j].jj)
{
t=s[j];
s[j]=s[i];
s[i]=t;
}
return (s[0].jj);
}
|
39
|
19463
|
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
|
19464
|
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
|
19465
|
void main()
{
struct student
{
char name[20];
int mark1;
int mark2;
char ganbu;
char xibu;
int lunwen;
int total;
}student[100],temp,Total;
int n,i,j;
scanf("%d",&n);
Total.total=0;
for(i=0;i<n;i++)
{
student[i].total=0;
scanf("%s %d %d %c %c %d",student[i].name,&student[i].mark1,&student[i].mark2,&student[i].ganbu,&student[i].xibu,&student[i].lunwen);
if(student[i].mark1>80&&student[i].lunwen>0)
student[i].total+=8000;
if(student[i].mark1>85&&student[i].mark2>80)
student[i].total+=4000;
if(student[i].mark1>90)
student[i].total+=2000;
if(student[i].mark1>85&&student[i].xibu=='Y')
student[i].total+=1000;
if(student[i].mark2>80&&student[i].ganbu=='Y')
student[i].total+=850;
Total.total+=student[i].total;
}
for(j=0;j<n-1;j++)
for(i=0;i<n-1-j;i++)
if(student[i].total>=student[i+1].total)
{
temp=student[i];
student[i]=student[i+1];
student[i+1]=temp;
}
printf("%s\n%d\n%d\n",student[n-1].name,student[n-1].total,Total.total);
}
|
39
|
19466
|
struct stu
{
char name[20],ganbu,xibu;
int qimo,banji,lunwen,sum;
};
int main()
{
struct stu a[100],t;
int n,i,sum=0,j,k;
char c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i].name);
c=getchar();
scanf("%d %d %c %c %d",&a[i].qimo,&a[i].banji,&a[i].ganbu,&a[i].xibu,&a[i].lunwen);
a[i].sum=0;
if(a[i].qimo>80&&a[i].lunwen>=1)
a[i].sum+=8000;
if(a[i].qimo>85&&a[i].banji>80)
a[i].sum+=4000;
if(a[i].qimo>90)
a[i].sum+=2000;
if(a[i].qimo>85&&a[i].xibu=='Y')
a[i].sum+=1000;
if(a[i].banji>80&&a[i].ganbu=='Y')
a[i].sum+=850;
sum+=a[i].sum;
}
for(j=1;j<=n;j++)
{ for(k=0;k<n-j;k++)
{
if(a[k].sum<a[k+1].sum)
{
t=a[k];
a[k]=a[k+1];
a[k+1]=t;
}
}
}
printf("%s\n%d\n%d\n",a[0].name,a[0].sum,sum);
return 0;
}
|
39
|
19467
|
int main()
{
struct person
{char name[20];
int pro1;
int pro2;
char c1;
char c2;
int papers;
int money;
}//stu[1]={"aA",87,82,'Y','N',0,0}//"bB",88,78,'N','Y',1,0,"cC",92,88,'N','N',0,0,"dD",83,87,'Y','N',1,0,"bb",92,80,'Y','Y',1,0}
;
long int i,N,max=0;
long int all=0;
scanf("%d\n",&N);
struct person *stu=(struct person *)malloc(N*sizeof(struct person));
for(i=0;i<N;i++){
scanf("%s%d%d %c %c %d\n",&stu[i].name,&stu[i].pro1,&stu[i].pro2,&stu[i].c1,&stu[i].c2,&stu[i].papers);
stu[i].money=0;
if(stu[i].papers>=1&&stu[i].pro1>80)stu[i].money=stu[i].money+8000;
if(stu[i].pro1>85&&stu[i].pro2>80)stu[i].money=stu[i].money+4000;
if(stu[i].pro1>90)stu[i].money=stu[i].money+2000;
if(stu[i].pro1>85&&stu[i].c2=='Y')stu[i].money=stu[i].money+1000;
if(stu[i].pro2>80&&stu[i].c1=='Y')stu[i].money=stu[i].money+850;
if(max<stu[i].money) max=stu[i].money;
all=all+stu[i].money;}
for(i=0;i<N;i++)
{if(stu[i].money==max)
{printf("%s\n%d\n%d",stu[i].name,stu[i].money,all);
break;}
}
return(0);
}
|
39
|
19468
|
struct student{
char name[25];
int q,b,l,money;
char w,x;
};
int main()
{
struct student a[100];
int n,i;
int sum=0,max=0,max_i=0,m[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].q,&a[i].b,&a[i].w,&a[i].x,&a[i].l);
if((a[i].q>80)&&(a[i].l>=1))
{m[i]+=8000;}
if((a[i].b>80)&&(a[i].q>85))
{m[i]+=4000;}
if(a[i].q>90)
{m[i]+=2000;}
if((a[i].q>85)&&(a[i].x=='Y'))
{m[i]+=1000;}
if((a[i].b>80)&&(a[i].w=='Y'))
{m[i]+=850;}
a[i].money=m[i];
}
m[0]=max=a[0].money;
max_i=0;
for(i=0;i<n;i++)
{
sum+=m[i];
if(a[i].money>max)
{
max=a[i].money;
max_i=i;
}
}
printf("%s\n",a[max_i].name);
printf("%d\n",m[max_i]);
printf("%d\n",sum);
return 0;
}
|
39
|
19469
|
int main()
{
int n;
int i;
int total = 0;
int max_n(int amount[], int n);
int max_num;
struct data
{
char name[21];
int grade;
int assessment;
char leader;
char west;
int paper;
};
scanf("%d", &n);
struct data *input = (struct data*) malloc(sizeof(struct data) * n);
int *amount = (int*) malloc(sizeof(int) * n);
for(i = 0; i <= n - 1; i++)
{
scanf("%s %d %d %c %c %d", input[i].name, &input[i].grade, &input[i].assessment, &input[i].leader, &input[i].west, &input[i].paper);
amount[i] = 8000 * (input[i].grade > 80 && input[i].paper > 0) + 4000 * (input[i].grade > 85 && input[i].assessment > 80) + 2000 * (input[i].grade > 90) + 1000 * (input[i].grade > 85 && input[i].west == 'Y') + 850 * (input[i].assessment > 80 && input[i].leader == 'Y');
total = total + amount[i];
}
max_num = max_n(amount, n);
printf("%s\n%d\n%d", input[max_num].name, amount[max_num], total);
free(input);
free(amount);
return 0;
}
int max_n(int amount[], int n)
{
int max_num;
int max = 0;
int i;
for(i = 0; i <= n - 1; i++)
{
if(amount[i] > max)
{
max = amount[i];
max_num = i;
}
}
return max_num;
}
|
39
|
19470
|
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
|
19471
|
int main()
{
int n;
scanf("%d\n",&n);
char s[20],t[20];
int a,b,e,m,sum=0,max=0;
char c,d;
for(int i=0;i<n;i++)
{
m=0;
scanf("%s %d %d %c %c %d",s,&a,&b,&c,&d,&e);
if(a>80&&e>=1)
m=m+8000;
if(a>85&&b>80)
m=m+4000;
if(a>90)
m=m+2000;
if(a>85&&d=='Y')
m=m+1000;
if(b>80&&c=='Y')
m=m+850;
if(m>max)
{
max=m;
int j;
for(j=0;s[j]!='\0';j++)
{
t[j]=s[j];
}
t[j]='\0';
}
sum=sum+m;
}printf("%s\n%d\n",t,max);
printf("%d",sum);
return 0;
}
|
39
|
19472
|
struct student
{
char name[30];
int money;
}stu[999];
void main()
{
int n,i,sum=0,max=0;
int grade_1,grade_2,paper;
char a,b;
char *winner;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&grade_1,&grade_2,&a,&b,&paper);
stu[i].money=0;
if(grade_1>80&&paper>0)
stu[i].money+=8000;
if(grade_1>85&&grade_2>80)
stu[i].money+=4000;
if(grade_1>90)
stu[i].money+=2000;
if(grade_1>85&&b=='Y')
stu[i].money+=1000;
if(grade_2>80&&a=='Y')
stu[i].money+=850;
}
for(i=0;i<n;i++)
{
sum+=stu[i].money;
if(max<stu[i].money)
{
max=stu[i].money;
winner=stu[i].name;
}
}
printf("%s\n%d\n%d",winner,max,sum);
}
|
39
|
19473
|
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
|
19474
|
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
|
19475
|
struct student{
char name[20];
int scholar;
}stu[100];
int main(){
int n,i,j,total=0,final,class1,paper,maxid,maxscholar=0;
char t1[2],t2[2];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d%s%s%d",stu[i].name,&final,&class1,t1,t2,&paper);
if(final>80 && paper>=1)stu[i].scholar+=8000;
if(final>85 && class1>80)stu[i].scholar+=4000;
if(final>90)stu[i].scholar+=2000;
if(final>85 && t2[0]=='Y')stu[i].scholar+=1000;
if(class1>80 && t1[0]=='Y')stu[i].scholar+=850;
total+=stu[i].scholar;
if(maxscholar<stu[i].scholar){maxscholar=stu[i].scholar;maxid=i;}
}
printf("%s\n%d\n%d\n",stu[maxid].name,maxscholar,total);
}
|
39
|
19476
|
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
|
19477
|
int main()
{
int n, a, b, c, i, sum=0, max=0, m[100]={0}, result[100];
char p, q, name[20], s[20];
scanf("%d\n", &n);
for(i=0;i<n;i++)
{
result[i] = scanf("%s %d %d %c %c %d\n", s, &a, &b, &p, &q, &c);
if(a>80 && c>0) m[i]+=8000;
if(a>85 && b>80) m[i]+=4000;
if(a>90) m[i]+=2000;
if(a>85 && q=='Y') m[i]+=1000;
if(b>80 && p=='Y') m[i]+=850;
if(m[i]>max)
{
max=m[i];
strcpy(name,s);
}
sum+=m[i];
}
printf("%s\n%d\n%d\n", name, max, sum);
return 0;
}
|
39
|
19478
|
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
|
19479
|
void main()
{
struct s
{
char a[20];
int b;
int c;
char d;
char e;
int f;
int g;
struct s *next;
};
int m,n,i,j,k,t,max,sum;
struct s *p1,*p2,*head;
scanf("%d",&n);
head=0;
p1=p2=(struct s *)malloc(sizeof(struct s));
head=p1;
scanf("%s %d %d %c %c %d",p1->a,&p1->b,&p1->c,&p1->d,&p1->e,&p1->f);
for(i=0;i<n-1;i++)
{
p1=(struct s *)malloc(sizeof(struct s));
p2->next=p1;
p2=p1;
scanf("%s %d %d %c %c %d",p1->a,&p1->b,&p1->c,&p1->d,&p1->e,&p1->f);
}
p2->next=0;
p1=p2=head;
for(i=0;i<n;i++)
{
p1->g=0;
if(p1->b>80&&p1->f>0)
p1->g=p1->g+8000;
if(p1->b>85&&p1->c>80)
p1->g=p1->g+4000;
if(p1->b>90)
p1->g=p1->g+2000;
if(p1->b>85&&p1->e=='Y')
p1->g=p1->g+1000;
if(p1->c>80&&p1->d=='Y')
p1->g=p1->g+850;
p2=p1->next;
p1=p2;
}
p1=p2=head;
max=p1->g;
for(i=0;i<n-1;i++)
{
p2=p1->next;
p1=p2;
if(p1->g>max)
{
max=p1->g;
m=i;
}
}
p1=head;
for(i=0;i<m+1;i++)
p1=p1->next;
printf("%s\n%d\n",p1->a,p1->g);
p1=head;
sum=0;
for(i=0;i<n;i++)
{
sum=sum+p1->g;
p1=p1->next;
}
printf("%d",sum);
}
|
39
|
19480
|
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
|
19481
|
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
|
19482
|
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
|
19483
|
struct student
{
char name[20];
int score1;
int score2;
char leader[2];
char west[2];
int paper;
int money;
struct student *next;
};
struct student *creat(int n)
{
struct student *head;
struct student *p1,*p2;
int i;
p1=p2=(struct student *)malloc(sizeof(struct student));
head=p1;
for(i=0;i<n;i++)
{
p2=p1;
scanf("%s%d%d%s%s%d",p1->name,&p1->score1,&p1->score2,&p1->leader,&p1->west,&p1->paper);
{
p1->money=0;
if(p1->score1>80&&p1->paper!=0)
p1->money=p1->money+8000;
if(p1->score1>85&&p1->score2>80)
p1->money=p1->money+4000;
if(p1->score1>90)
p1->money=p1->money+2000;
if(p1->score1>85&&(strcmp(p1->west,"Y")==0))
p1->money=p1->money+1000;
if(p1->score2>80&&(strcmp(p1->leader,"Y")==0))
p1->money=p1->money+850;
}
p1=(struct student *)malloc(sizeof(struct student));
p2->next=p1;
}
p2->next=NULL;
return(head);
}
void print(struct student *head)
{
struct student *p1;
int max,all=0;
p1=head;
max=p1->money;
do
{
if(p1->money>max)
max=p1->money;
all=all+p1->money;
p1=p1->next;
}
while(p1->next!=NULL);
if(p1->money>max)
max=p1->money;
all=all+p1->money;
p1=head;
for(;p1->next!=NULL;)
{
if(p1->money==max)
{
printf("%s\n%d\n",p1->name,p1->money);
break;
}
p1=p1->next;
}
printf("%d",all);
}
void print1(struct student *head)
{
struct student *p1;
p1=head;
do
{
printf("%s %d %d %s %s %d %d\n",p1->name,p1->score1,p1->score2,p1->leader,p1->west,p1->paper,p1->money);
p1=p1->next;
}
while(p1!=NULL);
}
void main()
{
int n;
struct student *head;
scanf("%d",&n);
head=creat(n);
/*print1(head);*/
print(head);
}
|
39
|
19484
|
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
|
19485
|
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
|
19486
|
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
|
19487
|
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
|
19488
|
struct student
{
char name[20];
int grade;
int mark_class;
char monitor;
char west;
int paper;
int money;
};
int c_to_d(char c[]);
void main ()
{
int n,len;
struct student stu[100];
int i,j,k,l,m;
int total=0;
scanf("%d",&n);
getchar();
for(i=0;i<n;i++)
{
char help[35];
gets(help);
len=strlen(help);
for(j=0;;j++)
{
if(help[j]==' ') {stu[i].name[j]='\0';break;}
stu[i].name[j]=help[j];
}
j++;
for(k=0;;k++)
{
char help2[3];
if(help[j+k]==' ') {help2[k]='\0';stu[i].grade=c_to_d(help2);break;}
help2[k]=help[j+k];
}
k++;
for(l=0;;l++)
{
char help2[3];
if(help[j+k+l]==' ') {help2[l]='\0';stu[i].mark_class=c_to_d(help2);break;}
help2[l]=help[j+k+l];
}
l++;
stu[i].monitor=help[j+k+l];
stu[i].west=help[j+k+l+2];
for(m=0;;m++)
{
char help2[3];
if(len==(j+k+l+4+m)) {help2[m]='\0';stu[i].paper=c_to_d(help2);break;}
help2[m]=help[j+k+l+4+m];
}
}
for(i=0;i<n;i++)
{
stu[i].money=0;
if (stu[i].grade>80&&stu[i].paper>0) stu[i].money+=8000;
if (stu[i].grade>85&&stu[i].mark_class>80) stu[i].money+=4000;
if (stu[i].grade>90) stu[i].money+=2000;
if (stu[i].grade>85&&stu[i].west=='Y') stu[i].money+=1000;
if (stu[i].mark_class>80&&stu[i].monitor=='Y') stu[i].money+=850;
}
for(i=0;i<n;i++)
{
for(j=0;j<n-1;j++)
{
if(stu[j].money<stu[j+1].money)
{
struct student y;
y=stu[j];
stu[j]=stu[j+1];
stu[j+1]=y;
}
}
}
printf("%s\n%d\n",stu[0].name,stu[0].money);
for(i=0;i<n;i++)
{
total+=stu[i].money;
}
printf("%d",total);
}
int c_to_d(char c[])
{
int n=strlen(c);
int i;
int x=0;
for(i=0;i<n;i++)
{
x=x*10+c[i]-48;
}
return x;
}
|
39
|
19489
|
struct xinxi
{
char ming[22];
int qimo;
int pingyi;
char guan;
char xibu;
int lunwen;
int award;
struct xinxi *next;
};
void main()
{
struct xinxi *head,*pt,*p,*x;
int i,n,t;
int awardmax,awardsum;
scanf("%d",&n);
p=(struct xinxi *)malloc(sizeof(struct xinxi));
scanf("%s %d %d %c %c %d\n",p->ming,&p->qimo,&p->pingyi,&p->guan,&p->xibu,&p->lunwen);
pt=p;
head=NULL;
t=1;
while(t<n)
{
if(t==1)head=p;
if(t>1)pt->next=p;
pt=p;
p=(struct xinxi *)malloc(sizeof(struct xinxi));
t=t+1;
scanf("%s %d %d %c %c %d",p->ming,&p->qimo,&p->pingyi,&p->guan,&p->xibu,&p->lunwen);
}
pt->next=p;
p->next=NULL;
x=head;
while(x!=NULL)
{
x->award=0;
if(x->qimo>80&&x->lunwen!=0)x->award=x->award+8000;
if(x->qimo>85&&x->pingyi>80)x->award=x->award+4000;
if(x->qimo>90)x->award=x->award+2000;
if(x->qimo>85&&x->xibu=='Y')x->award=x->award+1000;
if(x->pingyi>80&&x->guan=='Y')x->award=x->award+850;
x=x->next;
}
awardsum=0;
awardmax=0;
x=head;
while(x!=NULL)
{
awardsum=x->award+awardsum;
if(x->award>awardmax)awardmax=x->award;
x=x->next;
}
for(x=head;x->award!=awardmax;x=x->next);
printf("%s\n",x->ming);
printf("%d\n",x->award);
printf("%d",awardsum);
}
|
39
|
19490
|
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
|
19491
|
int main()
{
int n,i,max,t;
scanf("%d",&n);
char a[100][20],d[100],e[100];
int b[100],c[100],f[100],sum[100]={0},total=0;
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d\n",a[i],&b[i],&c[i],&d[i],&e[i],&f[i]);
}
for(i=0;i<n;i++){
if(b[i]>80&&f[i]>0)
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]=='Y')
sum[i]+=1000;
if(c[i]>80&&d[i]=='Y')
sum[i]+=850;
}
for(i=0;i<n;i++)
total+=sum[i];
max=sum[0];
t=0;
for(i=0;i<n;i++){
if(max<sum[i]){
t=i;
max=sum[i];
}
}
printf("%s\n%d\n%d",a[t],max,total);
return 0;
}
|
39
|
19492
|
int main()
{
int n,i,total=0;
struct point
{
char s[20];
int end;
int class_marks;
char c1;
char c2;
int com_num;
int sum;
}
stu[100],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].s);
scanf("%d%d",&(stu[i].end),&(stu[i].class_marks));
getchar();
scanf("%c",&(stu[i].c1));
getchar();
scanf("%c",&(stu[i].c2));
getchar();
scanf("%d",&(stu[i].com_num));
}
for(i=0;i<n;i++)
{
stu[i].sum=0;
if(stu[i].end>80&&stu[i].com_num>=1)
stu[i].sum=8000+stu[i].sum;
if(stu[i].end>85&&stu[i].class_marks>80)
stu[i].sum=4000+stu[i].sum;
if(stu[i].end>90)
stu[i].sum=2000+stu[i].sum;
if(stu[i].end>85&&stu[i].c2=='Y')
stu[i].sum=1000+stu[i].sum;
if(stu[i].class_marks>80&&stu[i].c1=='Y')
stu[i].sum=850+stu[i].sum;
}
for(i=0;i<n;i++)
total=stu[i].sum+total;
max.sum=0;
for(i=0;i<n;i++)
{
if(max.sum<stu[i].sum)
max=stu[i];
}
printf("%s\n%d\n%d",max.s,max.sum,total);
return 0;
}
|
39
|
19493
|
int yuanshi(int a,int b)
{
if(a>80&&b>=1)
return(8000);
else return(0);
}
int wusi(int a,int b)
{
if(a>85&&b>80)
return(4000);
else return(0);
}
int chengji(int a)
{
if(a>90)
return(2000);
else return(0);
}
int xibu(int a,char b)
{
if(a>85&&b=='Y')
return(1000);
else return(0);
}
int gongxian(int a,char b)
{
if(a>80&&b=='Y')
return(850);
else return(0);
}
void main()
{
struct award
{
char name[20];
int qimocj;
int banpingcj;
char ynganbu;
char ynxibu;
int lunwen;
int jiangjin;
}aw[100],temp;
int N,i,j,k,sum;
scanf("%d",&N);
for(i=0;i<N;i++)
{
aw[i].jiangjin=0;
scanf("%s %d %d %c %c %d",&aw[i].name,&aw[i].qimocj,&aw[i].banpingcj,&aw[i].ynganbu,&aw[i].ynxibu,&aw[i].lunwen);
aw[i].jiangjin=yuanshi(aw[i].qimocj,aw[i].lunwen)
+wusi(aw[i].qimocj,aw[i].banpingcj)
+chengji(aw[i].qimocj)
+xibu(aw[i].qimocj,aw[i].ynxibu)
+gongxian(aw[i].banpingcj,aw[i].ynganbu);
}
for(k=0;k<N-1;k++)
{
for(j=0;j<N-1-k;j++)
{
if(aw[j].jiangjin<aw[j+1].jiangjin)
{
temp=aw[j];
aw[j]=aw[j+1];
aw[j+1]=temp;
}
}
}
sum=0;
for(i=0;i<N;i++)
{
sum=sum+aw[i].jiangjin;
}
printf("%s\n%d\n%d",aw[0].name,aw[0].jiangjin,sum);
}
|
39
|
19494
|
int main(int argc, char* argv[])
{
int n,i,j,z=0,p[100],b[100],l[100],sum[100];
char g[100],x[100];
char m[100][20];
scanf("%d\n",&n);
for (i=0;i<n;i++)
{
scanf("%s",m[i]);
scanf("%d%d",&p[i],&b[i]);
scanf(" %c %c ",&g[i],&x[i]);
scanf("%d",&l[i]);
}
for (i=0;i<n;i++)
{
sum[i]=0;
if (p[i]>90) sum[i]=sum[i]+2000;
if (p[i]>85)
{
if (b[i]>80) sum[i]=sum[i]+4000;
if (x[i]=='Y') sum[i]=sum[i]+1000;
}
if ((p[i]>80)&&(l[i]>0)) sum[i]=sum[i]+8000;
if ((b[i]>80)&&(g[i]=='Y')) sum[i]=sum[i]+850;
}
for (i=0;i<n;i++) z=sum[i]+z;
int max=sum[0];
j=0;
for (i=0;i<n;i++)
{
if (sum[i]>max)
{
max=sum[i];
j=i;
}
}
printf("%s\n%d\n%d\n",m[j],max,z);
return 0;
}
|
39
|
19495
|
void main()
{
struct student
{
char s[20];
int m1;
int m2;
char c1;
char c2;
int n;
int t;
}stu[100],tr;
int i,j,m,t1=0;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%s%d%d %c %c%d",stu[i].s,&stu[i].m1,&stu[i].m2,&stu[i].c1,&stu[i].c2,&stu[i].n);stu[i].t=0;
if(stu[i].m1>80&&stu[i].n>0)
stu[i].t+=8000;
if(stu[i].m1>85&&stu[i].m2>80)
stu[i].t+=4000;
if(stu[i].m1>90)
stu[i].t+=2000;
if(stu[i].m2>80&&stu[i].c1=='Y')
stu[i].t+=850;
if(stu[i].m1>85&&stu[i].c2=='Y')
stu[i].t+=1000;
}
for(i=0;i<m-1;i++)
{
for(j=i+1;j<m;j++)
if(stu[i].t<stu[j].t)
{
tr=stu[i];
stu[i]=stu[j];
stu[j]=tr;
}
}
for(i=0;i<m;i++)
{
t1+=stu[i].t;
}
printf("%s\n%d\n%d\n",stu[0].s,stu[0].t,t1);
}
|
39
|
19496
|
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
|
19497
|
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
|
19498
|
void main()
{
struct student
{
char name[100],g,w;
int s1,s2,p;
long sum;
} stu[100],max;
int n,i,k;
long ssum=0;
scanf("%d\n",&n);
max.sum=0;
for (i=0;i<n;i++)
{
stu[i].sum=0;
/*1) ????????8000??????????80??>80???????????1??1?????????????
2) ????????4000??????????85??>85????????????80??>80?????????
3) ????????2000??????????90??>90?????????
4) ????????1000??????????85??>85?????????????
5) ????????850??????????80??>80???????????
???????????????????????????????????????????
*/
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].g,&stu[i].w,&stu[i].p);
if(stu[i].s1>80&&stu[i].p>0) stu[i].sum+=8000;
if(stu[i].s1>85&&stu[i].s2>80) stu[i].sum+=4000;
if(stu[i].s1>90) stu[i].sum+=2000;
if(stu[i].s1>85&&stu[i].w=='Y') stu[i].sum+=1000;
if(stu[i].s2>80&&stu[i].g=='Y') stu[i].sum+=850;
}
ssum=0;
for (i=0;i<n;i++) { if (stu[i].sum>max.sum) {max.sum=stu[i].sum;strcpy(max.name,stu[i].name);}ssum+=stu[i].sum;}
printf("%s\n%ld\n%d",max.name,max.sum,ssum);
}
|
39
|
19499
|
int main(int argc, char* argv[])
{
struct stu{
char name[20];
int a;//qi mo
int b;//ban ji
char c;//ban gan
char d;//xi bu
int e;//lun wen
}str[101];
int n;
scanf("%d",&n);
int a[101];//qian shu
for(int k=1;k<=n;k++){
a[k]=0;}
int sum=0;//zong qian
for(int i=1;i<=n;i++){
scanf("%s %d %d %c %c %d",&str[i].name,&str[i].a,&str[i].b,&str[i].c,&str[i].d,&str[i].e);}
for(int j=1;j<=n;j++){
if(str[j].a>80&&str[j].e>=1){
a[j]+=8000;}
if(str[j].a>85&&str[j].b>80){
a[j]+=4000;}
if(str[j].a>90){
a[j]+=2000;}
if(str[j].a>85&&str[j].d=='Y'){
a[j]+=1000;}
if(str[j].b>80&&str[j].c=='Y'){
a[j]+=850;}
sum+=a[j];}
int w=a[1],q=1;
for(int t=2;t<=n;t++){
if(a[t]>w){
w=a[t];
q=t;}
}
printf("%s\n",str[q].name);
printf("%d\n",a[q]);
printf("%d\n",sum);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.