label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
39
|
19000
|
struct student{
char name[20];
int pjcj,pycj;
char ganbu,xibu;
int article;
};
void main()
{
struct student *p;
int n,i;
int sum=0,max=0,maxnum,single=0;
scanf("%d",&n);
p= (struct student *)malloc( n*sizeof(struct student) );
for(i=0 ; i<n ; i++,single=0 ){
scanf("%s", &p[i].name);
scanf("%d%d", &p[i].pjcj, &p[i].pycj);
scanf(" %c %c", &p[i].ganbu, &p[i].xibu);
scanf("%d", &p[i].article);
if( p[i].pjcj>80 && p[i].article )
single+=8000;
if( p[i].pjcj>85 && p[i].pycj>80 )
single+=4000;
if( p[i].pjcj>90 )
single+=2000;
if( p[i].pjcj>85 && p[i].xibu=='Y')
single+=1000;
if( p[i].pycj>80 && p[i].ganbu=='Y')
single+=850;
if( single>max ){
max=single;
maxnum=i;
}
sum+=single;
}
printf("%s\n",p[maxnum].name);
printf("%d\n",max);
printf("%d\n",sum);
}
|
39
|
19001
|
struct student{
char name[20];
int qimo;
int ping;
char gan;
char xi;
int lun;
}stu[101];
int main(int argc, char* argv[])
{ int n,i;
int jiang[101];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].ping,&stu[i].gan,&stu[i].xi,&stu[i].lun);
jiang[i]=0;
}
int max=0,zong=0;
for(i=0;i<n;i++){
if(stu[i].qimo>80&&stu[i].lun>0)jiang[i]+=8000;
if(stu[i].qimo>85&&stu[i].ping>80)jiang[i]+=4000;
if(stu[i].qimo>90)jiang[i]+=2000;
if(stu[i].qimo>85&&stu[i].xi=='Y')jiang[i]+=1000;
if(stu[i].ping>80&&stu[i].gan=='Y')jiang[i]+=850;
if(max<jiang[i])max=jiang[i];
zong+=jiang[i];
}
for(i=0;i<n;i++){
if(max==jiang[i]){
printf("%s\n%d\n",stu[i].name,jiang[i]);break;
}
}
printf("%d\n",zong);
return 0;
}
|
39
|
19002
|
int main()
{
struct student
{char name[20];
int g1;
int g2;
char c;
char w;
int p;}stu[100];
int n,s[100],total=0,max=0,i;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d\n",&stu[i].name,&stu[i].g1,&stu[i].g2,&stu[i].c,&stu[i].w,&stu[i].p);
for(i=0;i<n;i++)
{ if(stu[i].g1>80&&stu[i].p>=1)s[i]=s[i]+8000;
if(stu[i].g1>85&&stu[i].g2>80)s[i]=s[i]+4000;
if(stu[i].g1>90)s[i]=s[i]+2000;
if(stu[i].g1>85&&stu[i].w=='Y')s[i]=s[i]+1000;
if(stu[i].g2>80&&stu[i].c=='Y')s[i]=s[i]+850;
total=total+s[i];}
for(i=1;i<n;i++)
if(s[i]>s[max])max=i;
printf("%s\n",stu[max].name);
printf("%d\n",s[max]);
printf("%d\n",total);
return 0;
}
|
39
|
19003
|
void main()
{
int N,x[100][3],i,total[100]={0};
int T[100],s=0,k;
char y[100][2],z[100][20];
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%s %d %d %c %c %d",z[i],&x[i][0],&x[i][1],&y[i][0],&y[i][1],&x[i][2]);
for(i=0;i<N;i++)
{
if(x[i][0]>80 && x[i][2]>0) total[i]=total[i]+8000;
if(x[i][0]>85 && x[i][1]>80) total[i]=total[i]+4000;
if(x[i][0]>90) total[i]=total[i]+2000;
if(x[i][0]>85 && y[i][1]=='Y') total[i]=total[i]+1000;
if(x[i][1]>80 && y[i][0]=='Y') total[i]=total[i]+850;
s=s+total[i];
}
for(i=0;i<N;i++)
T[i]=total[i];
for(i=0;i<N-1;i++)
{
if(T[i]>T[i+1])
{
k=T[i];
T[i]=T[i+1];
T[i+1]=k;
}
}
for(i=0;i<N;i++)
if(total[i]==T[N-1])
{
printf("%s\n",z[i]);
printf("%d\n",total[i]);
printf("%d",s);
break;
}
}
|
39
|
19004
|
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
|
19005
|
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
|
19006
|
struct Student
{char name[30];
int q;
int b;
char s;
char x;
int w;
int money;
};
int main()
{
struct Student stu[100];
struct Student temp;
int n,sum=0,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d %c %c%d",&stu[i].name,&stu[i].q,&stu[i].b,&stu[i].s,&stu[i].x,&stu[i].w);
stu[i].money=0;
if(stu[i].q>80&&stu[i].w>0)
stu[i].money=stu[i].money+8000;
if(stu[i].q>85&&stu[i].b>80)
stu[i].money=stu[i].money+4000;
if(stu[i].q>90)
stu[i].money=stu[i].money+2000;
if(stu[i].q>85&&stu[i].x=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].b>80&&stu[i].s=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0;i<n;i++){
sum=sum+stu[i].money;
}
for(i=0;i<n;i++){
k=i;
for(j=i+1;j<n;j++)
if(stu[j].money>stu[k].money)
k=j;
temp=stu[k];stu[k]=stu[i];stu[i]=temp;
}
printf("%s\n%d\n%d\n",stu[0].name,stu[0].money,sum);
return 0;
}
|
39
|
19007
|
void main()
{
struct student
{char name[20];
int grade;
int eva;
char pres;
char west;
int paper;
int money;
}stu[100];
int n,i,sum,j;
struct student *p;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].grade,&stu[i].eva,&stu[i].pres,&stu[i].west,&stu[i].paper);
for(i=0;i<n;i++)
{
stu[i].money=0;
if(stu[i].grade>80 && stu[i].paper>=1)
stu[i].money=stu[i].money+8000;
if(stu[i].grade>85 && stu[i].eva>80)
stu[i].money=stu[i].money+4000;
if(stu[i].grade>90)
stu[i].money=stu[i].money+2000;
if(stu[i].grade>85 && stu[i].west=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].eva>80 && stu[i].pres=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0,sum=0;i<n;i++)
sum=sum+stu[i].money;
for(i=1,p=&stu[0];i<n;i++)
{ if(stu[i].money>p->money)
p=stu+i;
}
printf("%s\n%d\n%d\n",p->name,p->money,sum);
}
|
39
|
19008
|
struct Student
{
char name[20];
int final;
int evaluate;
char office;
char west;
int paper;
int money;
struct Student *next;
};
int main()
{
struct Student *head,*p,*best;
head=(struct Student *)malloc(sizeof(struct Student));
p=head;
int N,i;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->final,&p->evaluate,&p->office,&p->west,&p->paper);
p->money=0;
if(p->final>80&&p->paper>0)
p->money+=8000;
if(p->final>85&&p->evaluate>80)
p->money+=4000;
if(p->final>90)
p->money+=2000;
if(p->final>85&&p->west=='Y')
p->money+=1000;
if(p->evaluate>80&&p->office=='Y')
p->money+=850;
p->next=(struct Student *)malloc(sizeof(struct Student));
p=p->next;
}
int all=0;
p=head;
best=head;
for(i=0;i<N;i++)
{
all+=p->money;
if(p->money>best->money)
{
best=p;
}
p=p->next;
}
printf("%s\n%d\n%d",best->name,best->money,all);
return 0;
}
|
39
|
19009
|
struct student
{
int avescore,classscore,paper,money;
char name[21],lead[2],west[2];
}stu[100];
main()
{
int n,i,max=0,money=0;
char output[21];
scanf("%d",&n);
for(i=0;i<n;i++)
{
stu[i].money=0;
scanf("%s%d%d%s%s%d",&stu[i].name,&stu[i].avescore,&stu[i].classscore,&stu[i].lead,&stu[i].west,&stu[i].paper);
if(stu[i].avescore>80&&stu[i].paper>=1)
{
stu[i].money+=8000;
}
if(stu[i].avescore>85&&stu[i].classscore>80)
{
stu[i].money+=4000;
}
if(stu[i].avescore>90)
{
stu[i].money+=2000;
}
if(stu[i].avescore>85&&stu[i].west[0]=='Y')
{
stu[i].money+=1000;
}
if(stu[i].classscore>80&&stu[i].lead[0]=='Y')
{
stu[i].money+=850;
}
money+=stu[i].money;
if(max<stu[i].money)
{
max=stu[i].money;
strcpy(output,stu[i].name);
}
}
printf("%s\n%d\n%d\n",output,max,money);
return 0;
}
|
39
|
19010
|
struct node
{
char name[20];
int fin;
int bj;
char gb;
char west;
int essay;
}stu[100];
void main(){
int n,sum=0,max=0;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].fin,&stu[i].bj,&stu[i].gb,&stu[i].west,&stu[i].essay);
}
int a[100];
for(i=0;i<n;i++)
{
a[i]=0;
if((stu[i].fin>80)&&(stu[i].essay>=1)) a[i]=a[i]+8000;
if((stu[i].fin>85)&&(stu[i].bj>80)) a[i]=a[i]+4000;
if(stu[i].fin>90) a[i]=a[i]+2000;
if((stu[i].fin>85)&&(stu[i].west=='Y')) a[i]=a[i]+1000;
if((stu[i].gb=='Y')&&(stu[i].bj>80)) a[i]=a[i]+850;
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
for(i=0;i<n;i++)
{
if(a[i]>max) max=a[i];
}
for(i=0;i<n;i++)
{
if(a[i]==max)
{
printf("%s\n%d\n",stu[i].name,a[i]);
break;
}
}
printf("%d",sum);
}
|
39
|
19011
|
struct student
{
char name[30];
int exam;
int result;
char gan[2];
char xibu[2];
int lecture;
int bonus;
};
void main()
{
int n,i,sum=0;
struct student Max;
scanf("%d" ,&n);
struct student *stu;
stu = (struct student *)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{
scanf("%s %d %d %s %s %d" ,stu[i].name,&stu[i].exam,&stu[i].result,&stu[i].gan,&stu[i].xibu,&stu[i].lecture);
}
for(i=0;i<n;i++)
{
stu[i].bonus=0;
if(((stu[i].exam)>80)&&((stu[i].lecture)>0))
{
stu[i].bonus+=8000;
}
if(((stu[i].exam)>85)&&((stu[i].result)>80))
{
stu[i].bonus+=4000;
}
if((stu[i].exam)>90)
{
stu[i].bonus+=2000;
}
if(((stu[i].exam)>85)&&((stu[i].xibu[0])=='Y'))
{
stu[i].bonus+=1000;
}
if(((stu[i].result)>80)&&((stu[i].gan[0])=='Y'))
{
stu[i].bonus+=850;
}
}
Max=stu[0];
for(i=1;i<n;i++)
{
if(stu[i].bonus>Max.bonus)
Max=stu[i];
}
printf("%s\n" ,Max.name);
printf("%d\n" ,Max.bonus);
for(i=0;i<n;i++)
{
sum+=stu[i].bonus;
}
printf("%d\n" ,sum);
free(stu);
}
|
39
|
19012
|
int main()
{
struct money
{
char name[20];
int score1,score2;
char a[2],b[2];
int paper;
int all;
};
struct money * p;
int n,m;int * pp;
scanf("%d",&n);
p=(struct money *)malloc(n*sizeof(struct money));
pp=(int *)malloc(n*sizeof(int));
for(m=0;m<n;m++)
{
pp[m]=0;
scanf("%s",p[m].name);
scanf("%d %d",&p[m].score1,&p[m].score2);
scanf("%s %s",&p[m].a,&p[m].b);
scanf("%d",&p[m].paper);
if(p[m].score1>80&&p[m].paper>0)
pp[m]=pp[m]+8000;
if(p[m].score1>85&&p[m].score2>80)
pp[m]=pp[m]+4000;
if(p[m].score1>90)
pp[m]=pp[m]+2000;
if(p[m].b[0]=='Y'&&p[m].score1>85)
pp[m]=pp[m]+1000;
if(p[m].a[0]=='Y'&&p[m].score2>80)
pp[m]=pp[m]+850;
p[m].all=pp[m];
}
int i,j,k,q=0;
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
if(pp[j]>pp[j+1])
{
k=pp[j];
pp[j]=pp[j+1];
pp[j+1]=k;
}
for(i=0;i<n;i++)
q=q+pp[i];
for(i=0;i<n;i++)
if(p[i].all==pp[n-1])
{
printf("%s\n%d\n%d\n",p[i].name,p[i].all,q);break;
}
free(p);
free(pp);
}
|
39
|
19013
|
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
|
19014
|
int main()
{
struct jiangxuejin
{
char name[20],s1,s2;
int qimo,banji,lunwen;
}s[100];
int n,i,b,jiangjin[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d\n",&s[i].name,&s[i].qimo,&s[i].banji,&s[i].s1,&s[i].s2,&s[i].lunwen);
}
for (i=0;i<n;i++)
{
b=0;
if (s[i].qimo>80&&s[i].lunwen>=1)
{
b+=8000;
}
if (s[i].qimo>85&&s[i].banji>80)
{
b+=4000;
}
if (s[i].qimo>90)
{
b+=2000;
}
if (s[i].qimo>85&&s[i].s2=='Y')
{
b+=1000;
}
if (s[i].banji>80&&s[i].s1=='Y')
{
b+=850;
}
jiangjin[i]=b;
}
int largest=0,sum=0;
for (i=0;i<n;i++)
{
if (jiangjin[i]>=largest)
{
largest=jiangjin[i];
}
sum+=jiangjin[i];
}
for (i=0;i<n;i++)
{
if (jiangjin[i]==largest)
{
printf("%s\n",s[i].name);
printf("%d\n",largest);
printf("%d",sum);
break;
}
}
return 0;
}
|
39
|
19015
|
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
|
19016
|
void main()
{
int i,n,k;
long a[100]={0},ss,m;
struct student
{
char name[20];
int score1,score2;
char leader;
char western;
int essay;
}st[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",st[i].name,&st[i].score1,&st[i].score2,&st[i].leader,&st[i].western,&st[i].essay);
for(i=0;i<n;i++)
{
if(st[i].score1>80&&st[i].essay!=0) a[i]=a[i]+8000;
if(st[i].score1>85&&st[i].score2>80) a[i]=a[i]+4000;
if(st[i].score1>90) a[i]=a[i]+2000;
if(st[i].score1>85&&st[i].western=='Y') a[i]=a[i]+1000;
if(st[i].score2>80&&st[i].leader=='Y') a[i]=a[i]+850;
}
m=a[0]; k=0; ss=a[0];
for(i=1;i<n;i++)
{
if(m<a[i])
{
m=a[i];
k=i;
}
ss=ss+a[i];
}
printf("%s\n%ld\n%ld\n",st[k].name,a[k],ss);
}
|
39
|
19017
|
struct stu
{
char name[25];
int sco;
int scob;
int gb;
int xb;
int lw;
int mon;
};
int main()
{
int n;
int i;
int max=0;
int zh;
long int all=0;
char du1,du2;
scanf("%d",&n);
struct stu a[100];
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].sco,&a[i].scob,&du1,&du2,&a[i].lw);
if(du1=='Y')
a[i].gb=1;
else
a[i].gb=0;
if(du2=='Y')
a[i].xb=1;
else
a[i].xb=0;
a[i].mon=0;
}
for(i=0;i<n;i++)
{
if(a[i].sco>80&&a[i].lw>=1)
a[i].mon+=8000;
if(a[i].sco>85&&a[i].scob>80)
a[i].mon+=4000;
if(a[i].sco>90)
a[i].mon+=2000;
if(a[i].sco>85&&a[i].xb==1)
a[i].mon+=1000;
if(a[i].scob>80&&a[i].gb==1)
a[i].mon+=850;
if(a[i].mon>max)
{
max=a[i].mon;
zh=i;
}
all+=a[i].mon;
}
printf("%s\n%d\n%lu",a[zh].name,a[zh].mon,all);
}
|
39
|
19018
|
int main()
{
int N,i,sum,max,k,total=0;
int t[100];
struct student
{
char name[40];
int grade1;
int grade2;
char monitor;
char western;
int num;
};
struct student stu[100];
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s%d%d%s%s%d",stu[i].name,&stu[i].grade1,&stu[i].grade2,&stu[i].monitor,&stu[i].western,&stu[i].num);
}
for(i=0;i<N;i++)
{
sum=0;
if(stu[i].grade1>80 && stu[i].num>=1)
sum+=8000;
if(stu[i].grade1>85 && stu[i].grade2>80)
sum+=4000;
if(stu[i].grade1>90)
sum+=2000;
if(stu[i].grade1>85 && stu[i].western=='Y')
sum+=1000;
if(stu[i].grade2>80 && stu[i].monitor=='Y')
sum+=850;
t[i]=sum;
}
max=0;
for(i=0;i<N;i++)
{
if(t[i]>max)
{
max=t[i];
k=i;
}
}
for(i=0;i<N;i++)
total+=t[i];
printf("%s\n%d\n%d\n",stu[k].name,max,total);
return 0;
}
|
39
|
19019
|
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
|
19020
|
void main()
{
struct stud
{
char name[1000];
int gra;
int grcla;
char of;
char won;
int essay;
int sum;
};
struct stud a[1000];
int n,i,all=0,j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&a[i].name,&a[i].gra,&a[i].grcla,&a[i].of,&a[i].won,&a[i].essay);
}
for(i=0;i<n;i++)
{
a[i].sum=0;
if(a[i].gra>80&&a[i].essay>=1)a[i].sum=8000;
if(a[i].gra>85&&a[i].grcla>80)a[i].sum=a[i].sum+4000;
if(a[i].gra>90)a[i].sum=a[i].sum+2000;
if(a[i].gra>85&&a[i].won=='Y')a[i].sum=a[i].sum+1000;
if(a[i].grcla>80&&a[i].of=='Y')a[i].sum=a[i].sum+850;
}
for(i=0;i<n;i++)
all=all+a[i].sum;
for(i=0;i<=n-1;)
{
if(a[i].sum<a[j+1].sum)
i=i+1;
else if(a[i].sum>=a[j+1].sum)
j++;
if(j>=n)
break;
}
printf("%s\n",a[i].name);
printf("%d\n",a[i].sum);
printf("%d\n",all);
}
|
39
|
19021
|
struct student
{char name[30];
int score1;
int score2;
char ganbu[1];
char xibu[1];
int lunwen;
int s;
}stu[100];
main()
{
int N,i,max=0,j,sum=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s%d%d%s%s%d",stu[i].name,&stu[i].score1,&stu[i].score2,stu[i].ganbu,stu[i].xibu,&stu[i].lunwen);
}
for(i=0;i<N;i++)
{
stu[i].s=0;
}
for(i=0;i<N;i++)
{
if(stu[i].score1>80&&stu[i].lunwen>0)
stu[i].s=stu[i].s+8000;
if(stu[i].score1>85&&stu[i].score2>80)
stu[i].s=stu[i].s+4000;
if(stu[i].score1>90)
stu[i].s=stu[i].s+2000;
if(stu[i].score1>85&&stu[i].xibu[0]=='Y')
stu[i].s=stu[i].s+1000;
if(stu[i].score2>80&&stu[i].ganbu[0]=='Y')
stu[i].s=stu[i].s+850;
}
for(i=0;i<N;i++)
{
if(stu[i].s>max)
{
max=stu[i].s;
j=i;
}
sum=sum+stu[i].s;
}
printf("%s\n",stu[j].name);
printf("%d\n",max);
printf("%d\n",sum);
}
|
39
|
19022
|
int main()
{
int n,i,total=0,max=0,maxi=0;
struct list{
char name[20];
int score;
int rate;
char leader;
char west;
int pap;
int schol;
};
struct list *start,*p1;
scanf("%d",&n);
getchar();
start=(struct list*)calloc(n,sizeof(struct list));
p1=start;
for(i=0;i<n;i++){
scanf("%s", &(p1->name) );
scanf("%d %d %c %c %d", &(p1->score), &(p1->rate), &(p1->leader), &(p1->west), &(p1->pap));
getchar();
p1 -> schol=0;
if( p1->score > 80 && p1->pap > 0 )
p1->schol += 8000;
if( p1->score > 85 && p1->rate > 80 )
p1->schol += 4000;
if( p1->score > 90 )
p1->schol += 2000;
if( p1->score > 85 && p1->west == 'Y' )
p1->schol += 1000;
if( p1->rate > 80 && p1->leader == 'Y' )
p1->schol += 850;
total += p1->schol;
if( p1->schol > max ){
max=p1->schol;
maxi=i;
}
p1++;
}
printf("%s\n%d\n%d\n", (start+maxi) -> name, (start+maxi) -> schol, total);
return 0;
}
|
39
|
19023
|
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
|
19024
|
void main()
{
int N;
scanf("%d",&N);
struct student
{
char name[20];
int qm;
int py;
char gb;
char w;
int lw;
int jj;
}stu[100];
int i;
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].qm,&stu[i].py,&stu[i].gb,&stu[i].w,&stu[i].lw);
stu[i].jj=0;
if(stu[i].qm>90)stu[i].jj+=2000;
if(stu[i].qm>80&&stu[i].lw>=1)stu[i].jj+=8000;
if(stu[i].qm>85&&stu[i].w=='Y')stu[i].jj+=1000;
if(stu[i].qm>85&&stu[i].py>80)stu[i].jj+=4000;
if(stu[i].py>80&&stu[i].gb=='Y')stu[i].jj+=850;
}
int trans1;
char trans2[20];
int total=0;
for(i=0;i<N;i++)total+=stu[i].jj;
for(i=0;i<N-1;i++)
{
if(stu[i].jj>=stu[i+1].jj)
{
trans1=stu[i].jj;
strcpy(trans2,stu[i].name);
strcpy(stu[i].name,stu[i+1].name);
stu[i].jj=stu[i+1].jj;
strcpy(stu[i+1].name,trans2);
stu[i+1].jj=trans1;
}
}
printf("%s\n%d\n%d\n",stu[N-1].name,stu[N-1].jj,total);
}
|
39
|
19025
|
int main(int argc, char* argv[])
{ int n,c[100],d[100],e[100],i,j=0,z,jin[100],max=0;
char s[100][50];
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d %c %c%d",s[i],&c[i],&d[i],&a[i],&b[i],&e[i]);}
for(i=0;i<n;i++){
jin[i]=0;
if(c[i]>80&&e[i]>=1){jin[i]=jin[i]+8000;}
if(c[i]>85&&d[i]>80){jin[i]=jin[i]+4000;}
if(c[i]>90){jin[i]=jin[i]+2000;}
if(c[i]>85&&b[i]=='Y'){jin[i]=jin[i]+1000;}
if(d[i]>80&&a[i]=='Y'){jin[i]=jin[i]+850;}
}
j=0;
for(i=0;i<n;i++){
j=j+jin[i];}
for(i=0;i<n;i++){
if(jin[i]>max){max=jin[i];z=i;}}
printf("%s\n%d\n%d\n",s[z],max,j);
return 0;
}
|
39
|
19026
|
int main()
{
struct{
char t[20],a[2],b[2];
int m,n,p,g;
}k[100],q;
int c,i,j,sum=0;
scanf("%d",&c);
for(i=0;i<c;i++)
{
k[i].g=0;
scanf("%s%d%d%s%s%d",k[i].t,&k[i].m,&k[i].n,k[i].a,k[i].b,&k[i].p);
if(k[i].m>80&&k[i].p>=1)
k[i].g+=8000;
if(k[i].m>85&&k[i].n>80)
k[i].g+=4000;
if(k[i].m>90)
k[i].g+=2000;
if(k[i].m>85&&k[i].b[0]=='Y')
k[i].g+=1000;
if(k[i].n>80&&k[i].a[0]=='Y')
k[i].g+=850;
}
for(i=0;i<c;i++)
{
sum+=k[i].g;
}
for(i=0;i<c;i++)
{
for(j=c-1;j>i;j--)
{
if(k[j].g>k[j-1].g)
{
q=k[j];
k[j]=k[j-1];
k[j-1]=q;
}
}
}
printf("%s\n%d\n%d",k[0].t,k[0].g,sum);
return 0;
}
|
39
|
19027
|
int main()
{
int N,i,sum=0;
int x[100]={0};
int total=0;
struct c{
char p[20];
int m1,m2;
char a,b;
int n;
}q[100];
scanf("%d",&N);
for(i=0;i<N;i++)
{
char y[20];
int m11,m22,n11;
char a1,b1;
scanf("%s %d %d %c %c %d",y,&m11,&m22,&a1,&b1,&n11);
strcpy(q[i].p,y);
q[i].m1=m11;
q[i].m2=m22;
q[i].a=a1;
q[i].b=b1;
q[i].n=n11;
}
for(i=0;i<N;i++)
{
if(q[i].m1>80&&q[i].n>0)
{
x[i]=x[i]+8000;
}
if(q[i].m1>85&&q[i].m2>80)
{
x[i]=x[i]+4000;
}
if(q[i].m1>90)
{
x[i]=x[i]+2000;
}
if(q[i].m1>85&&q[i].b=='Y')
{
x[i]=x[i]+1000;
}
if(q[i].m2>80&&q[i].a=='Y')
{
x[i]=x[i]+850;
}
}
for(i=N-1;i>=0;i--)
{
if(x[i]>=sum)
{
sum=x[i];
}
total=total+x[i];
}
for(i=0;i<N;i++)
{
if(sum==x[i])
{
printf("%s\n",q[i].p);
printf("%d\n",sum);
printf("%d\n",total);
break;
}
}
return 0;
}
|
39
|
19028
|
int main ()
{
char name[100][20]={0};
char bgb,xb;
int sc1,sc2,lw,sum[100]={0},s=0;
int n,max=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",name[i]);
scanf("%d %d %c %c %d",&sc1,&sc2,&bgb,&xb,&lw);
if(sc1>80 && lw>0){
sum[i]+=8000;
}
if(sc1>85 && sc2>80){
sum[i]+=4000;
}
if(sc1>90){
sum[i]+=2000;
}
if(sc1>85 && xb=='Y'){
sum[i]+=1000;
}
if(sc2>80 && bgb=='Y'){
sum[i]+=850;
}
s+=sum[i];
}
for(int j=0;j<n;j++){
if(max<sum[j]){
max=sum[j];
}
}
for(int k=0;k<n;k++){
if(sum[k]==max){
printf("%s\n%d\n%d\n",name[k],sum[k],s);
break;
}
}
return 0;
}
|
39
|
19029
|
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
|
19030
|
//???????
struct data{
char a[20];
int b;
int c;
char d[10];
char e[10];
int f;
int g;
struct data *next;
};
int main() {
struct data *head,*p,*pp;
head=(struct data*)malloc(sizeof(struct data));
p=head;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++) {
pp=(struct data*)malloc(sizeof(struct data));
pp->g=0;
scanf("%s %d %d %s %s %d",pp->a,&pp->b,&pp->c,pp->d,pp->e,&pp->f);
if(pp->b>80&&pp->f>0) pp->g=pp->g+8000;
if(pp->b>85&&pp->c>80) pp->g=pp->g+4000;
if(pp->b>90) pp->g=pp->g+2000;
if(pp->b>85&&pp->e[0]=='Y') pp->g=pp->g+1000;
if(pp->c>80&&pp->d[0]=='Y') pp->g=pp->g+850;
p->next=pp;
p=pp;
}
p=head->next;
struct data *x;
int max=0,zz=0;
for(i=0;i<n;i++) {
if(p->g>max) {
max=p->g;
x=p;
}
zz=zz+p->g;
p=p->next;
}
printf("%s\n",x->a);
printf("%d\n",x->g);
printf("%d\n",zz);
}
|
39
|
19031
|
void main()
{
struct stu
{
char name[20];
int q;
int p;
char g;
char x;
int l;
}stu[100];
int n,i,j;
char m[100][20];
int s,t=0,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].q,&stu[i].p,&stu[i].g,&stu[i].x,&stu[i].l);
s=0;
if(stu[i].q>80&&stu[i].l>=1)
s=s+8000;
if(stu[i].q>85&&stu[i].p>80)
s=s+4000;
if(stu[i].q>90)
s=s+2000;
if(stu[i].q>85&&stu[i].x=='Y')
s=s+1000;
if(stu[i].p>80&&stu[i].g=='Y')
s=s+850;
sum=sum+s;
if(s>t)
{
j=0;
strcpy(m[j],stu[i].name);
t=s;
j++;
}
else if(s==t)
{
strcpy(m[j],stu[i].name);
j++;
}
}
printf("%s\n",m[0]);
printf("%d\n",t);
printf("%d\n",sum);
}
|
39
|
19032
|
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
|
19033
|
void main()
{
int n,qm[100],bj[100],lw[100],i,j,l=0,k,z[100]={0},p=0;
char na[100][30],bg[100],mz[100],P[1][30];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",na[i],&qm[i],&bj[i],&bg[i],&mz[i],&lw[i]);
}
for(i=0;i<n;i++)
{
if(qm[i]>80 && lw[i]>=1)
z[i]=z[i]+8000;
if(qm[i]>85 && bj[i]>80)
z[i]=z[i]+4000;
if(qm[i]>90)
z[i]=z[i]+2000;
if(qm[i]>85 && mz[i]=='Y')
z[i]=z[i]+1000;
if(bg[i]=='Y' && bj[i]>80)
z[i]=z[i]+850;
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-j-1;i++)
if(z[i]<z[i+1])
{
k=z[i];
z[i]=z[i+1];
z[i+1]=k;
strcpy(P,na[i]);
strcpy(na[i],na[i+1]);
strcpy(na[i+1],P);
}
}
for(i=0;i<n;i++)
p=p+z[i];
printf("%s\n%d\n%d\n",na[0],z[0],p);
}
|
39
|
19034
|
void main()
{
struct student{
char name[20];
int qimochengji;
int banjipingyi;
char ganbu;
char xibu;
int lunwenshu;
int jiangxuejin;
} stu[100];
int n,i,sum,max;
scanf("%d\n",&n);
for(i=0,sum=0,max=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimochengji,&stu[i].banjipingyi,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwenshu);
stu[i].jiangxuejin=0;
if(stu[i].qimochengji>80&&stu[i].lunwenshu>=1) stu[i].jiangxuejin=stu[i].jiangxuejin+8000;
if(stu[i].qimochengji>85&&stu[i].banjipingyi>80) stu[i].jiangxuejin=stu[i].jiangxuejin+4000;
if(stu[i].qimochengji>90) stu[i].jiangxuejin=stu[i].jiangxuejin+2000;
if(stu[i].qimochengji>85&&stu[i].xibu=='Y') stu[i].jiangxuejin=stu[i].jiangxuejin+1000;
if(stu[i].banjipingyi>80&&stu[i].ganbu=='Y') stu[i].jiangxuejin=stu[i].jiangxuejin+850;
sum+=stu[i].jiangxuejin;
if(stu[max].jiangxuejin<stu[i].jiangxuejin) max=i;
}
printf("%s\n",stu[max].name);
printf("%d\n",stu[max].jiangxuejin);
printf("%d\n",sum);
}
|
39
|
19035
|
struct
{
char name[21];
int test,grade,paper,sum;
char monitor,west;
}stu[100];
int main()
{
int n,i,j,s=0,a,b=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",
stu[i].name,
&stu[i].test,
&stu[i].grade,
&stu[i].monitor,
&stu[i].west,
&stu[i].paper);
stu[i].sum=0;
if(stu[i].test>80&&stu[i].paper>=1) stu[i].sum+=8000;
if(stu[i].test>85&&stu[i].grade>80) stu[i].sum+=4000;
if(stu[i].test>90) stu[i].sum+=2000;
if(stu[i].test>85&&stu[i].west=='Y') stu[i].sum+=1000;
if(stu[i].grade>80&&stu[i].monitor=='Y') stu[i].sum+=850;
s+=stu[i].sum;
}
a=stu[0].sum;
for(i=1;i<n;i++){
if(stu[i].sum>a){
a=stu[i].sum;
b=i;
}
}
printf("%s\n%d\n%d",stu[b].name,stu[b].sum,s);
return 0;
}
|
39
|
19036
|
void main()
{
int m,n,x,y,a,b,c,d,e,i,total1=0,hu=0;
long int total2=0;
char name[20],j[20],ch1,ch2;
scanf("%d\n",&x);
for(i=1;i<=x;i++)
{
scanf("%s %d %d %c %c %d",name,&m,&n,&ch1,&ch2,&y);
if(m>80&&y>=1)
a=8000;
else a=0;
if(m>85&&n>80)
b=4000;
else b=0;
if(m>90)
c=2000;
else c=0;
if(m>85&&ch2=='Y')
d=1000;
else d= 0;
if(n>80&&ch1=='Y')
e=850;
else e= 0;
total1=a+b+c+d+e;
if(total1>hu)
{
hu=total1;
strcpy(j,name);
}
total2+=total1;
}
printf("%s\n%d\n%ld\n",j,hu,total2);
}
|
39
|
19037
|
struct student
{
char name[30];
int examgrade;
int appgrade;
char a;
char b;
int thesis;
};
void main()
{
int n,i,temp,sum=0,max=0;
int money[100]={0};
struct student stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].name);
scanf("%d%d",&stu[i].examgrade,&stu[i].appgrade);
scanf(" %c %c",&stu[i].a,&stu[i].b);
scanf("%d",&stu[i].thesis);
}
for(i=0;i<n;i++)
{
if(stu[i].examgrade>80)
{
if(stu[i].thesis>=1)
money[i]=money[i]+8000;
if(stu[i].examgrade>85)
{
if(stu[i].appgrade>80)
money[i]=money[i]+4000;
if(stu[i].examgrade>90)
money[i]=money[i]+2000;
if(stu[i].b=='Y')
money[i]=money[i]+1000;
}
}
if(stu[i].a=='Y'&&stu[i].appgrade>80)
money[i]=money[i]+850;
}
for(i=0;i<n;i++)
{
sum=sum+money[i];
if(money[i]>max)
{
max=money[i];
temp=i;
}
}
printf("%s\n",stu[temp].name);
printf("%d\n%d",max,sum);
}
|
39
|
19038
|
struct student
{
char name[20];
int a1;
int a2;
char w;
char m;
int e;
int sch;
}stu[100];
void main()
{
int n,i,sum=0;
struct student p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].a1,&stu[i].a2,&stu[i].m,&stu[i].w,&stu[i].e);
stu[i].sch=0;
if(stu[i].a1>80&&stu[i].e>0) stu[i].sch+=8000;
if(stu[i].a1>85&&stu[i].a2>80) stu[i].sch+=4000;
if(stu[i].a1>90) stu[i].sch+=2000;
if(stu[i].a1>85&&stu[i].w=='Y') stu[i].sch+=1000;
if(stu[i].a2>80&&stu[i].m=='Y') stu[i].sch+=850;
sum+=stu[i].sch;
}
p=stu[0];
for(i=0;i<n;i++)
if(stu[i].sch>p.sch) p=stu[i];
printf("%s\n%d\n%d",p.name,p.sch,sum);
}
|
39
|
19039
|
struct student
{
char name[100];
int ascore;
int bscore;
char leader;
char xibu;
int papernum;
int money;
struct student *next;
};
int n;
int num;
int total=0;
int main()
{
int i;
scanf("%d",&num);
struct student *creat();
struct student *pt,*p,*flagp;
pt=creat();
p=pt;
int max=pt->money;
for(;;)
{
if(max<=p->money)
{max=p->money;}
if(p->next==NULL)
{goto part2;}
p=p->next;
}
part2:
p=pt;
for(;;)
{
if(max==p->money)
{flagp=p;goto part1;}
if(p->next==NULL)
{goto part1;}
p=p->next;
}
part1:;
printf("%s\n%d\n%d",flagp->name,flagp->money,total);
return 0;
}
struct student *creat()
{
struct student *head,*p1,*p2;
n=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->ascore,&p1->bscore,&p1->leader,&p1->xibu,&p1->papernum);
head=NULL;
p1->money=0;
if(p1->ascore>80&&p1->papernum>=1)
p1->money+=8000;
if(p1->ascore>85&&p1->bscore>80)
p1->money+=4000;
if(p1->ascore>90)
p1->money+=2000;
if(p1->ascore>85&&p1->xibu=='Y')
p1->money+=1000;
if(p1->bscore>80&&p1->leader=='Y')
p1->money+=850;
total=p1->money;
while(n!=num-1)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
p1->money=0;
scanf("%s %d %d %c %c %d",p1->name,&p1->ascore,&p1->bscore,&p1->leader,&p1->xibu,&p1->papernum);
if(p1->ascore>80&&p1->papernum>=1)
p1->money+=8000;
if(p1->ascore>85&&p1->bscore>80)
p1->money+=4000;
if(p1->ascore>90)
p1->money+=2000;
if(p1->ascore>85&&p1->xibu=='Y')
p1->money+=1000;
if(p1->bscore>80&&p1->leader=='Y')
p1->money+=850;
total=total+p1->money;
}
p2->next=p1;
p1->next=NULL;
return (head);
}
|
39
|
19040
|
struct student
{
char name[20];
int mark;
int re;
char work;
char west;
int paper;
int sum;
}stu[100];
void main()
{
int n,i,sum=0,max=0,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %s %s %d",&stu[i].name,&stu[i].mark,&stu[i].re,&stu[i].work,&stu[i].west,&stu[i].paper);
stu[i].sum=0;
if(stu[i].mark>80&&stu[i].paper>0)
stu[i].sum+=8000;
if(stu[i].mark>85&&stu[i].re>80)
stu[i].sum+=4000;
if(stu[i].mark>90)
stu[i].sum+=2000;
if(stu[i].mark>85&&stu[i].west=='Y')
stu[i].sum+=1000;
if(stu[i].re>80&&stu[i].work=='Y')
stu[i].sum+=850;
sum=sum+stu[i].sum;
}
for(i=0;i<n;i++)
if(max<stu[i].sum)
{
max=stu[i].sum;
l=i;
}
printf("%s\n%d\n%d\n",stu[l].name,max,sum);
}
|
39
|
19041
|
void main()
{
int n,i,qians[100],sum,t,d;
int jiangj(int a,int b,char d,char e,int c);
struct student
{
char name[20];
int qimo;
int py;
char a;
char b;
int paper;
};
struct student stu[100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].py,&stu[i].a,&stu[i].b,&stu[i].paper);
qians[i]=jiangj(stu[i].qimo,stu[i].py,stu[i].a,stu[i].b,stu[i].paper);
}
for(i=0,t=0,sum=0;i<n;i++)
{
sum=sum+qians[i];
if(t<qians[i])
{
d=i;
t=qians[i];
}
}
printf("%s\n%d\n%d",stu[d].name,qians[d],sum);
}
int jiangj(int a,int b,char d,char e,int c)
{
int z;
z=0;
if(a>80&&c>0)
z=z+8000;
if(a>85&&b>80)
z=z+4000;
if(a>90)
z=z+2000;
if(a>85&&e=='Y')
z=z+1000;
if(b>80&&d=='Y')
z=z+850;
return(z);
}
|
39
|
19042
|
int main()
{
int n,i,s,total=0;
struct
{char name[21];
int ave;
int mar;
int es;
char a;
char b;
int sum;
}stu[100];
scanf("%d", &n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d", stu[i].name, &stu[i].ave, &stu[i].mar, &stu[i].a, &stu[i].b, &stu[i].es);
for(i=0;i<n;i++)
{
stu[i].sum=0;
if(stu[i].ave>80&&stu[i].es>0) stu[i].sum+=8000;
if(stu[i].ave>85&&stu[i].mar>80) stu[i].sum+=4000;
if(stu[i].ave>90) stu[i].sum+=2000;
if(stu[i].ave>85&&stu[i].b=='Y') stu[i].sum+=1000;
if(stu[i].mar>80&&stu[i].a=='Y') stu[i].sum+=850;
total+=stu[i].sum;
}
s=stu[0].sum;
for(i=1;i<n;i++)
{
if(stu[i].sum>s) s=stu[i].sum;
}
for(i=0;i<n;i++)
{
if(stu[i].sum==s)
{
printf("%s\n%d\n", stu[i].name, stu[i].sum);
break;}
}
printf("%d", total);
return 0;
}
|
39
|
19043
|
int main () {
long int n,i,k,t,c,j,s=0,max=0,a[800]={0};
char b[200][500],y,x;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("\n%s %d %d %c %c %d",b[i],&k,&t,&y,&x,&c);
if (k>80 && c>0) a[i]+=8000;
if (k>85 && t>80) a[i]+=4000;
if (k>90) a[i]+=2000;
if (k>85 && x=='Y') a[i]+=1000;
if (t>80 && y=='Y') a[i]+=850;
s+=a[i];
}
for (i=0;i<n;i++)
{
if (a[i]>max){
max=a[i];
j=i;}
}
printf ("%s\n%d\n%d",b[j],max,s);
return 0;
}
|
39
|
19044
|
struct stu
{
char name[21];
int final;
int pingyi;
char leader;
char west;
int essay;
int total;
};
int main()
{
int yuanshi(struct stu s);
int wusi(struct stu s);
int score(struct stu s);
int western(struct stu s);
int contribution(struct stu s);
int n,i;
int sum=0,max;
struct stu s[101],boss;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",s[i].name,&s[i].final,&s[i].pingyi,&s[i].leader,&s[i].west,&s[i].essay);
s[i].total=0;
if (yuanshi(s[i]))
s[i].total+=8000;
if (wusi(s[i]))
s[i].total+=4000;
if (score(s[i]))
s[i].total+=2000;
if (western(s[i]))
s[i].total+=1000;
if (contribution(s[i]))
s[i].total+=850;
}
max=s[0].total;
for (i=0;i<n;i++)
{
if (max<s[i].total)
{
max=s[i].total;
boss=s[i];
}
sum+=s[i].total;
}
printf("%s\n%d\n%d\n",boss.name,boss.total,sum);
return 0;
}
int yuanshi(struct stu s)
{
if ((s.final>80)&&(s.essay>=1))
{
return 1;
}
else
return 0;
}
int wusi(struct stu s)
{
if ((s.final>85)&&(s.pingyi>80))
return 1;
else
return 0;
}
int score(struct stu s)
{
if (s.final>90)
return 1;
else
return 0;
}
int western(struct stu s)
{
if ((s.final>85)&&(s.west=='Y'))
return 1;
else
return 0;
}
int contribution(struct stu s)
{
if ((s.pingyi>80)&&(s.leader=='Y'))
return 1;
else
return 0;
}
|
39
|
19045
|
struct students
{
char name[21];
int S1;
int S2;
char T1;
char T2;
int P;
int JJ;
};
main()
{
int n,i,max;
struct students stu[NUM];
long int all;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("\n%s %d %d %c %c %d",stu[i].name,&stu[i].S1,&stu[i].S2,&stu[i].T1,&stu[i].T2,&stu[i].P);
}
all=0;
for(i=0;i<n;i++)
{
stu[i].JJ=0;
if ((stu[i].S1>80)&&(stu[i].P>=1))
{
stu[i].JJ+=8000;
}
if((stu[i].S1>85)&&(stu[i].S2>80))
{
stu[i].JJ+=4000;
}
if (stu[i].S1>90)
{
stu[i].JJ+=2000;
}
if((stu[i].S1>85)&&(stu[i].T2=='Y'))
{
stu[i].JJ+=1000;
}
if((stu[i].S2>80)&&(stu[i].T1=='Y'))
{
stu[i].JJ+=850;
}
all =all +stu[i].JJ;
}
max=0;
for (i=1;i<n;i++)
{
if (stu[i].JJ>stu[max].JJ)
{
max=i;
}
}
printf("%s\n%d\n%ld\n",stu[max].name,stu[max].JJ,all);
}
|
39
|
19046
|
struct file
{
char name[100];
int scoreq;
int scorec;
char m,w;
int ati;
int money;
};
int main()
{
struct file f[101];
int n,sum=0;
int i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
f[i].money=0;
}
for(i=0;i<n;i++)
{
scanf("%s",f[i].name);
scanf("%d",&f[i].scoreq);
scanf("%d",&f[i].scorec);
getchar();
f[i].m=getchar();
getchar();
f[i].w=getchar();
getchar();
scanf("%d",&f[i].ati);
}
for(i=0;i<n;i++)
{
if(f[i].scoreq>80&&f[i].ati>=1)
f[i].money+=8000;
if(f[i].scoreq>85&&f[i].scorec>80)
f[i].money+=4000;
if(f[i].scoreq>90)
f[i].money+=2000;
if(f[i].scoreq>85&&f[i].w=='Y')
f[i].money+=1000;
if(f[i].scorec>80&&f[i].m=='Y')
f[i].money+=850;
}
for(i=0;i<n;i++)
sum+=f[i].money;
k=f[0].money;
for(i=0;i<n;i++)
{
if(f[i].money>k)
k=f[i].money;
}
for(i=0;i<n;i++)
{
if(f[i].money==k)
{
printf("%s\n",f[i].name);
printf("%d\n",f[i].money);
break;
}
}
printf("%d",sum);
return 0;
}
|
39
|
19047
|
void main()
{
int i,n,total=0;
struct student
{
char name[21];
int FinalScore;
int ClassScore;
char u;
char w;
int a;
int money;
}stu,max;
scanf("%d",&n);
max.money=-1;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu.name,&stu.FinalScore,
&stu.ClassScore,&stu.u,&stu.w,&stu.a);
stu.money=0;
if(stu.FinalScore>80&&stu.a>0)
stu.money+=8000;
if(stu.FinalScore>85&&stu.ClassScore>80)
stu.money+=4000;
if(stu.FinalScore>90)
stu.money+=2000;
if(stu.FinalScore>85&&stu.w=='Y')
stu.money+=1000;
if(stu.ClassScore>80&&stu.u=='Y')
stu.money+=850;
total+=stu.money;
if(stu.money>max.money)
max=stu;
}
printf("%s\n%d\n%d\n",max.name,max.money,total);
}
|
39
|
19048
|
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
|
19049
|
void main()
{
struct student
{
char name[50];
int score1;
int score2;
char master;
char west;
int paper;
};
struct student stu[100];
int i,n,sum[100]={0},total,max;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].score1,&stu[i].score2
,&stu[i].master,&stu[i].west,&stu[i].paper);
for(i=0;i<n;i++)
{
if(stu[i].score1>80&&stu[i].paper>0)sum[i]=sum[i]+8000;
if(stu[i].score1>85&&stu[i].score2>80)sum[i]=sum[i]+4000;
if(stu[i].score1>90)sum[i]=sum[i]+2000;
if(stu[i].score1>85&&stu[i].west==89)sum[i]=sum[i]+1000;
if(stu[i].score2>80&&stu[i].master==89)sum[i]=sum[i]+850;
}
for(i=0,max=sum[0],total=0;i<n;i++)
{
if(sum[i]>=max)max=sum[i];
total+=sum[i];
}
for(i=0;i<n;i++)
{
if(sum[i]==max){
printf("%s\n",stu[i].name);
break;}
}
printf("%d\n",max);
printf("%d\n",total);
}
|
39
|
19050
|
void main()
{
int n,i,j,k,m=0;
struct student
{
char name[20];
int qm;
int bj;
char xg;
char xb;
int lw;
int jj;
};
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].qm,&stu[i].bj,&stu[i].xg,&stu[i].xb,&stu[i].lw);
}
for(i=0;i<n;i++)
{ stu[i].jj=0;
if(stu[i].qm>80&&stu[i].lw>0)
stu[i].jj=stu[i].jj+8000;
if(stu[i].qm>85&&stu[i].bj>80)
stu[i].jj=stu[i].jj+4000;
if(stu[i].qm>90)
stu[i].jj=stu[i].jj+2000;
if(stu[i].qm>85&&stu[i].xb=='Y')
stu[i].jj=stu[i].jj+1000;
if(stu[i].bj>80&&stu[i].xg=='Y')
stu[i].jj=stu[i].jj+850;
}
for(i=0;i<n;i++)
{ k=0;
for(j=0;j<n;j++)
{
if(stu[i].jj<stu[j].jj)
break;
else
k++;
}
if(k==n)
{printf("%s\n%d\n",stu[i].name,stu[i].jj);
break;}
}
for(i=0;i<n;i++)
m=m+stu[i].jj;
printf("%d\n",m);
}
|
39
|
19051
|
struct student
{
char a[20];
int b;
int c;
char d;
char e;
int f;
int g;
};
int main()
{
struct student *s;
int n,i,sum=0,q,max;
scanf("%d",&n);
s=(struct student*)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",s[i].a,&s[i].b,&s[i].c,&s[i].d,&s[i].e,&s[i].f);
}
for(i=0;i<n;i++)
{
s[i].g=0;
if(s[i].b>80&&s[i].f>=1)
s[i].g=s[i].g+8000;
if(s[i].b>85&&s[i].c>80)
s[i].g=s[i].g+4000;
if(s[i].b>90)
s[i].g=s[i].g+2000;
if(s[i].b>85&&s[i].e=='Y')
s[i].g=s[i].g+1000;
if(s[i].c>80&&s[i].d=='Y')
s[i].g=s[i].g+850;
sum=sum+s[i].g;
}
max=s[0].g;
q=0;
for(i=0;i<n;i++)
{
if(max<s[i].g)
{
q=i;
max=s[i].g;
}
}
printf("%s\n%d\n%d",s[q].a,s[q].g,sum);
return 0;
}
|
39
|
19052
|
int sch(int e,int test,char mon,char reg,int art)
{
int total=0;
if(e>80&&art>=1) total+=8000;
if(e>85&&test>80) total+=4000;
if(e>90) total+=2000;
if(e>85&®=='Y') total+=1000;
if(test>80&&mon=='Y') total+=850;
return total;
}
int main()
{
int peoplenumber,i,g,c,a,sum=0,most=0;
char name[100],top[100],m,r;
scanf("%d",&peoplenumber);
for(i=0;i<peoplenumber;i++)
{
scanf("%s%d %d %c %c %d",name,&g,&c,&m,&r,&a);
if(sch(g,c,m,r,a)>most)
{
strcpy(top,name);
most=sch(g,c,m,r,a);
}
sum+=sch(g,c,m,r,a);
}
printf("%s\n%d\n%d",top,most,sum);
//scanf("%d %d %c %c %d",&g,&c,&m,&r,&a);
//printf("%d",sch(g,c,m,r,a));
return 0;
}
|
39
|
19053
|
struct stu
{
char nam[21];
/* int sc1;
int sc2;
char mon;
char wes;
int pap;*/
int sch;
struct stu *next;
};
void main()
{
int len,n,i,sc1,sc2,pap,sum=0;
char mon,wes;
len = sizeof (struct stu);
scanf("%d",&n);
struct stu *head,*p0;
for (i=1;i<=n;i++)
{
p0 = (struct stu*)malloc(len);
if (i==1)
head = p0;
scanf("%s %d %d %c %c %d",&p0->nam,&sc1,&sc2,&mon,&wes,&pap);
p0->sch=0;
if (sc1>80 && pap>0)
p0->sch = p0->sch + 8000;
if (sc1>85 && sc2>80)
p0->sch = p0->sch + 4000;
if (sc1>90)
p0->sch = p0->sch + 2000;
if (sc1>85 && wes=='Y')
p0->sch = p0->sch + 1000;
if (sc2>80 && mon=='Y')
p0->sch = p0->sch + 850;
sum = sum + p0->sch;
if (p0->sch > head->sch)
head = p0;
}
printf("%s\n%d\n%d\n",head->nam,head->sch,sum);
}
|
39
|
19054
|
struct In {char name[21];int g1;int g2;char y1;char y2;int g3;int g;} ;
int main()
{int i,n,b,d=0,m=0;
scanf("%d",&n);
struct In a[101];
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",a[i].name,&a[i].g1,&a[i].g2,&a[i].y1,&a[i].y2,&a[i].g3);if(a[i].g3>0) b=1;else b=0;
a[i].g=(a[i].g1/81)*b*8000+(a[i].g1/86)*(a[i].g2/81)*4000+(a[i].g1/91)*2000+(a[i].g1/86)*(a[i].y2/81)*1000+(a[i].g2/81)*(a[i].y1/81)*850;}
for(i=0;i<n;i++)
{d=d+a[i].g;
if(a[i].g>m) m=a[i].g;}
for(i=0;i<n;i++)
if(a[i].g==m){printf("%s\n%d\n%d\n",a[i].name,a[i].g,d); break;}
return 0;}
|
39
|
19055
|
struct member{
char name[100];
int a;
int b;
char O;
char W;
int x;};
int money(struct member p)
{
int m=0;
if(p.a>80&&p.x>=1)m+=8000;
if(p.a>85&&p.b>80)m+=4000;
if(p.a>90)m+=2000;
if(p.a>85&&p.W=='Y')m+=1000;
if(p.b>80&&p.O=='Y')m+=850;
return m;
}
int main()
{
struct member p[100];
int N,i,m[100],max=0,co;
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%s %d %d %c %c %d",p[i].name,&p[i].a,&p[i].b,&p[i].O,&p[i].W,&p[i].x);
m[i]=money(p[i]);}
for(i=0;i<N;i++)
if(m[i]>max){max=m[i];co=i;}
int sum=0;
for(i=0;i<N;i++)sum+=m[i];
printf("%s\n%d\n%d\n",p[co].name,m[co],sum);
}
|
39
|
19056
|
main()
{
struct scholarship{
char name[200];
int gpa,mate,paper;
char official,west;
}stu[100];
int n,sch[100],i,max;
long sum=0;
char num[4];
for(i=0;i<100;i++){
sch[i]=0;
}
gets(num);
n=atoi(num);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].gpa,&stu[i].mate,&stu[i].official,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++){
if(stu[i].gpa>80&&stu[i].paper>=1){
sch[i]+=8000;
}
if(stu[i].gpa>85&&stu[i].mate>80){
sch[i]+=4000;
}
if(stu[i].gpa>90){
sch[i]+=2000;
}
if(stu[i].gpa>85&&stu[i].west=='Y'){
sch[i]+=1000;
}
if(stu[i].mate>80&&stu[i].official=='Y'){
sch[i]+=850;
}
}
max=0;
for(i=0;i<n;i++){
if(sch[i]>max)
max=sch[i];
}
for(i=0;i<n;i++){
sum+=sch[i];
}
for(i=0;i<n;i++){
if(sch[i]==max)
break;
}
printf("%s\n%d\n%ld\n",stu[i].name,sch[i],sum);
return 0;
}
|
39
|
19057
|
void main ( )
{
int n,i,j;
char name[100][20],c[100],d[100];
int a[100],b[100],e[100],t[100],p=0,tot=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&name[i],&a[i],&b[i],&c[i],&d[i],&e[i]);
for(i=0;i<n;i++)
{
t[i]=0;
if(a[i]>80 && e[i]>0)
t[i]=t[i]+8000;
if(a[i]>85 && b[i]>80)
t[i]=t[i]+4000;
if(a[i]>90)
t[i]=t[i]+2000;
if(a[i]>85 && d[i]==89)
t[i]=t[i]+1000;
if(b[i]>80 && c[i]==89)
t[i]=t[i]+850;
if(t[i]>p)
p=t[i];
tot=tot+t[i];
}
j=0;
while(t[j]<p)
j++;
printf("%s\n",name[j]);
printf("%d\n",p);
printf("%d\n",tot);
}
|
39
|
19058
|
void main()
{
int n;
scanf("%d",&n);
struct student
{
char name[32];
int sco1;
int sco2;
char l;
char w;
int es;
int scho;
};
struct student stu[n];
int i;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].sco1,&stu[i].sco2,&stu[i].l,&stu[i].w,&stu[i].es);
stu[i].scho=0;
if(stu[i].sco1>80&&stu[i].es>0)stu[i].scho+=8000;
if(stu[i].sco1>85&&stu[i].sco2>80)stu[i].scho+=4000;
if(stu[i].sco1>90)stu[i].scho+=2000;
if(stu[i].sco1>85&&stu[i].w=='Y')stu[i].scho+=1000;
if(stu[i].sco2>80&&stu[i].l=='Y')stu[i].scho+=850;
}
int max=stu[0].scho;
for(i=0;i<n;i++)
if(stu[i].scho>max)max=stu[i].scho;
for(i=0;i<n;i++)
if(stu[i].scho==max)
{
printf("%s\n%d\n",stu[i].name,max);
break;
}
int sum=0;
for(i=0;i<n;i++)sum+=stu[i].scho;
printf("%d\n",sum);
}
|
39
|
19059
|
struct m
{ int m1,m2,is,sum;
char n[27],w,a;
}
main()
{ int n,k,s,i,j,m,f1(S),f2(S),f3(S),f4(S),f5(S);
char *t,a[26];
struct m *head,*p1,*p2,*tp,*q;
scanf("%d",&n);
head=(struct m*)calloc(n,L);
for(i=0;i<n;i++)
{ p1=head+i;
scanf("%s%d%d %c %c%d",p1->n,&p1->m1,&p1->m2,&p1->a,&p1->w,&p1->is);
p1->sum=f1(p1)+f2(p1)+f3(p1)+f4(p1)+f5(p1);
}
s=0;
for(m=head->sum,k=0,i=0;i<n;i++)
{ if((head+i)->sum>m){k=i;m=(head+i)->sum;}
s+=(head+i)->sum;
}
printf("%s\n%d\n%d",(head+k)->n,m,s);
}
int f1(S)
{ return 8000*(s->m1>80&&s->is>=1);
}
int f2(S)
{ return 4000*(s->m1>85&&s->m2>80);
}
int f3(S)
{ return 2000*(s->m1>90);
}
int f4(S)
{ return 1000*(s->w=='Y'&&s->m1>85);
}
int f5(S)
{ return 850*(s->a=='Y'&&s->m2>80);
}
|
39
|
19060
|
int main()
{
struct student
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
};
int i,n,count[100]={0};
scanf("%d",&n);
struct student *pp;
pp=(struct student *)malloc(sizeof(student)*n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",(pp+i)->name,&((pp+i)->qimo),&((pp+i)->banji),&((pp+i)->ganbu),&((pp+i)->xibu),&((pp+i)->lunwen));
}
for(i=0;i<n;i++)
{
if((pp[i].qimo>80)&&(pp[i].lunwen>=1))count[i]+=8000;
if((pp[i].qimo>85)&&(pp[i].banji>80))count[i]+=4000;
if(pp[i].qimo>90)count[i]+=2000;
if((pp[i].qimo>85)&&(pp[i].xibu=='Y'))count[i]+=1000;
if((pp[i].banji>80)&&(pp[i].ganbu=='Y'))count[i]+=850;
}
int max=count[0];
int p=0;
int sum=0;
for(i=0;i<n;i++)
{
sum+=count[i];
if(max<count[i])
{
max=count[i];
p=i;
}
}
printf("%s\n%d\n%d\n",(pp+p)->name,max,sum);
return 0;
}
|
39
|
19061
|
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
|
19062
|
struct student
{
char name[20];
int ave;
int cla;
char mon;
char pro;
int essay;
int scholar;
};
struct student st[100];
struct student temp;
int main()
{
int i,N,j,sum=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",st[i].name,&st[i].ave,&st[i].cla,&st[i].mon,&st[i].pro,&st[i].essay);
st[i].scholar=0;
if(st[i].ave>80&&st[i].essay!=0)
st[i].scholar=st[i].scholar+8000;
if(st[i].ave>85&&st[i].cla>80)
st[i].scholar=st[i].scholar+4000;
if(st[i].ave>90)
st[i].scholar=st[i].scholar+2000;
if(st[i].ave>85&&st[i].pro=='Y')
st[i].scholar=st[i].scholar+1000;
if(st[i].cla>80&&st[i].mon=='Y')
st[i].scholar=st[i].scholar+850;
sum=sum+st[i].scholar;
}
for(j=0;j<N-1;j++)
{
if(st[j].scholar>=st[j+1].scholar)
{
temp=st[j];st[j]=st[j+1];st[j+1]=temp;
}
}
printf("%s\n%d\n%d\n",st[N-1].name,st[N-1].scholar,sum);
}
|
39
|
19063
|
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
|
19064
|
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
|
19065
|
void main()
{
int n,i,sum[100],b,total,max;
struct student
{
char name[20];
int score;
int p;
char leader;
char w;
int paper;
}stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].score,&stu[i].p,&stu[i].leader,&stu[i].w,&stu[i].paper);
for(i=0;i<n;i++)
{
sum[i]=0;
if(stu[i].score>80&&stu[i].paper>0)
sum[i]=sum[i]+8000;
if(stu[i].score>85)
{
if(stu[i].p>80)
sum[i]=sum[i]+4000;
if(stu[i].w=='Y')
sum[i]=sum[i]+1000;
}
if(stu[i].score>90)
sum[i]=sum[i]+2000;
if(stu[i].leader=='Y'&&stu[i].p>80)
sum[i]=sum[i]+850;
}
total=sum[0];
max=sum[0];
b=0;
for(i=1;i<n;i++)
{
if(max<sum[i])
{
max=sum[i];
b=i;
}
total=total+sum[i];
}
printf("%s\n%d\n%d",stu[b].name,sum[b],total);
}
|
39
|
19066
|
int yuanshi(int a,int b)
{
if(a>80&&b>=1)
return 8000;
else return 0;
}
int wusi(int a,int b)
{
if(a>85&&b>80)
return 4000;
else return 0;
}
int chengji(int a)
{
if(a>90) return 2000;
else return 0;
}
int xibu(int a,char c)
{
if(a>85&&c=='Y') return 1000;
else return 0;
}
int banji(int b,char d)
{
if(b>80&&d=='Y') return 850;
else return 0;
}
int main()
{
int a[120],b[102],c[120],i,n,qian[102],zong=0,max=0,wei;
char mingzi[102][30],xue[102],xi[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",mingzi[i],&a[i],&b[i],&xue[i],&xi[i],&c[i]);
qian[i]=(yuanshi(a[i],c[i])+wusi(a[i],b[i])+chengji(a[i])+xibu(a[i],xi[i])+banji(b[i],xue[i]));
zong+=qian[i];
if(qian[i]>max) {
max=qian[i];
wei=i;
}
}
printf("%s\n%d\n%d\n",mingzi[wei],qian[wei],zong);
return 0;
}
|
39
|
19067
|
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
|
19068
|
struct student
{
char name[20];
int final;
int classgrade;
char leader;
char west;
int essay;
int total;
};
int main()
{
struct student stu[100];
struct student m;
int n,i,a,b,c,d,e,TOTAL;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].classgrade,&stu[i].leader,&stu[i].west,&stu[i].essay);
}
TOTAL=0;
for(i=0;i<n;i++){
a=0;b=0;c=0;d=0;e=0;
if(stu[i].final>80&&stu[i].essay>=1)
a=8000;
if(stu[i].final>85&&stu[i].classgrade>80)
b=4000;
if(stu[i].final>90)
c=2000;
if(stu[i].final>85&&stu[i].west=='Y')
d=1000;
if(stu[i].classgrade>80&&stu[i].leader=='Y')
e=850;
stu[i].total=a+b+c+d+e;
TOTAL=TOTAL+stu[i].total;
}
for(i=n-1;i>=0;i--){
if(stu[i-1].total<stu[i].total)
{
m=stu[i-1];
stu[i-1]=stu[i];
stu[i]=m;
}
}
printf("%s\n%d\n%d",stu[0].name,stu[0].total,TOTAL);
return 0;
}
|
39
|
19069
|
struct Scholarship
{
char name[20];
int final;
int classmate;
char leader;
char westerner;
int paper;
double sum;
}a[100];
int main()
{
int n;
int i,j;
int count=0;
double max=0,total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].final,&a[i].classmate,&a[i].leader,&a[i].westerner,&a[i].paper);
}
for(i=0;i<n;i++)
{
a[i].sum=0;
if(a[i].final>80 && a[i].paper>=1)
a[i].sum=a[i].sum+8000;
if(a[i].final>85 && a[i].classmate>80)
a[i].sum=a[i].sum+4000;
if(a[i].final>90)
a[i].sum=a[i].sum+2000;
if(a[i].final>85 && a[i].westerner=='Y')
a[i].sum=a[i].sum+1000;
if(a[i].classmate>80 && a[i].leader=='Y')
a[i].sum=a[i].sum+850;
total=total+a[i].sum;
}
for(i=0;i<n;i++)
{
if(a[i].sum>max)
{
max=a[i].sum;
count=i;
}
}
printf("%s\n",a[count].name);
printf("%.0lf\n",a[count].sum);
printf("%.lf\n",total);
return 0;
}
|
39
|
19070
|
int sum=0,N;
struct student
{
char name[20];
int qimo;
int zongping;
char ganbu;
char xibu;
int lunwen;
int total;
struct student *next;
};//????????
void main()
{
struct student *head,*pmax;
struct student *p,*p1,*p2;
int n;
int max=0;
scanf("%d",&N);
/*
p1=p2=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->qimo,&p1->zongping,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->total=0;
p1->next=NULL; //???p1->next???
head=p1;
for(n=0;n<N-1;n++)
{
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->qimo,&p1->zongping,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->total=0;
p1->next=NULL;
p2->next=p1;
}
*/
for(n=0;n<N;n++)
{
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->qimo,&p1->zongping,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->total=0;
p1->next=NULL;
if(n==0) head=p1;
else p2->next=p1;
}
for(max=0,p=pmax=head;p!=NULL;p=p->next)
{
if(p->qimo>80&&p->lunwen>=1) p->total=p->total+8000;
if(p->qimo>85&&p->zongping>80) p->total=p->total+4000;
if(p->qimo>90) p->total=p->total+2000;
if(p->qimo>85&&p->xibu=='Y') p->total=p->total+1000;
if(p->zongping>80&&p->ganbu=='Y') p->total=p->total+850;
sum=sum+p->total;
if(max<p->total)
{
max=p->total;
pmax=p;
}
}
// head=creat();
//pmax=cal(head);
printf("%s\n%d\n%d\n",pmax->name,pmax->total,sum);
}
|
39
|
19071
|
struct student
{
char name[30];
int mark1;
int mark2;
char worker;
char west;
int paper;
int RMB;
}stu[Max];
int main()
{
int n,i=0,j,S=0,b[Max],t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
stu[i].RMB=0;
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].mark1,&stu[i].mark2,&stu[i].worker,&stu[i].west,&stu[i].paper);
if(stu[i].mark1>80&&stu[i].paper!=0)
stu[i].RMB=stu[i].RMB+8000;
if(stu[i].mark1>85&&stu[i].mark2>80)
stu[i].RMB=stu[i].RMB+4000;
if(stu[i].mark1>90)
stu[i].RMB=stu[i].RMB+2000;
if(stu[i].mark2>80&&stu[i].worker=='Y')
stu[i].RMB=stu[i].RMB+850;
if(stu[i].mark1>85&&stu[i].west=='Y')
stu[i].RMB=stu[i].RMB+1000;
b[i]=stu[i].RMB;
}
for(i=0;i<n;i++)
{
S=S+stu[i].RMB;
}
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
{
if(b[j+1]<b[j])
{
t=b[j+1];
b[j+1]=b[j];
b[j]=t;
}
}
for(i=0;i<n;i++)
if(stu[i].RMB==b[n-1]){
printf("%s\n%d\n%d\n",stu[i].name,stu[i].RMB,S);
break;}
return 0;
}
|
39
|
19072
|
void main()
{
int n,i,j,k,t,yuanshi,wusi,chengji,xibu,banji;long sum=0;
struct st{
char name[23];
int score;
int essay;
int pingyi;
char area;
char position;
int money;
} stu[103];
struct st s;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].score,
&stu[i].pingyi,&stu[i].position,&stu[i].area,&stu[i].essay);
for(i=0;i<n;i++)
{
yuanshi=0;
wusi=0;
chengji=0;
xibu=0;
banji=0;
if(stu[i].score>80&&stu[i].essay>0)
yuanshi=8000;
if(stu[i].score>85&&stu[i].pingyi>80)
wusi=4000;
if(stu[i].score>90)
chengji=2000;
if(stu[i].score>85&&stu[i].area=='Y')
xibu=1000;
if(stu[i].pingyi>80&&stu[i].position=='Y')
banji=850;
stu[i].money=yuanshi+wusi+chengji+xibu+banji;
}
for(i=0,sum=0;i<n;i++)
sum=sum+stu[i].money;
for(i=0;i<n;i++)
for(j=0;j<n-i;j++)
if(stu[i].money>stu[j].money)
{
s=stu[i];stu[i]=stu[j];stu[j]=s;
}
printf("%s\n%d\n%ld\n",stu[0].name,stu[0].money,sum);
}
|
39
|
19073
|
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
|
19074
|
int main()
{
struct Student{
char name[50];
int cj,py,lw,sum;
char gb,xb;
}stu[100],temp;
int n,i,sum=0,j,k;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s%d%d %c %c%d",&stu[i].name,&stu[i].cj,&stu[i].py,&stu[i].gb,&stu[i].xb,&stu[i].lw);
}
for (i=0;i<n;i++){
stu[i].sum=0;
if (stu[i].cj>80&&stu[i].lw>=1) stu[i].sum+=8000;
if (stu[i].py>80&&stu[i].gb=='Y') stu[i].sum+=850;
if (stu[i].cj>85&&stu[i].py>80) stu[i].sum+=4000;
if (stu[i].cj>85&&stu[i].xb=='Y') stu[i].sum+=1000;
if (stu[i].cj>90) stu[i].sum+=2000;
}
for (i=0;i<n;i++){
sum+=stu[i].sum;
}
for (i=0;i<n;i++){
for (j=i+1;j<n;j++){
if (stu[j].sum>stu[i].sum){
temp=stu[j];
for (k=j;k>i;k--){
stu[k]=stu[k-1];
}
stu[i]=temp;
}
}
}
printf("%s\n%d\n%d",stu[0].name,stu[0].sum,sum);
return 0;
}
|
39
|
19075
|
int main(int argc, char* argv[])
{
int n,i,j,a,b,e,max1=0,max2=0;
char name[100],NAME[100];
int sum[100];
char c,d;
int s[5];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<5;j++) s[j]=0;
scanf("%s%d%d %c %c%d",name,&a,&b,&c,&d,&e);
if(a>80&&e>=1) s[0]++;
if(a>85&&b>80) s[1]++;
if(a>90) s[2]++;
if(a>85&&d=='Y') s[3]++;
if(b>80&&c=='Y') s[4]++;
sum[i]=8000*s[0]+4000*s[1]+2000*s[2]+1000*s[3]+850*s[4];
if(sum[i]>max1)
{
max1=sum[i];
strcpy(NAME,name);
for(j=0;j<100;j++) name[j]='\0';
}
}
for(i=0;i<n;i++) max2=max2+sum[i];
printf("%s\n%d\n%d\n",NAME,max1,max2);
return 0;
}
|
39
|
19076
|
struct student
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
long int qian;
}stu[100];
void yunsuan(struct student *a)
{
int sum=0;
if(a->qimo >80&&a->lunwen >=1)
sum+=8000;
if(a->qimo >85&&a->banji >80)
sum+=4000;
if(a->qimo >90)
sum+=2000;
if(a->qimo>85 &&a->xibu =='Y')
sum+=1000;
if(a->ganbu =='Y'&&a->banji >80)
sum+=850;
a->qian =sum;
}
int max(struct student *pt,int n)
{
int max=0,i,hz;
for(i=0;i<n;i++)
{
if(pt->qian >max)
{max=pt->qian ;
hz=i;}
pt++;
}
return hz;
}
int main()
{
int n,i,m,sum=0;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %ld", stu[i].name ,&stu[i].qimo, &stu[i].banji ,&stu[i].ganbu ,&stu[i].xibu ,&stu[i].lunwen );
yunsuan(&stu[i]);
sum+=stu[i].qian ;
}
m=max(stu,n);
printf("%s\n%d\n%ld\n", stu[m].name ,stu[m].qian, sum);
return 0;
}
|
39
|
19077
|
void main()
{
int n,qimo[100],banji[100],lunwen[100];
int i,j;int jiangxuejing[100];int sunxu[100];
char xingming[100][20],ganbu[100],xibu[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",xingming[i],&qimo[i],&banji[i],&ganbu[i],&xibu[i],&lunwen[i]);
sunxu[i]=i;
}
for(i=0;i<=n-1;i++)
{
int a=0,b=0,c=0,d=0,e=0;
if(qimo[i]>80&&lunwen[i]>=1)
{a=a+1;}
if(qimo[i]>85&&banji[i]>80)
{b=b+1;}
if(qimo[i]>90)
{c=c+1;}
if(qimo[i]>85&&xibu[i]=='Y')
{d=d+1;}
if(banji[i]>80&&ganbu[i]=='Y')
{e=e+1;}
jiangxuejing[i]=a*8000+b*4000+c*2000+d*1000+e*850;
}
int t,k,p;char c;
for(i=0;i<=n-2;i++)
for(j=0;j<=n-2-i;j++)
{
if(jiangxuejing[j]<jiangxuejing[j+1])
{
t=jiangxuejing[j];
jiangxuejing[j]=jiangxuejing[j+1];
jiangxuejing[j+1]=t;
p=sunxu[j];
sunxu[j]=sunxu[j+1];
sunxu[j+1]=p;
for(k=0;k<=19;k++)
{
c=xingming[j][k];
xingming[j][k]=xingming[j+1][k];
xingming[j+1][k]=c;
}
}
}
int max=0;
for(i=0;i<=n-1;i++)
{
if(jiangxuejing[i]>max)
{max=jiangxuejing[i];}
}
int jishuqi=0;
for(j=0;j<=n-1;j++)
{
if(jiangxuejing[j]==max)
{jishuqi=jishuqi+1;}
}
int m=0;
for(i=0;i<=n-1;i++)
{m=m+jiangxuejing[i];}
if(jishuqi==1)
{
printf("%s\n",xingming[0]);
printf("%d\n",jiangxuejing[0]);
printf("%d\n",m);
}
if(jishuqi>1)
{
for(i=0;i<=jishuqi-2;i++)
for(j=0;j<=jishuqi-2-i;j++)
{
if(sunxu[j]>sunxu[j+1])
{
t=sunxu[j];
sunxu[j]=sunxu[j+1];
sunxu[j+1]=t;
for(k=0;k<=99;k++)
{
c=xingming[j][k];
xingming[j][k]=xingming[j+1][k];
xingming[j+1][k]=c;
}
}
}
printf("%s\n",xingming[0]);
printf("%d\n",jiangxuejing[0]);
printf("%d\n",m);
}
}
|
39
|
19078
|
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
|
19079
|
struct student
{
char name[20];
int grade1;
int grade2;
char gb;
char xb;
int lunwen;
};
struct student stu[100],t;
void main()
{
int n,i,jj[100]={0},maxjj,sum=0,j,k;
char maxname[20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].grade1,&stu[i].grade2,&stu[i].gb,&stu[i].xb,&stu[i].lunwen);
for(i=0;i<n;i++)
{
if(stu[i].grade1>80&&stu[i].lunwen>=1)
jj[i]=jj[i]+8000;
if(stu[i].grade1>85&&stu[i].grade2>80)
jj[i]=jj[i]+4000;
if(stu[i].grade1>90)
jj[i]=jj[i]+2000;
if(stu[i].grade1>85&&stu[i].xb=='Y')
jj[i]=jj[i]+1000;
if(stu[i].grade2>80&&stu[i].gb=='Y')
jj[i]=jj[i]+850;
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1-j;i++)
{
if(jj[i]<jj[i+1])
{
t=stu[i];
stu[i]=stu[i+1];
stu[i+1]=t;
k=jj[i];
jj[i]=jj[i+1];
jj[i+1]=k;
}
}
}
maxjj=jj[0];
strcpy(maxname,stu[0].name);
for(i=0;i<n;i++)
sum=sum+jj[i];
printf("%s\n",maxname);
printf("%d\n",maxjj);
printf("%d\n",sum);
}
|
39
|
19080
|
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
|
19081
|
//?????????
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
|
19082
|
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
|
19083
|
struct student
{
char name[25];
int s1;
int s2;
char yn1;
char yn2;
int t;
int sum;
struct student*next;
};
struct student *creat(int n)
{
struct student *head;
struct student *p1,*p2;
int i;
p1=p2=(struct student *)malloc(sizeof (struct student));
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->yn1,&p1->yn2,&p1->t);
head=NULL;
for(i=0;i<n-1;i++)
{
if(i==0)head=p1;
p1=(struct student*)malloc(sizeof(struct student));
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->yn1,&p1->yn2,&p1->t);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return (head);
}
void print(struct student*head)
{
struct student*p;
p=head;
if(head!=NULL)
do
{
printf("%s %d %d %c %c %d\n",p->name,p->s1,p->s2,p->yn1,p->yn2,p->t);
p=p->next;
}while(p!=NULL);
}
main()
{
int n,i,j,k,t,s,max,r=0;
struct student *p1,*p2,*p3,*p;
struct student g;
scanf("%d",&n);
p=creat(n);
//print(p);
p1=p;p2=p;p3=p;
for(i=0;i<n;i++)
{
p1->sum=0;
if((p1->s1>80)&&(p1->t>=1)) p1->sum=p1->sum+8000;
if((p1->s1>85)&&(p1->s2>80)) p1->sum=p1->sum+4000;
if(p1->s1>90) p1->sum=p1->sum+2000;
if((p1->yn2=='Y')&&(p1->s1>85)) p1->sum=p1->sum+1000;
if((p1->yn1=='Y')&&(p1->s2>80)) p1->sum=p1->sum+850;
p1=p1->next;
}
/* for(i=0,p1=p;i<n;i++)
{
printf("\n%s %d\n",p1->name,p1->sum);
p1=p1->next;
}*/
for(max=0,p1=p,p2=p,i=0;i<n;i++)
{
if(p1->sum>max) {max=p1->sum;p2=p1;}
p1=p1->next;
}
/*for(i=0,p1=p->next,p2=p;i<n;i++)
{
if(p1->sum==max) break;
p2=p2->next;
p1=p1->next;
}*/
for(i=0,p1=p,s=0;i<n;i++)
{
s=s+p1->sum;
p1=p1->next;
}
printf("%s\n%d\n%d\n",p2->name,p2->sum,s);
for(i=0,p1=p;i<n;i++)
{
p=p->next;
free(p1);
p1=p;
}
}
|
39
|
19084
|
int main()
{
int g[101],c[101],e[101],i,m,n,mon[101],max=0,sum=0,j;
char name[101][20],west[101],leader[101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;;j++)
{scanf("%c",&name[i][j]);
if(name[i][j]==' ') break;}
scanf(" %d%d",&g[i],&c[i]);
scanf(" %c %c ",&leader[i],&west[i]);
scanf("%d\n",&e[i]);
mon[i]=0;
if(g[i]>80 && e[i]>=1) mon[i]=mon[i]+8000;
if(g[i]>85 && c[i]>80) mon[i]=mon[i]+4000;
if(g[i]>90) mon[i]=mon[i]+2000;
if(g[i]>85 && west[i]=='Y') mon[i]=mon[i]+1000;
if(c[i]>80 && leader[i]=='Y') mon[i]=mon[i]+850;
}
for(i=0;i<n;i++)
{
if(mon[i]>max) {max=mon[i];m=i;}
sum=sum+mon[i];
}
for(j=0;;j++)
{ if(name[m][j]!=' ')
printf("%c",name[m][j]);
else {printf("\n");break;}
}
printf("%d\n%d",mon[m],sum);
return 0;
}
|
39
|
19085
|
struct student
{
char name[20];
int qm;
int bj;
char gb,xb;
int lw;
int jj;
}stu[100];
int main()
{
char c;
int n,i,j,sum=0;
struct student*pstu=stu,e;
pstu=&stu[0];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].qm,&stu[i].bj,&stu[i].gb,&stu[i].xb,&stu[i].lw);
}
for(i=0;i<n;i++){stu[i].jj=0;
if(stu[i].qm>80&&stu[i].lw>=1){stu[i].jj+=8000;}
if(stu[i].qm>85&&stu[i].bj>80){stu[i].jj+=4000;}
if(stu[i].qm>90){stu[i].jj+=2000;}
if(stu[i].qm>85&&stu[i].xb=='Y'){stu[i].jj+=1000;}
if(stu[i].bj>80&&stu[i].gb=='Y'){stu[i].jj+=850;}
}
for(j=0;j<n;j++){
for(i=0;i<n-j;i++){
if(stu[i].jj<stu[i+1].jj){
e=*(pstu+i);
*(pstu+i)=*(pstu+i+1);
*(pstu+1+i)=e;}
}}
for(i=0;i<n;i++){sum+=stu[i].jj;}
printf("%s\n%d\n%d\n",(pstu)->name,(pstu)->jj,sum);
scanf("%s",c);return 0;
}
|
39
|
19086
|
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
|
19087
|
struct profile
{
char name[20];
int grade; int approval;
char west; char manager;
int paper; int prize;
};
int prizetoget(int gra,int app,char w,char ma,int pa)
{
int initial=0;
if((pa>=1)&&(gra>80)) initial+=Principal;
if((gra>85)&&(app>80)) initial+=Wusi;
if(gra>90) initial+=Highmark;
if((gra>85)&&(w=='Y')) initial+=Western;
if((app>80)&&(ma=='Y')) initial+=Devotion;
return initial;
}
int main()
{
struct profile student[100];
int n,i,most=0,No,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",student[i].name,&student[i].grade,&student[i].approval,&student[i].manager,&student[i].west,&student[i].paper);
student[i].prize=prizetoget(student[i].grade,student[i].approval,student[i].west,student[i].manager,student[i].paper);
sum+=student[i].prize;
}
for(i=0;i<n;i++){
if(student[i].prize>most)
{
most=student[i].prize;
No=i;
}
}
printf("%s\n%d\n%d",student[No].name,most,sum);
return 0;
}
|
39
|
19088
|
int main()
{
int n, qimo[100], banyi[100], lunwen[100];
char name[100][20], xuegan[100], xibu[100];
int sum[100], a, b = 0, i, result = 0;
scanf("%d", &n);
for(i = 0; i < n; i++){
sum[i] = 0;
scanf("%s %d %d %c %c %d", name[i], &qimo[i], &banyi[i], &xuegan[i], &xibu[i], &lunwen[i]);
}
for(i = 0; i < n; i++){
if((qimo[i] > 80)&&(lunwen[i] != 0)){
sum[i] += 8000;
}
if((qimo[i] > 85)&&(banyi[i] > 80)){
sum[i] += 4000;
}
if(qimo[i] > 90){
sum[i] += 2000;
}
if((qimo[i] > 85)&&(xibu[i] == 'Y')){
sum[i] += 1000;
}
if((banyi[i] > 80)&&(xuegan[i] == 'Y')){
sum[i] += 850;
}
}
for(i = 0; i < n; i++){
result += sum[i];
if(sum[i] > b){
b = sum[i];
a = i;
}
}
printf("%s\n%d\n%d\n", name[a], b, result);
return 0;
}
|
39
|
19089
|
int main()
{
struct stu{
char name[35];
int sum;
};
struct stu m[102],temp;
int i,j,k,n;
char a,b;
scanf("%d",&n);
struct stu *p=m;
struct stu *q;
for(;p<m+n;p++)
{
scanf("%s%d%d %c %c%d",(*p).name,&i,&j,&a,&b,&k);
(*p).sum=0;
if(i>80 && k>0)
(*p).sum+=8000;
if(i>85 && j>80)
(*p).sum+=4000;
if(i>90)
(*p).sum+=2000;
if(i>85 && b=='Y')
(*p).sum+=1000;
if(a=='Y' && j>80)
(*p).sum+=850;
}
p=m;
i=0;
i=(*p).sum;
for(q=p+1;q<m+n;q++)
{
i+=(*q).sum;
if((*p).sum < (*q).sum)
{
temp=*p;
*p=*q;
*q=temp;
}
}
printf("%s\n%d\n%d\n",m->name,m->sum,i);
return 0;
}
|
39
|
19090
|
struct st
{
char name[25];
int sc[2];
char leader;
char west;
int paper;
};
void main()
{
struct st s[200];
int n,i,j=0,max=0,sum=0,a[200]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d%d %c %c%d",s[i].name,&s[i].sc[0],&s[i].sc[1],&s[i].leader,&s[i].west,&s[i].paper);
for(i=0;i<n;i++)
{
if(s[i].sc[0]>80&&s[i].paper>0)
a[i]=a[i]+8000;
if(s[i].sc[0]>85&&s[i].sc[1]>80)
a[i]=a[i]+4000;
if(s[i].sc[0]>90)
a[i]=a[i]+2000;
if(s[i].sc[0]>85&&s[i].west=='Y')
a[i]=a[i]+1000;
if(s[i].sc[1]>80&&s[i].leader=='Y')
a[i]=a[i]+850;
}
for(i=0;i<n;i++)
{
j=(a[i]>max)? i:j;
max=(a[i]>max)? a[i]:max;
sum=sum+a[i];
}
printf("%s\n%d\n%d",s[j].name,a[j],sum);
}
|
39
|
19091
|
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
|
19092
|
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
|
19093
|
int main()
{ char name[20],g,x,highestname[20];
int q[100],b[100],l[100],n,i,j,sum[100]={0},max=0,t,total=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",name,&q[i],&b[i],&g,&x,&l[i]);
if((q[i]>80)&&l[i]>=1){
sum[i]+=8000;
}
if(q[i]>85&&b[i]>80){
sum[i]+=4000;
}
if(q[i]>90){
sum[i]+=2000;
}
if(q[i]>85&&x=='Y'){
sum[i]+=1000;
}
if(b[i]>80&&g=='Y'){
sum[i]+=850;
}
total+=sum[i];
if(sum[i]>max){
max=sum[i];
t=i;
for (j=0;name[j]!='\0';j++){
highestname[j]=name[j];
}
highestname[j]='\0';
}
}
printf("%s\n%d\n%d\n",highestname,sum[t],total);
return 0;
}
|
39
|
19094
|
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
|
19095
|
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
|
19096
|
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
|
19097
|
struct student{
char name[20];
int qimo;
int banji;
char leader;
char west;
int essay;
}stu[1000];
struct money{
long p;
int q;
}money[1000];
void main()
{
int n,i,j,max[1000]={0},mmax,k=0;
long sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo ,&stu[i].banji ,&stu[i].leader ,&stu[i].west ,&stu[i].essay);
}
for(i=0;i<n;i++)
{ money[i].p=0;
money[i].q =i;
if(stu[i].qimo >80&&stu[i].essay>=1)
money[i].p=money[i].p+8000;
if(stu[i].qimo >85&&stu[i].banji>80)
money[i].p =money[i].p +4000;
if(stu[i].qimo >90)
money[i].p =money[i].p +2000;
if(stu[i].qimo >85&&stu[i].west=='Y')
money[i].p =money[i].p +1000;
if(stu[i].banji >80&&stu[i].leader=='Y')
money[i].p =money[i].p+850;
}
j=i;
mmax=money[0].p;
for(i=0;i<j;i++)
{
if(mmax<money[i].p)
mmax=money[i].p;
}
for(i=0;i<j;i++)
if(mmax==money[i].p)
{
k=money[i].q;
break;
}
for(i=0;i<n;i++)
sum=sum+money[i].p;
printf("%s\n%ld\n%ld",stu[k].name,money[k].p,sum);
}
|
39
|
19098
|
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
|
19099
|
int main()
{
char name[100][20]={'\0'};
int qimo[100]={0};
int ban[100]={0};
char xue[100]={'\0'};
char xi[100]={'\0'};
int lun[100]={0};
int n;
int sum[100]={0};
int max=0;
char ma[100]={'\0'};
int i,j,k;
int zong=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",name[i],&qimo[i],&ban[i],&xue[i],&xi[i],&lun[i]);
}
for (i=0;i<n;i++)
{
if(qimo[i]>80&&lun[i]>=1) sum[i]=sum[i]+8000;
if (qimo[i]>85&&ban[i]>80) sum[i]=sum[i]+4000;
if (qimo[i]>90) sum[i]=sum[i]+2000;
if (qimo[i]>85&&xi[i]=='Y') sum[i]=sum[i]+1000;
if (ban[i]>80&&xue[i]=='Y') sum[i]=sum[i]+850;
}
for (i=0;i<n;i++)
{
if (max<sum[i])
{
max=sum[i];
strcpy(ma,name[i]);
}
zong=zong+sum[i];
}
printf("%s\n%d\n%d",ma,max,zong);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.