label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
39
|
19100
|
struct list{
char name[30];
int final,ave,article;
char member,west;
long sum;
struct list *next;
};
int n=0;
int num;
long total=0;
char namemax[30];
long max=0;
struct list *creat(int n)
{
struct list *p1,*p2,*head;
int i;
head=(struct list*)malloc(sizeof(struct list));
p1=(struct list*)malloc(sizeof(struct list));
head->next=p1;
p1->next=NULL;
p1->sum=0;
scanf("%s %d %d %c %c %d\n",p1->name,&p1->final,&p1->ave,&p1->member,&p1->west,&p1->article);
if(p1->final>80 && p1->article>=1)p1->sum+=8000;
if(p1->final>85 && p1->ave>80)p1->sum+=4000;
if(p1->final>90)p1->sum+=2000;
if(p1->final>85 && p1->west=='Y')p1->sum+=1000;
if(p1->ave>80 && p1->member=='Y')p1->sum+=850;
total=total+p1->sum;
max=p1->sum;
for(i=1;i<n;i++)
{
p2=p1;
p1=(struct list*)malloc(sizeof(struct list));
scanf("%s %d %d %c %c %d\n",p1->name,&p1->final,&p1->ave,&p1->member,&p1->west,&p1->article);
if(p1->final>80 && p1->article>=1)p1->sum+=8000;
if(p1->final>85 && p1->ave>80)p1->sum+=4000;
if(p1->final>90)p1->sum+=2000;
if(p1->final>85 && p1->west=='Y')p1->sum+=1000;
if(p1->ave>80 && p1->member=='Y')p1->sum+=850;
total=total+p1->sum;
if(p1->sum>max){max=p1->sum;strcpy(namemax,p1->name);}
p2->next=p1;
}
p1->next=NULL;
return head;
}
int main()
{
struct list *head,*p;
scanf("%d\n",&n);
head=creat(n);
printf("%s\n%d\n%d\n",namemax,max,total);
return 0;
}
|
39
|
19101
|
void main()
{
int n,i,j,sum=0;
struct student
{
char name[20];
int a;
int b;
char x;
char g;
int lun;
int money;
}stu[103];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d", stu[i].name, &stu[i].a, &stu[i].b, &stu[i].g, &stu[i].x, &stu[i].lun);
stu[i].money=0;
}
for(i=0;i<n;i++)
{
if(stu[i].a>80&&stu[i].lun>0)
stu[i].money=stu[i].money+8000;
if(stu[i].a>85&&stu[i].b>80)
stu[i].money=stu[i].money+4000;
if(stu[i].a>90)
stu[i].money=stu[i].money+2000;
if(stu[i].a>85&&stu[i].x=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].b>80&&stu[i].g=='Y')
stu[i].money=stu[i].money+850;
sum=sum+stu[i].money;
}
for(j=1;j<n;j++)
{
for(i=0;i<n-j;i++)
{
if(stu[i].money<stu[i+1].money)
{
stu[102]=stu[i];
stu[i]=stu[i+1];
stu[i+1]=stu[102];
}
}
}
printf("%s\n",stu[0].name);
printf("%d\n",stu[0].money);
printf("%d\n",sum);
}
|
39
|
19102
|
struct student
{
char name[21];
int fin;
int cla;
char q1;
char q2;
int pap;
}stu[101];
void main()
{
int n,i;
char namem[21];
int max=0,money[101];
int total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
money[i]=0;
scanf("%s %d %d %c %c %d",
&stu[i].name,&stu[i].fin,&stu[i].cla,&stu[i].q1,&stu[i].q2,&stu[i].pap);
if(stu[i].fin>80&&stu[i].pap>0) money[i]+=8000;
if(stu[i].fin>85&&stu[i].cla>80) money[i]+=4000;
if(stu[i].fin>90) money[i]+=2000;
if(stu[i].fin>85&&stu[i].q2=='Y') money[i]+=1000;
if(stu[i].cla>80&&stu[i].q1=='Y') money[i]+=850;
if(money[i]>money[max]){max=i;}
total+=money[i];
}
printf("%s\n%d\n%d\n",stu[max].name,money[max],total);
}
|
39
|
19103
|
int main()
{
//freopen("tt.in","r",stdin);
//freopen("tt.out","w",stdout);
int i,j,n,k,t,max;
char gan,xi;
int g1,g2,lun,r;
char s[333];
char s1[333];
scanf("%d",&n);
r=0;
max=-999;
for (i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",s,&g1,&g2,&gan,&xi,&lun);
t=0;
if ((g1>80) && (lun>=1)) t+=8000;
if ((g1>85) && (g2>80)) t+=4000;
if (g1>90) t+=2000;
if ((g1>85) &&(xi=='Y')) t+=1000;
if ((g2>80) &&(gan=='Y')) t+=850;
r+=t;
if (t>max)
{
max=t;
strcpy(s1,s);
}
}
puts(s1);
printf("%d\n%d\n",max,r);
return 0;
}
|
39
|
19104
|
int main()
{
struct student
{
char name[20];
int qm;
int py;
char gb[2];
char xb[2];
int lw;
int jxj;
}student[2]={{'\0',0,0,'\0','\0',0,0},{'\0',0,0,'\0','\0',0,0}};
struct student temp={'\0',0,0,'\0','\0',0,0};
int i,n,sum;
scanf("%d",&n);
sum=0;
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",student[1].name,&student[1].qm,&student[1].py,student[1].gb,student[1].xb,&student[1].lw);
if(student[1].py>80&&strcmp(student[1].gb,"Y")==0)
{
student[1].jxj=student[1].jxj+850;
}
if(student[1].qm>80&&student[1].lw>=1)
{
student[1].jxj=student[1].jxj+8000;
}
if(student[1].qm>85&&student[1].py>80)
{
student[1].jxj=student[1].jxj+4000;
}
if(student[1].qm>90)
{
student[1].jxj=student[1].jxj+2000;
}
if(student[1].qm>85&&strcmp(student[1].xb,"Y")==0)
{
student[1].jxj=student[1].jxj+1000;
}
sum=sum+student[1].jxj;
if(student[1].jxj>student[0].jxj)
{
temp=student[1];
student[1]=student[0];
student[0]=temp;
}
student[1].jxj=0;
}
printf("%s\n%d\n%d\n",student[0].name,student[0].jxj,sum);
}
|
39
|
19105
|
int yuan(int p,int q)
{
int z=0;
if(p>80&&q>=1) z=1;
return z;
}
int wusi(int p,int q)
{
int z=0;
if(p>85&&q>80) z=1;
return z;
}
int youxiu(int p)
{
int z=0;
if(p>90) z=1;
return z;
}
int xibu(int p,char ip)
{
int z=0;
if(p>85&&ip=='Y') z=1;
return z;
}
int banji(int p,char ip)
{int z=0;
if(p>80&&ip=='Y') z=1;
return z;
}
void main()
{
struct student
{
char name[20];
int gpa;
int arg;
char leader;
char xibu;
int paper;
int sum;
}*s;
int i,n,a,b,c,d,e,sum=0;
scanf("%d",&n);
s=(struct student*)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&s[i].name,&(*(s+i)).gpa,&(*(s+i)).arg,&(*(s+i)).leader,&(*(s+i)).xibu,&(*(s+i)).paper);
(*(s+i)).sum=0;
a=yuan((*(s+i)).gpa,(*(s+i)).paper);
b=wusi((*(s+i)).gpa,(*(s+i)).arg);
c=youxiu((*(s+i)).gpa);
d=xibu((*(s+i)).gpa,(*(s+i)).xibu);
e=banji((*(s+i)).arg,(*(s+i)).leader);
(*(s+i)).sum=8000*a+4000*b+2000*c+1000*d+850*e;
sum=sum+(*(s+i)).sum;
}
for(i=1;i<n;i++)
{
if((*(s+0)).sum<(*(s+i)).sum)
(*(s+0))=(*(s+i));
}
printf("%s\n%d\n%d",s[0].name,(*(s+0)).sum,sum);
}
|
39
|
19106
|
int main()
{
struct student
{
char name[20];
int final;
int com;
char offi;
char west;
int arc;
};
struct student stu[200];
struct student chan;
int i,n;
int total[200]={0},all=0;
int a,b,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].com,&stu[i].offi,&stu[i].west,&stu[i].arc);
}
for(i=0;i<n;i++)
{
if((stu[i].final>80)&&(stu[i].arc>0))
total[i]=total[i]+8000;
if((stu[i].final>85)&&(stu[i].com>80))
total[i]=total[i]+4000;
if(stu[i].final>90)
total[i]=total[i]+2000;
if((stu[i].final>85)&&(stu[i].west==89))
total[i]=total[i]+1000;
if((stu[i].com>80)&&(stu[i].offi==89))
total[i]=total[i]+850;
}
for(a=0;a<n-1;a++)
{
for(b=0;b<n-1-a;b++)
{
if(total[b]<total[b+1])
{
temp=total[b];
total[b]=total[b+1];
total[b+1]=temp;
chan=stu[b];
stu[b]=stu[b+1];
stu[b+1]=chan;
}
}
}
for(i=0;i<n;i++)
all=all+total[i];
printf("%s\n%d\n%d\n",stu[0].name,total[0],all);
return 0;
}
|
39
|
19107
|
struct student{
char name[20];
int t1;
int t2;
char gan;
char west;
int wen;
int sum;
};
void main()
{
int n,i,j,whole=0;
struct student stu[100];
struct student temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c %d",stu[i].name,&stu[i].t1,&stu[i].t2,&stu[i].gan,&stu[i].west,&stu[i].wen);
stu[i].sum=0;
if(stu[i].t1>80&&stu[i].wen>=1)
stu[i].sum=stu[i].sum+8000;
if(stu[i].t1>85&&stu[i].t2>80)
stu[i].sum=stu[i].sum+4000;
if(stu[i].t1>90)
stu[i].sum=stu[i].sum+2000;
if(stu[i].t1>85&&stu[i].west=='Y')
stu[i].sum=stu[i].sum+1000;
if(stu[i].t2>80&&stu[i].gan=='Y')
stu[i].sum=stu[i].sum+850;
}
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
{
if(stu[i].sum<stu[i+1].sum)
{
temp=stu[i];
stu[i]=stu[i+1];
stu[i+1]=temp;
}
}
for(i=0;i<n;i++)
whole=whole+stu[i].sum;
printf("%s\n%d\n%d",stu[0].name,stu[0].sum,whole);
}
|
39
|
19108
|
int main()
{
int n,i,summoney=0;
scanf("%d",&n);
struct data{
char name[50];
int grade,classgrade,papers;
char monitor,west;
int money;
}*number;
number=(struct data *)malloc(sizeof(data)*n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",number[i].name,&number[i].grade,&number[i].classgrade,&number[i].monitor,&number[i].west,&number[i].papers);
number[i].money=0;
if (number[i].grade>80&&number[i].papers>=1)number[i].money+=8000;
if (number[i].grade>85&&number[i].classgrade>80)number[i].money+=4000;
if (number[i].grade>90)number[i].money+=2000;
if (number[i].grade>85&&number[i].west=='Y')number[i].money+=1000;
if (number[i].classgrade>80&&number[i].monitor=='Y')number[i].money+=850;
summoney+=number[i].money;
}
int a,k;
a=number[n-1].money;
k=0;
for (i=n-1;i>0;i--)
{
if (a>number[i-1].money)a=a;
else
{
a=number[i-1].money;
k=i-1;
}
}
printf("%s\n%d\n%d\n",number[k].name,number[k].money,summoney);
return 0;
}
|
39
|
19109
|
struct student
{
char name[100];
int n1;
int n2;
char a;
char b;
int n3;
};
void main()
{
int N,i,j,s[101][6],max,k=0;
long int sum=0;
scanf("%d\n",&N);
struct student stu[101];
struct student *p;
for(p=stu;p<stu+N;p++)
{scanf("%s %d %d %c %c %d",p->name,&p->n1,&p->n2,&p->a,&p->b,&p->n3);}
for(i=0;i<N;i++)
for(j=0;j<6;j++)
{s[i][j]=0;}
for(i=0;i<N;i++)
{
if(stu[i].n1>80&&stu[i].n3>=1)
s[i][0]=8000;
if(stu[i].n1>85&&stu[i].n2>80)
s[i][1]=4000;
if(stu[i].n1>90)
s[i][2]=2000;
if(stu[i].n1>85&&stu[i].b=='Y')
s[i][3]=1000;
if(stu[i].n2>80&&stu[i].a=='Y')
s[i][4]=850;
}
for(i=0;i<N;i++)
for(j=4;j>=0;j--)
{s[i][5]=s[i][5]+s[i][j];}
max=s[0][5];
for(i=0;i<N;i++)
if(s[i][5]>max)
{max=s[i][5];k=i;}
printf("%s\n%d\n",stu[k].name,s[k][5]);
for(i=0;i<N;i++)
sum=sum+s[i][5];
printf("%ld\n",sum);
}
|
39
|
19110
|
void main()
{
char name[100][20],ganbu[100],xibu[100];
int qimo[100],banji[100],lunwen[100],i,n,sum[100]={0},flag=0,max=0,total=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",name[i],&qimo[i],&banji[i],&ganbu[i],&xibu[i],&lunwen[i]);
}
for (i=0;i<n;i++)
{
if (qimo[i]>80&&lunwen[i]>=1) sum[i]+=8000;
if (qimo[i]>85&&banji[i]>80) sum[i]+=4000;
if (qimo[i]>90) sum[i]+=2000;
if (qimo[i]>85&&xibu[i]=='Y') sum[i]+=1000;
if (banji[i]>80&&ganbu[i]=='Y') sum[i]+=850;
}
for (i=0;i<n;i++)
{
if (max<sum[i])
{
max=sum[i];
flag=i;
}
total=total+sum[i];
}
printf("%s\n%d\n%d\n",name[flag],sum[flag],total);
}
|
39
|
19111
|
struct student{
char name[20];
int num[6];
char xx[3];
int sum;
}stu[1000];
char cc[10];
int main(){
int t,k,x[10000]={0},n,min=10000,max=0,min1=0,max1=0,a=0,b,c,d,i,j,tp,sum1=0;
scanf("%d",&n);
scanf("%c",&cc[1]);
for(i=1;i<=n;i++){
scanf("%s%c%d%c%d",stu[i].name,&cc[1],&stu[i].num[1],&cc[2],&stu[i].num[2]);
scanf("%c%c%c%c%c%d%c",&cc[1],&stu[i].xx[1],&cc[2],&stu[i].xx[2],&cc[3],&stu[i].num[3],&cc[6]);
stu[i].sum=0;
if(stu[i].num[1]>80&&stu[i].num[3]>=1)stu[i].sum+=8000;
if(stu[i].num[1]>85&&stu[i].num[2]>80)stu[i].sum+=4000;
if(stu[i].num[1]>90)stu[i].sum+=2000;
if(stu[i].num[1]>85&&stu[i].xx[2]=='Y')stu[i].sum+=1000;
if(stu[i].num[2]>80&&stu[i].xx[1]=='Y')stu[i].sum+=850;
sum1+=stu[i].sum;
if(stu[i].sum>max){
max=stu[i].sum;
max1=i;
}
}
printf("%s\n%d\n%d",stu[max1].name,stu[max1].sum,sum1);
}
|
39
|
19112
|
struct p
{
char name[100],leader,xibu;
int fen,ban,lun;
int scho;
}stu[100];
void main()
{
int i,j,k,l,m=0,n;
scanf ("%d\n",&n);
for (i=0;i<n;i++)
{
scanf ("%s %d %d %c %c %d",stu[i].name,&stu[i].fen,&stu[i].ban,&stu[i].leader,&stu[i].xibu,&stu[i].lun);
}
for (i=0;i<n;i++)
{
if (stu[i].lun>=1&&stu[i].fen>80)
{
stu[i].scho=stu[i].scho+8000;
}
if (stu[i].fen>85&&stu[i].ban>80)
{
stu[i].scho=stu[i].scho+4000;
}
if (stu[i].fen>90)
{
stu[i].scho=stu[i].scho+2000;
}
if (stu[i].fen>85&&stu[i].xibu=='Y')
{
stu[i].scho=stu[i].scho+1000;
}
if (stu[i].ban>80&&stu[i].leader=='Y')
{
stu[i].scho=stu[i].scho+850;
}
}
for (i=0;i<n;i++)
{
m=m+stu[i].scho;
}
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
{
if (stu[i].scho<stu[j].scho)
break;
}
if (j==n)
{
printf ("%s\n%d\n%d",stu[i].name,stu[i].scho,m);
break;
}
}
}
|
39
|
19113
|
char ansn[80],nm[80];
int ansm=0,summ=0;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int a,b,e;char c,d;
cin>>nm>>a>>b>>c>>d>>e;
int s=0;
if((a>80)&&(e))s+=8000;
if((a>85)&&(b>80))s+=4000;
if(a>90)s+=2000;
if((a>85)&&(d=='Y'))s+=1000;
if((b>80)&&(c=='Y'))s+=850;
if(s>ansm){
memcpy(&ansn,&nm,sizeof(nm));
ansm=s;
}
summ+=s;
}
cout<<ansn<<endl<<ansm<<endl<<summ<<endl;
return 0;
}
|
39
|
19114
|
int main()
{
struct student{
char name[20];
int a;
int b;
char s;
char x;
int e;
}stu[100];
int n,m[100]={0},max,total,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d%d %c %c %d",stu[i].name,&stu[i].a,&stu[i].b,&stu[i].s,&stu[i].x,&stu[i].e);
for(i=0;i<n;i++)
{
if(stu[i].a>80&&stu[i].e>=1) m[i]+=8000;
if(stu[i].a>85&&stu[i].b>80) m[i]+=4000;
if(stu[i].a>90) m[i]+=2000;
if(stu[i].a>85&&stu[i].x=='Y') m[i]+=1000;
if(stu[i].b>80&&stu[i].s=='Y') m[i]+=850;
}
max=0;
total=m[0];
for(i=1;i<n;i++)
{
if(m[i]>m[max])
{
max=i;
}
total+=m[i];
}
printf("%s\n%d\n%d\n",stu[max].name,m[max],total);
return 0;
}
|
39
|
19115
|
struct student
{
char name[200];
int score1;
int score2;
char c1;
char c2;
int paper;
int money;
}a[100];
int main()
{
int N,i,maxmoney=0,maxnum=0,summoney=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",&a[i].name,&a[i].score1,&a[i].score2,&a[i].c1,&a[i].c2,&a[i].paper);
if(a[i].score1>80&&a[i].paper>0)
{
a[i].money+=8000;
}
if(a[i].score1>85&&a[i].score2>80)
{
a[i].money+=4000;
}
if(a[i].score1>90)
{
a[i].money+=2000;
}
if(a[i].score1>85&&a[i].c2=='Y')
{
a[i].money+=1000;
}
if(a[i].score2>80&&a[i].c1=='Y')
{
a[i].money+=850;
}
}
for(i=0;i<N;i++)
{
if(a[i].money>maxmoney)
{
maxmoney=a[i].money;
maxnum=i;
}
summoney+=a[i].money;
}
printf("%s\n%d\n%d",a[maxnum].name,maxmoney,summoney);
}
|
39
|
19116
|
struct student
{
char name[20];
int s1;
int s2;
char c;
char w;
int paper;
int m;
struct student *next;
};
void main()
{
int N,n,total=0,r,max;
int a[108][6];
scanf("%d",&N);
struct student *p1,*p2,*head,*p,*pp;
p1=p2=(struct student*)malloc(LEN);
n=0;
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->c,&p1->w,&p1->paper);
n=n+1;
while(n<N)
{
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->s1,&p1->s2,&p1->c,&p1->w,&p1->paper);
n=n+1;}
p2->next=p1;
p1->next=NULL;
p=head;
r=0;
while(r<N)
{
(p->m)=8000*((p->s1)>80&&(p->paper>0))+4000*((p->s1)>85&&(p->s2)>80)+2000*((p->s1)>90)+1000*((p->s1)>85&&(p->w=='Y'))+850*((p->s2)>80&&(p->c=='Y'));
total=total+(p->m);
r++;p=p->next;
}
r=0;
int i,j=0;
p=head;
max=p->m;
while(r<N)
{
if((p->m)>max)
{
max=(p->m);
j=r;
}
r++;
p=p->next;
}
i=0;
pp=head;
while(i<j)
{
pp=pp->next;
i++;
}
printf("%s\n%d\n%d\n",pp->name,max,total);
}
|
39
|
19117
|
int main()
{
int n,i;
int p[100]={0};
int sum=0;
struct{
char name[20];
int exscore;
int clscore;
char ganbu;
char west;
int lunwen;
}st[100];
int max=p[0],k;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",st[i].name,&st[i].exscore,&st[i].clscore,&st[i].ganbu,&st[i].west,&st[i].lunwen);
if(st[i].exscore>80 && st[i].lunwen>=1) p[i]+=8000;
if(st[i].exscore>85 && st[i].clscore>80) p[i]+=4000;
if(st[i].exscore>90 ) p[i]+=2000;
if(st[i].exscore>85 && st[i].west=='Y') p[i]+=1000;
if(st[i].clscore>80 && st[i].ganbu=='Y') p[i]+=850;
sum+=p[i];
if(p[i]>max)
{
max=p[i];
k=i;
}
}
printf("%s\n",st[k].name);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
|
39
|
19118
|
struct student
{
char name[20];
int score;
int ping;
char gan;
char xi;
int lun;
int jiang;
}stu[100];
void main()
{
int n,i,t,h=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].score,
&stu[i].ping,&stu[i].gan,&stu[i].xi,&stu[i].lun);
stu[i].jiang=0;
if(stu[i].score>80&&stu[i].lun>0)
stu[i].jiang+=8000;
if(stu[i].score>85&&stu[i].ping>80)
stu[i].jiang+=4000;
if(stu[i].score>90)
stu[i].jiang+=2000;
if(stu[i].score>85&&stu[i].xi=='Y')
stu[i].jiang+=1000;
if(stu[i].ping>80&&stu[i].gan=='Y')
stu[i].jiang+=850;
}
for(i=0,t=stu[0].jiang;i<n-1;i++)
{
h=h+stu[i].jiang;
if(stu[i+1].jiang>t)
t=stu[i+1].jiang;
}
for(i=0;i<n;i++)
if(stu[i].jiang==t)
{
printf("%s\n%d\n%d",stu[i].name,t,h+stu[n-1].jiang);
break;
}
}
|
39
|
19119
|
void main()
{
struct student
{
char name[20];
int final;
int classes;
char duty;
char west;
int text;
};
struct student stu[100];
int n,i,t;
scanf("%d",&n);
int num[100]={0},all=0,a[100];
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].classes,&stu[i].duty,&stu[i].west,&stu[i].text);
for(i=0;i<n;i++)
{
if(stu[i].text>0&&stu[i].final>80)
num[i]=num[i]+8000;
if(stu[i].classes>80&&stu[i].final>85)
num[i]=num[i]+4000;
if(stu[i].final>90)
num[i]=num[i]+2000;
if(stu[i].west=='Y'&&stu[i].final>85)
num[i]=num[i]+1000;
if(stu[i].classes>80&&stu[i].duty=='Y')
num[i]=num[i]+850;
}
for(i=0;i<n;i++)
{
a[i]=num[i];
all=all+num[i];
}
for(i=0;i<n-1;i++)
{
if(a[i]>a[i+1])
a[i+1]=a[i];
}
for(i=0;i<n;i++)
{
if(num[i]==a[n-1])
{t=i;
break;}
}
printf("%s\n%d\n%d\n",stu[t].name,num[t],all);
}
|
39
|
19120
|
int main()
{
struct stu
{
char name[20];
int a;
int b;
char c[1];
char d[1];
int e;
int m;
}s[100];
int n,i,max=0,t,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %s %s %d\n",s[i].name,&s[i].a,&s[i].b,s[i].c,s[i].d,&s[i].e);
for(i=0;i<n;i++)
s[i].m=0;
for(i=0;i<n;i++)
{
if(((s[i].a)>80)&&((s[i].e)>0))
s[i].m+=8000;
if(((s[i].a)>85)&&((s[i].b)>80))
s[i].m+=4000;
if((s[i].a)>90)
s[i].m+=2000;
if(((s[i].a)>85)&&((s[i].d[0])=='A'+24))
s[i].m+=1000;
if(((s[i].b)>80)&&((s[i].c[0])=='A'+24))
s[i].m+=850;
}
for(i=0;i<n;i++)
{
if(s[i].m>max)
{
max=s[i].m;
t=i;
}
}
for(i=0;i<n;i++)
sum+=s[i].m;
printf("%s\n",s[t].name);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
|
39
|
19121
|
struct qian{
char a[20];
int b[1];
int c[1];
char d[2];
char e[2];
int f[1];
}stu[101];
void main()
{
int exin(int A,int B,char C,char D,int E);
int n;int x,y=0;int total=0;
int i;
int sum[101]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%c%c%c%c%d",stu[i].a,&stu[i].b[0],&stu[i].c[0],&stu[i].d[0],&stu[i].d[1],&stu[i].e[0],&stu[i].e[1],&stu[i].f[0]);
}
for(i=0;i<n;i++)
{
sum[i]=exin(stu[i].b[0],stu[i].c[0],stu[i].d[1],stu[i].e[1],stu[i].f[0]);
}
for(i=0;i<n;i++)
{
total=total+sum[i];
}
x=sum[0];
for(i=1;i<n;i++)
{
if(sum[i]>x)
{
x=sum[i];
y=i;
}
}
printf("%s\n",stu[y].a);
printf("%d\n%d",x,total);
}
int exin(int A,int B,char C,char D,int E)
{
int k=0;
if(A>80&&E>=1)k=k+8000;
if(A>85&&B>80)k=k+4000;
if(A>90)k=k+2000;
if(A>85&&D=='Y')k=k+1000;
if(B>80&&C=='Y')k=k+850;
return(k);
}
|
39
|
19122
|
void main()
{
struct stu
{
char s[50],c,d;
int a,b,e,m;
}stu[500];
int n,i,max=0,all=0,j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
stu[i].m=0;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].s,&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>0)
stu[i].m=stu[i].m+8000;
if(stu[i].a>85 && stu[i].b>80)
stu[i].m=stu[i].m+4000;
if(stu[i].a>90)
stu[i].m=stu[i].m+2000;
if(stu[i].a>85 && stu[i].d=='Y')
stu[i].m=stu[i].m+1000;
if(stu[i].b>80 && stu[i].c=='Y')
stu[i].m=stu[i].m+850;
}
for(i=0;i<n;i++)
{
all=all+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",stu[i].s,stu[i].m);
max=-1;
}
}
printf("%d\n",all);
}
|
39
|
19123
|
struct bac
{
char name[20];
int num1;
int num2;
char ganbu;
char west;
char paper;
int money;
};
int main()
{
struct bac stu[101];
struct bac temp;
int i,j,n,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
stu[i].money=0;
scanf("%s",&stu[i].name);
scanf("%d",&stu[i].num1);
scanf("%d",&stu[i].num2);
getchar();
scanf("%c",&stu[i].ganbu);
getchar();
scanf("%c",&stu[i].west);
getchar();
scanf("%d",&stu[i].paper);
}
for(i=0;i<n;i++){
if(stu[i].num1>80&&stu[i].paper>=1){stu[i].money=stu[i].money+8000;}
if(stu[i].num1>85&&stu[i].num2>80){stu[i].money=stu[i].money+4000;}
if(stu[i].num1>90){stu[i].money=stu[i].money+2000;}
if(stu[i].num1>85&&stu[i].west=='Y'){stu[i].money=stu[i].money+1000;}
if(stu[i].num2>80&&stu[i].ganbu=='Y'){stu[i].money=stu[i].money+850;}
}
for(i=0;i<n-1;i++){
for (j=0;j<n-1-i;j++){
if(stu[j].money<stu[j+1].money){
temp=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp;
}
}
}
for(i=0;i<n;i++)
sum=sum+stu[i].money;
printf("%s\n%d\n",stu[0].name,stu[0].money);
printf("%d",sum);
return 0;
}
|
39
|
19124
|
struct student{
char name[20];
int f_gra;
int c_gra;
char ganbu;
char xibu;
int paper;
}stu[100];
int main(int argc, char* argv[])
{
int i,n,sum=0;
scanf("%d",&n);
int *scho=(int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].f_gra,&stu[i].c_gra,&stu[i].ganbu,&stu[i].xibu,&stu[i].paper);
scho[i]=0;
}
for(i=0;i<n;i++){
if(stu[i].f_gra>80&&stu[i].paper>0){
scho[i]=scho[i]+8000;
sum=sum+8000;
}
if(stu[i].f_gra>85&&stu[i].c_gra>80){
scho[i]=scho[i]+4000;
sum=sum+4000;
}
if(stu[i].f_gra>90){
scho[i]=scho[i]+2000;
sum=sum+2000;
}
if(stu[i].f_gra>85&&stu[i].xibu=='Y'){
scho[i]=scho[i]+1000;
sum=sum+1000;
}
if(stu[i].c_gra>80&&stu[i].ganbu=='Y'){
scho[i]=scho[i]+850;
sum=sum+850;
}
}
int max=scho[0],goal;
for(i=0;i<n;i++){
if(scho[i]>max){
max=scho[i];
goal=i;
}
}
printf("%s\n%d\n%d\n",stu[goal].name,max,sum);
free(scho);
return 0;
}
|
39
|
19125
|
struct info{
char name[20];
int qm;
int py;
char gb;
char xb;
int lw;
int money;
}student[120];
int ysj( int a )
{
if ( student[a].qm > 80 && student[a].lw >= 1 )
return 8000;
else
return 0;
}
int wsj( int a )
{
if ( student[a].qm > 85 && student[a].py > 80 )
return 4000;
else
return 0;
}
int cjj( int a )
{
if ( student[a].qm > 90 )
return 2000;
else
return 0;
}
int xbj( int a )
{
if ( student[a].qm > 85 && student[a].xb == 'Y')
return 1000;
else
return 0;
}
int bjj( int a )
{
if ( student[a].py > 80 && student[a].gb == 'Y')
return 850;
else
return 0;
}
int main()
{
int n,k;
int max = 0;
int sum = 0;
char ch1,ch2;
scanf("%d",&n);
if ( n >=0 )
for ( int i=0; i<n; i++ )
{
scanf("%c",&ch1);
scanf("%s%d%d%c%c%c%c%d",student[i].name,&student[i].qm,&student[i].py,&ch1,&student[i].gb,&ch2,&student[i].xb,&student[i].lw);
student[i].money = ysj(i) + wsj(i) + cjj(i) + xbj(i) + bjj(i);
sum += student[i].money;
if ( student[i].money > max )
{
max = student[i].money;
k = i;
}
}
printf("%s\n%d\n%d\n",student[k].name,max,sum);
return 0;
}
|
39
|
19126
|
int main()
{struct ship
{
char name[20],o,w;
int score,cla,paper,totle;
struct ship *next;
}n[100];
int T=0,N,i,m=0;char temp[20];
struct ship *head=&n[0],*p;
scanf("%d",&N);
for(i=0;i<N;i++)//????//
scanf("%s %d %d %c %c %d",n[i].name,&n[i].score,&n[i].cla,&n[i].o,&n[i].w,&n[i].paper);
for(i=0;i<N-1;i++)
n[i].next=&n[i+1];
n[N-1].next=NULL;
for(i=0;i<N;i++) //scholarship for everyone//
{n[i].totle=0;
if(n[i].cla>80&&n[i].o=='Y') n[i].totle+=850;
if(n[i].score>85&&n[i].w=='Y') n[i].totle+=1000;
if(n[i].score>90) n[i].totle+=2000;
if(n[i].score>85&&n[i].cla>80) n[i].totle+=4000;
if(n[i].score>80&&n[i].paper) n[i].totle+=8000;}
for(i=0;i<N;i++) //sort the scholarships ; incresing//
if(n[m].totle<n[i].totle) m=i;
p=head;
do{
T+=p->totle;
p=p->next;} //T is the entire scholarship//
while(p!=NULL);
printf("%s\n%d\n%d",n[m].name,n[m].totle,T);
return 0;
}
|
39
|
19127
|
int main()
{
char name[100][20],g[2]={'Y','N'},x[2]={'Y','N'},gg,xx;
int n,score, pscore, article,b,num[100],i,maxnum,sum=0;
scanf("%d", &n);
for(i=0;i<n;i++){
num[i]=0;
scanf("%s", name[i]);
scanf(" %d %d", &score,&pscore);
scanf(" %c %c", &gg,&xx);
scanf(" %d", &article);
if(score>80&&article>=1){
num[i]+=8000;
}
if(score>85&&pscore>80){
num[i]+=4000;
}
if(score>90){
num[i]+=2000;
}
if(score>85&&xx==x[0]){
num[i]+=1000;
}
if(pscore>80&&gg==g[0]){
num[i]+=850;
}
sum+=num[i];
}
b=0;
maxnum=num[0];
for(i=1;i<n;i++){
if(num[i]>maxnum){
maxnum=num[i];
b=i;
}
}
printf("%s\n%d\n%d\n", name[b],maxnum,sum);
return 0;
}
|
39
|
19128
|
struct student
{char name[30];
int qimo;
int banji;
char gb;
char xb;
int lw;
};
int k=0;
void main()
{
int money(struct student a);
int cmp(int a[],int n);
int n,i,b[200]={0},m;
long q=0;
struct student a[105];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].qimo,&a[i].banji,&a[i].gb,&a[i].xb,&a[i].lw);
b[i]=money(a[i]);q=q+b[i];
}
m =cmp(b,n);
printf("%s\n",a[k].name);
printf("%d\n",m);
printf("%ld",q);
}
int money(struct student a)
{
int sum=0;
if(a.qimo>80 && a.lw>=1)sum=8000;
if(a.banji>80 && a.qimo>85)sum=sum+4000;
if(a.qimo>90)sum=sum+2000;
if(a.qimo>85 && a.xb=='Y')sum=sum+1000;
if(a.banji>80 && a.gb=='Y')sum=sum+850;
return sum;
}
int cmp(int a[],int n)
{
int max=a[0],i;
for(i=0;i<n-1;i++)
if(max<a[i+1]){max=a[i+1];k=i+1;}
return max;
}
|
39
|
19129
|
struct person
{
char n[20];
int q;
int p;
char g;
char x;
int lun;
};
int jiang(struct person a)
{
int j=0;
if(a.q>80&&a.lun>0)
{
j=j+8000;
}
if (a.q>85&&a.p>80)
{
j=j+4000;
}
if(a.q>90)
{
j=j+2000;
}
if (a.q>85&&a.x=='Y')
{
j=j+1000;
}
if(a.p>80&&a.g=='Y')
{
j=j+850;
}
return(j);
}
void main()
{
int n,i,j,r;
double sum=0;
int a[100];
struct person p[100];
scanf("%d",&n);
for (i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",p[i].n,&p[i].q,&p[i].p,&p[i].g,&p[i].x,&p[i].lun);
a[i]=jiang(p[i]);
sum=sum+a[i];
}
for (i=0;i<=n-1;i++)
{
r=0;
for (j=0;j<=n-1;j++)
{
if (a[j]>a[i])
{
r=1;
}
}
if (r==0)
{
printf("%s\n%d\n%.0lf",p[i].n,a[i],sum);
break;
}
}
}
|
39
|
19130
|
typedef struct{
char name[30],sit1,sit2;
int a,b,num;
long totle;
}info;
void main()
{
int count,max=0,k,i;
long totle=0;
info str[100];
scanf("%d",&count);
for(i=0;i<count;i++)
{
scanf("%s %d %d %c %c %d",str[i].name,&str[i].a,&str[i].b,&str[i].sit1,&str[i].sit2,&str[i].num);
str[i].totle=0;
if(str[i].a>80&&str[i].num!=0)
{str[i].totle+=8000;}
if(str[i].a>85&&str[i].b>80)
{str[i].totle+=4000;}
if(str[i].a>90)
{str[i].totle+=2000;}
if(str[i].a>85&&str[i].sit2=='Y')
{str[i].totle+=1000;}
if(str[i].b>80&&str[i].sit1=='Y')
{str[i].totle+=850;}
}
for(i=0;i<count;i++)
{
totle+=str[i].totle;
if(str[i].totle>max)
{
max=str[i].totle;
k=i;
}
}
printf("%s\n%d\n%ld\n",str[k].name,str[k].totle,totle);
}
|
39
|
19131
|
struct student{
char name[25];
int qimo;
int banji;
char ganbu[2];
char xibu[2];
int lunwen;
int money;
}stu[102]={0};
struct student temp;
void main()
{
int i,j,n,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d%s%s%d",&stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
if(stu[i].qimo>80&&stu[i].lunwen>=1)
stu[i].money=stu[i].money+8000;
if(stu[i].qimo>85&&stu[i].banji>80)
stu[i].money=stu[i].money+4000;
if(stu[i].qimo>90)
stu[i].money=stu[i].money+2000;
if(stu[i].qimo>85&&stu[i].xibu[0]=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].banji>80&&stu[i].ganbu[0]=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0;i<n;i++)
sum=sum+stu[i].money;
for(i=1;i<n;i++){
for(j=0;j<n-i;j++){
if(stu[j].money<stu[j+1].money){
temp=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp;
}
}
}
printf("%s\n%d\n%d\n",stu[0].name,stu[0].money,sum);
}
|
39
|
19132
|
int main()
{
long sum=0,s,max=0;
int n,i,a,b,e;
char nm[20],nm0[20],c[2],d[2];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%d%d%s%s%d",nm,&a,&b,c,d,&e);
s=0;
if(a>80&&e)s+=8000;
if(a>85&&b>80)s+=4000;
if(a>90)s+=2000;
if(a>85&&d[0]=='Y')s+=1000;
if(b>80&&c[0]=='Y')s+=850;
sum+=s;
if(s>max)
{
strcpy(nm0,nm);
max=s;
}
}
printf("%s\n%d\n%d\n",nm0,max,sum);
return 0;
}
|
39
|
19133
|
void main()
{
struct s
{char name[20];
int gpa;
int cgpa;
char official;
char west;
int paper;
}stu[100];
int m[100]={0},n,i,max=0,num=0;
long sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].name);
scanf("%d",&stu[i].gpa);
scanf("%d",&stu[i].cgpa);
getchar();
scanf("%c",&stu[i].official);
getchar();
scanf("%c",&stu[i].west);
scanf("%d",&stu[i].paper);
if(stu[i].gpa>80&&stu[i].paper>0) m[i]=m[i]+8000;
if(stu[i].gpa>85&&stu[i].cgpa>80) m[i]=m[i]+4000;
if(stu[i].gpa>90) m[i]=m[i]+2000;
if(stu[i].gpa>85&&stu[i].west=='Y') m[i]=m[i]+1000;
if(stu[i].cgpa>80&&stu[i].official=='Y') m[i]=m[i]+850;
sum=sum+m[i];
if(m[i]>max)
{
max=m[i];
num=i;
}
}
printf("%s\n%d\n%d\n",stu[num].name,max,sum);
}
|
39
|
19134
|
struct student
{
char name[21];
int term;
int access;
char ganbu;
char west;
int paper;
int all;
}stu[100];
main()
{
int N;
scanf("%d",&N);
int i;
for(i=0;i<N;i++){
scanf("%s%d%d%s%s%d",&stu[i].name,&stu[i].term,&stu[i].access,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
for(i=0;i<N;i++){
stu[i].all=0;
if(stu[i].term>80&&stu[i].paper>=1){
stu[i].all=stu[i].all+8000;
}
if(stu[i].term>85&&stu[i].access>80){
stu[i].all=stu[i].all+4000;
}
if(stu[i].term>90){
stu[i].all=stu[i].all+2000;
}
if(stu[i].term>85&&stu[i].west=='Y'){
stu[i].all=stu[i].all+1000;
}
if(stu[i].ganbu=='Y'&&stu[i].access>80){
stu[i].all=stu[i].all+850;
}
}
int max=0;
int total=0,k;
for(i=0;i<N;i++){
total+=stu[i].all;
if(max<stu[i].all){
max=stu[i].all;
k=i;
}
}
printf("%s\n%d\n%d\n",stu[k].name,stu[k].all,total);
}
|
39
|
19135
|
int main()
{
int N,score1,score2,k,i,money[100],totalmoney=0,x,n;
char name[100][20];
char c,d;
scanf("%d",&N);
for(i=0;i<N;i++)
{
money[i]=0;
scanf("%s %d %d %c %c %d",name[i],&score1,&score2,&c,&d,&k);
if(score1>80&&k!=0)
{
money[i]=money[i]+8000;
}
if(score1>85&&score2>80)
{
money[i]=money[i]+4000;
}
if(score1>90)
{
money[i]=money[i]+2000;
}
if(score1>85&&d=='Y')
{
money[i]=money[i]+1000;
}
if(score2>80&&c=='Y')
{
money[i]=money[i]+850;
}
}
x=money[0];
n=0;
for(i=0;i<N;i++)
{
totalmoney=totalmoney+money[i];
if(money[i]>x)
{
x=money[i];
if(i>n)
{
n=i;
}
}
}
printf("%s\n",name[n]);
printf("%d\n",x);
printf("%d\n",totalmoney);
return 0;
}
|
39
|
19136
|
struct student{
char name[21];
int qimo;
int maji;
char ganbu;
char xibu;
int lun;
int money;}st[101];
int main()
{
int n,i,j,ans=0;
memset(st,0,sizeof(struct student));
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%s %d %d %c %c %d",st[i].name,&st[i].qimo,&st[i].maji,&st[i].ganbu,&st[i].xibu,&st[i].lun);
for(i=1;i<=n;i++)
{if(st[i].qimo>80&&st[i].lun>=1)st[i].money+=8000;
if(st[i].qimo>85&&st[i].maji>80)st[i].money+=4000;
if(st[i].qimo>90)st[i].money+=2000;
if(st[i].qimo>85&&st[i].xibu=='Y')st[i].money+=1000;
if(st[i].maji>80&&st[i].ganbu=='Y')st[i].money+=850;
}
j=1;
for(i=1;i<=n;i++)
{if(st[j].money<st[i].money)j=i;
ans+=st[i].money;
}
printf("%s\n%d\n%d",st[j].name,st[j].money,ans);
return 0;
}
|
39
|
19137
|
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, q;
int l;
scanf("%s%d%d %c %c%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&&q=='Y')
{
sum[i]+=1000;
}
if(b>80&&p=='Y')
{
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", name[k]);
printf("%d\n", sum[k]);
printf("%d\n", total);
return 0;
}
|
39
|
19138
|
void main()
{
int n, i, sum, z;
struct student
{
char name[20];
int exam;
int cla;
char lead;
char west;
int theo;
int sch;
};
struct student stu[100];
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%s", stu[i].name);
scanf("%d", &stu[i].exam);
scanf("%d %c %c %d", &stu[i].cla, &stu[i].lead, &stu[i].west, &stu[i].theo);
}
for(i=0; i<n; i++)
{
stu[i].sch = 0;
if(stu[i].exam>80 && stu[i].theo>0)
stu[i].sch = stu[i].sch + 8000;
if(stu[i].exam>85 && stu[i].cla>80)
stu[i].sch = stu[i].sch + 4000;
if(stu[i].exam>90)
stu[i].sch = stu[i].sch + 2000;
if(stu[i].exam>85 && stu[i].west=='Y')
stu[i].sch = stu[i].sch + 1000;
if(stu[i].cla>80 && stu[i].lead=='Y')
stu[i].sch = stu[i].sch + 850;
}
z = 0;
for(i=0; i<n; i++)
{
if(stu[i].sch>stu[z].sch)
z = i;
}
sum = 0;
for(i=0; i<n; i++)
sum = sum + stu[i].sch;
printf("%s\n", stu[z].name);
printf("%d\n", stu[z].sch);
printf("%d\n", sum);
}
|
39
|
19139
|
struct student{
char name[21];
int pingjun;
int banyi;
char ganbu;
char west;
int paper;
}stu[120];
void scholar(struct student *p,int a);
int main(){
int n,i;
struct student *pointer1;
pointer1=stu;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].pingjun,&stu[i].banyi,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
scholar(pointer1,n);
return 0;
}
void scholar(struct student *p,int a){
int sums,sum=0,max=0;
int j,jishu=0;
for(j=0;j<a;j++){
sums=0;
if(((p+j)->pingjun>80)&&((p+j)->paper>0)){
sums+=8000;
}
if(((p+j)->pingjun>85)&&((p+j)->banyi>80)){
sums+=4000;
}
if((p+j)->pingjun>90){
sums+=2000;
}
if(((p+j)->pingjun>85)&&((p+j)->west=='Y')){
sums+=1000;
}
if(((p+j)->banyi>80)&&((p+j)->ganbu=='Y')){
sums+=850;
}
sum+=sums;
if(sums>max){
max=sums;
jishu=j;
}
}
printf("%s\n%d\n%d",(p+jishu)->name,max,sum);
}
|
39
|
19140
|
struct student{
char name[20];
int gra1;
int gra2;
char ganbu;
char west;
int paper;
int award;
}stu[100];
void main()
{
int n,i,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",stu[i].name);
scanf("%d%d%s%s%d",&stu[i].gra1,&stu[i].gra2,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++){
if(stu[i].gra1>80&&stu[i].paper>=1){
stu[i].award+=8000;
}
if(stu[i].gra1>85&&stu[i].gra2>80){
stu[i].award+=4000;
}
if(stu[i].gra1>90){
stu[i].award+=2000;
}
if(stu[i].gra1>85&&stu[i].west=='Y'){
stu[i].award+=1000;
}
if(stu[i].ganbu=='Y'&&stu[i].gra2>80){
stu[i].award+=850;
}
sum+=stu[i].award ;
}
int max=stu[0].award;
char best[20];
for(i=0;i<n;i++){
if(stu[i].award>max){
max=stu[i].award;
strcpy(best,stu[i].name);
}
}
printf("%s\n%d\n%d",best,max,sum);
}
|
39
|
19141
|
void main()
{
int n,w,c[2],i,j,max,total,no;
char a1,a2,s[20],t[20];
scanf("%d",&n);
total=0;
max=0;
for(i=0;i<n;i++)
{
w=0;
scanf("%s %d %d %c %c %d",s,&c[0],&c[1],&a1,&a2,&no);
if(c[0]>80&&no>0) w=w+8000;
if(c[0]>85&&c[1]>80) w=w+4000;
if(c[0]>90) w=w+2000;
if(c[0]>85&&a2=='Y') w=w+1000;
if(c[1]>80&&a1=='Y') w=w+850;
total=total+w;
if(w>max)
{
max=w;
strcpy(t,s);
}
}
printf("%s\n%d\n%d\n",t,max,total);
}
|
39
|
19142
|
struct award
{
char name[20];
int score1;
int score2;
char leader;
char west;
int paper;
int money;
};
int main()
{
struct award stu[100];
struct award max;
int n,i,sum=0;
scanf("%d\n",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].score1,&stu[i].score2,&stu[i].leader,&stu[i].west,&stu[i].paper);
}
for (i=0;i<n;i++)
{
stu[i].money=0;
if (stu[i].score1>80 && stu[i].paper>0)
{
stu[i].money+=8000;
}
if (stu[i].score1>85 && stu[i].score2>80)
{
stu[i].money+=4000;
}
if (stu[i].score1>90)
{
stu[i].money+=2000;
}
if (stu[i].score1>85 && stu[i].west=='Y')
{
stu[i].money+=1000;
}
if (stu[i].score2>80 && stu[i].leader=='Y')
{
stu[i].money+=850;
}
sum+=stu[i].money;
}
max=stu[0];
for (i=1;i<n;i++)
{
if (stu[i].money>max.money)
{
max=stu[i];
}
}
puts(max.name);
printf("%d\n",max.money);
printf("%d\n",sum);
return 0;
}
|
39
|
19143
|
int main()
{
int n,i,j,a1=8000,a2=4000,a3=2000,a4=1000,a5=850;
int max=0,top=0,sum=0;
int grade[100],assess[100],article[100],award[100];
char west[100],official[100];
char name[100][20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
getchar();
for (j=0;j<20;j++)
{
scanf("%c",&name[i][j]);
if (name[i][j]==' ')
break;
}
award[i]=0;
scanf("%d %d %c %c %d",&grade[i],&assess[i],&official[i],&west[i],&article[i]);
if (grade[i]>80 && article[i]>0)
award[i]+=a1;
if (grade[i]>85 && assess[i]>80)
award[i]+=a2;
if (grade[i]>90)
award[i]+=a3;
if (grade[i]>85 && west[i]=='Y')
award[i]+=a4;
if (assess[i]>80 && official[i]=='Y')
award[i]+=a5;
sum+=award[i];
if (award[i]>max)
{
max=award[i];
top=i;
}
}
for(i=0;i<20;i++)
{
if(name[top][i]!=' ')
printf("%c",name[top][i]);
else
break;
}
printf("\n%d\n%d\n",max,sum);
return 0;
}
|
39
|
19144
|
int main()
{
int n,count[100]={0},score1[100],score2[100],num[100],i;
char name[100][30],a[100][2],b[100][2];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",name[i],&score1[i],&score2[i],a[i],b[i],&num[i]);
if(score1[i]>80&&num[i]>=1)
count[i]+=8000;
if(score1[i]>85&&score2[i]>80)
count[i]+=4000;
if(score1[i]>90)
count[i]+=2000;
if(score1[i]>85&&strcmp(b[i],"Y")==0)
count[i]+=1000;
if(score2[i]>80&&strcmp(a[i],"Y")==0)
count[i]+=850;
}
int max=count[0],m=0,sum=count[0];
for(i=1;i<n;i++)
{
sum+=count[i];
if(count[i]>max)
{
max=count[i];
m=i;
}
}
printf("%s\n%d\n%d",name[m],count[m],sum);
return 0;
}
|
39
|
19145
|
struct student
{
char name[20];
int s1,s2;
char x,y;
int l;
}stu[100];
int jiangjin(int i)
{
int jiang=0;
if(stu[i].s1>80&&stu[i].l>=1)
jiang+=8000;
if(stu[i].s1>85&&stu[i].s2>80)
jiang+=4000;
if(stu[i].s1>90)
jiang+=2000;
if(stu[i].s2>80&&stu[i].x=='Y')
jiang+=850;
if(stu[i].s1>85&&stu[i].y=='Y')
jiang+=1000;
return(jiang);
}
void main()
{
int n,i,a[100],h,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].x,&stu[i].y,&stu[i].l);
a[i]=jiangjin(i);
}
h=0;
for(i=0;i<n;i++)
{
sum+=a[i];
if(a[i]>a[h]){
h=i;}
}
printf("%s\n%d\n%d",stu[h].name,a[h],sum);
}
|
39
|
19146
|
int main()
{
int n,i=1,a,b,c,x,y=-1,sum=0;
char N[21],A[21],d,e;
scanf("%d",&n);
do
{
scanf("%s %d %d %c %c %d",N,&a,&b,&d,&e,&c);
x=0;
if(a>80&&c>=1)
x=x+8000;
if(a>85&&b>80)
x=x+4000;
if(a>90)
x=x+2000;
if(a>85&&e=='Y')
x=x+1000;
if(b>80&&d=='Y')
x=x+850;
sum=sum+x;
if(x>y)
{
y=x;
strcpy(A,N);
}
i++;
}
while(i<=n);
printf("%s\n",A);
printf("%d\n",y);
printf("%d\n",sum);
return 0;
}
|
39
|
19147
|
void main()
{
int i,n,max=0;
unsigned long sum=0;
struct student
{
char name[21]; //??
int mark; //??????
int evaluation; //??????
char cadre; //????
char west; //??????
int thesis; //???
int scholarship; //???
};
scanf("%d",&n);
struct student *p = (struct student*)malloc(n * sizeof(struct student));
for(i=0; i<n; i++)
{
struct student *q;
q = p + i;
q->scholarship = 0;
scanf("%s %d %d %c %c %d",&(q->name),&(q->mark),&(q->evaluation),&(q->cadre),&(q->west),&(q->thesis));
if(q->mark>80 && q->thesis>0)
q->scholarship += 8000; //?????
if(q->mark>85 && q->evaluation>80)
q->scholarship += 4000; //?????
if(q->mark>90)
q->scholarship += 2000; //?????
if(q->mark>85 && q->west=='Y')
q->scholarship += 1000; //?????
if(q->evaluation>80 && q->cadre=='Y')
q->scholarship += 850; //?????
sum += q->scholarship;
}
for(i=1; i<n; i++)
{
if((p+i)->scholarship > (p+max)->scholarship)
max = i;
}
printf("%s\n%d\n%d",(p+max)->name,(p+max)->scholarship,sum);
}
|
39
|
19148
|
struct student
{
char name [20];
int score1;
int score2;
char moni;
char west;
int comp;
}stu[100];
void main()
{
struct student *p;
int n,sum=0,t,s=0,d,i;
char nam[20];
scanf("%d",&n);
for ( p=stu;p<stu+ n;p++)
scanf("%s %d %d %c %c %d", &p->name,&p->score1,&p->score2,&p->moni,&p->west,&p->comp);
p=stu;
for (p=stu;p<stu+n;p++)
{
t=0;
if (p->score1>80&&p->comp>=1)
t=t+8000;
if (p->score1>85&&p->score2>80)
t=t+4000;
if (p->score1>90)
t=t+2000;
if (p->score1>85&&p->west=='Y')
t=t+1000;
if (p->score2>80&&p->moni=='Y')
t=t+850;
if (t>s)
{
s=t;
d=strlen(p->name);
strcpy(nam,p->name);
for (i=d;i<20;i++)
nam[i]=0;
}
sum=sum+t;
}
puts(nam);
printf("%d\n%d",s,sum);
}
|
39
|
19149
|
int main()
{
int n,i;
scanf("%d",&n);
struct f
{
char str[21];
int score1,score2,article;//score1???????? score2??????
char a,b;
int prize;
}*p;
p=(struct f*)malloc(n*sizeof(struct f));
for(i=0;i<n;i++)
{ (p+i)->prize=0;
scanf("%s %d %d %c %c %d",(p+i)->str,&((p+i)->score1),&((p+i)->score2),&((p+i)->a),&((p+i)->b),&((p+i)->article));
if((p+i)->score1>80&&(p+i)->article>0) (p+i)->prize+=8000;
if((p+i)->score1>85&&(p+i)->score2>80) (p+i)->prize+=4000;
if((p+i)->score1>90) (p+i)->prize+=2000;
if((p+i)->score1>85&&(p+i)->b=='Y') (p+i)->prize+=1000;
if((p+i)->score2>80&&(p+i)->a=='Y') (p+i)->prize+=850;
}
long int sum=0;
for(i=0;i<n;i++)
{
sum+=(p+i)->prize;
}
char *p1;
int max=0;
for(i=0;i<n;i++)//????????????max?
if((p+i)->prize>max)
{
max=(p+i)->prize;
p1=(p+i)->str;
}
printf("%s\n%d\n%ld",p1,max,sum);
}
|
39
|
19150
|
struct student
{
char name[20];
int ave;
int cla;
char leader;
char west;
int paper;
};
void main()
{
struct student stu[200];
int n,i,count[200],count2[200],k,j,temp,l,all,max;
all=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
count[i]=0;
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].ave,&stu[i].cla,&stu[i].leader,&stu[i].west,&stu[i].paper);
if(stu[i].ave>80&&stu[i].paper>=1)
count[i]=count[i]+8000;
if(stu[i].ave>85&&stu[i].cla>80)
count[i]=count[i]+4000;
if(stu[i].ave>90)
count[i]=count[i]+2000;
if(stu[i].ave>85&&stu[i].west=='Y')
count[i]=count[i]+1000;
if(stu[i].cla>80&&stu[i].leader=='Y')
count[i]=count[i]+850;
all=all+count[i];
}
for(k=0;k<n;k++)
count2[k]=count[k];
max=count[0];
for(j=0;j<n;j++)
if(count[j]>max)
max=count[j];
for(l=0;l<n;l++)
if(count2[l]==max)
break;
printf("%s\n%d\n%d\n",stu[l].name,max,all);
}
|
39
|
19151
|
int main(int argc, char* argv[])
{
int n,i,b=0,sum=0,max;
struct student{
char name[21];
int mc;
int bc;
char bg;
char xb;
int lw;
int sch;
}stu[100];
scanf("%d",&n);
for(i=0;i<n;i++){
stu[i].sch=0;
scanf("%s%d%d %c %c%d",&stu[i].name,&stu[i].mc,&stu[i].bc,&stu[i].bg,&stu[i].xb,&stu[i].lw);
if(stu[i].mc>80&&stu[i].lw>0){
stu[i].sch=8000;
sum+=8000;
}
if(stu[i].mc>85&&stu[i].bc>80){
stu[i].sch+=4000;
sum+=4000;
}
if(stu[i].mc>90){
stu[i].sch+=2000;
sum+=2000;
}
if(stu[i].mc>85&&stu[i].xb=='Y'){
stu[i].sch+=1000;
sum+=1000;
}
if(stu[i].bc>80&&stu[i].bg=='Y'){
stu[i].sch+=850;
sum+=850;
}
}
max=stu[0].sch;
for(i=0;i<n;i++){
if(max<stu[i].sch){
max=stu[i].sch;
b=i;
}
}
printf("%s\n%d\n%d\n",stu[b].name,stu[b].sch,sum);
return 0;
}
|
39
|
19152
|
int main(int argc, char* argv[])
{
char a[20],g[20],d,e;
int b,c,f,n,sum=0,max=0,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
int sum1=0;
scanf("%s %d %d %c %c %d",a,&b,&c,&d,&e,&f);
if(b>80&&f>=1) sum1+=8000;
if(b>85&&c>80) sum1+=4000;
if(b>90) sum1+=2000;
if(b>85&&e=='Y') sum1+=1000;
if(c>80&&d=='Y') sum1+=850;
sum+=sum1;
if(sum1>max)
{
max=sum1;
for(j=0;j<20;j++)
{
g[j]=a[j];
}
}
}
printf("%s\n%d\n%d\n",g,max,sum);
return 0;
}
|
39
|
19153
|
struct student
{ char s[21];
int a;
int b;
char m;
char p;
int c;
int q;
};
void main()
{
int n,i,j;
int long sum=0;
struct student stu[100];
struct student l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].s,&stu[i].a,&stu[i].b,&stu[i].m,&stu[i].p,&stu[i].c);
}
for(i=0;i<n;i++)
{
stu[i].q=0;
if((stu[i].a>80) &&( stu[i].c>0))
stu[i].q+=8000;
if((stu[i].a>85 )&& (stu[i].b>80))
stu[i].q+=4000;
if(stu[i].a>90)
stu[i].q+=2000;
if((stu[i].a>85) && (stu[i].p=='Y'))
stu[i].q+=1000;
if((stu[i].b>80 )&& (stu[i].m=='Y'))
stu[i].q+=850;
}
for(j=1;j<n;j++)
{
for(i=0;i<n-j;i++)
{
if(stu[i+1].q>stu[i].q)
{
l=stu[i];
stu[i]=stu[i+1];
stu[i+1]=l;
}
}
}
for(i=0;i<n;i++)
sum+=stu[i].q;
printf("%s",stu[0].s);
printf("\n%d\n",stu[0].q);
printf("%d",sum);
}
|
39
|
19154
|
struct stu
{
char a[21];
int b[2];
char c;
char d;
int e;
int sum;
};
int main()
{
struct stu h[100];
int n,i,j,k,sum1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d%d %c %c%d",h[i].a,&h[i].b[0],&h[i].b[1],&h[i].c,&h[i].d,&h[i].e);
h[i].sum=0;
if(h[i].b[0]>80&&h[i].e>=1)
h[i].sum=h[i].sum+8000;
if(h[i].b[0]>85&&h[i].b[1]>80)
h[i].sum=h[i].sum+4000;
if(h[i].b[0]>90)
h[i].sum=h[i].sum+2000;
if(h[i].b[0]>85&&h[i].d=='Y')
h[i].sum=h[i].sum+1000;
if(h[i].b[1]>80&&h[i].c=='Y')
h[i].sum=h[i].sum+850;
}
// for(i=0;i<n;i++)
// printf("%d\n",h[i].sum);
k=0;
sum1=h[0].sum;
for(i=1;i<n;i++)
{
if(h[k].sum<h[i].sum)
k=i;
sum1=sum1+h[i].sum;
}
printf("%s\n%d\n%d\n",h[k].a,h[k].sum,sum1);
return 0;
}
|
39
|
19155
|
void main()
{
int n,i,a[100],e[100],f[100],g[100]={0},m=0,k;
char b[100][20],c[100][1],d[100][1],x[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",b[i],&a[i],&e[i],c[i],d[i],&f[i]);
if(a[i]>80&&f[i]>0)
g[i]=g[i]+8000;
if(a[i]>85&&e[i]>80)
g[i]=g[i]+4000;
if(a[i]>90)
g[i]=g[i]+2000;
if(a[i]>85&&strcmp(d[i],"Y")==0)
g[i]=g[i]+1000;
if(e[i]>80&&strcmp(c[i],"Y")==0)
g[i]=g[i]+850;
}
for(i=n-2;i>=0;i--)
if(g[i]<g[i+1])
{
k=g[i];
g[i]=g[i+1];
g[i+1]=k;
strcpy(x,b[i]);
strcpy(b[i],b[i+1]);
strcpy(b[i+1],x);
}
for(i=0;i<n;i++)
m=m+g[i];
printf("%s\n%d\n%d\n",b[0],g[0],m);
}
|
39
|
19156
|
struct student
{
char name[20];
int qm;
int bj;
char x;
char xi;
int lun;
int award;
};
void main()
{
struct student s[100];
int i,N,k=0,p,q=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",s[i].name,&s[i].qm,&s[i].bj,&s[i].x,&s[i].xi,&s[i].lun);
s[i].award=0;
// printf("%s %d %d %c %c %d\n",s[i].name,s[i].qm,s[i].bj,s[i].x,s[i].xi,s[i].lun);
}
for(i=0;i<N;i++)
{
if(s[i].qm>80&&s[i].lun>0)
s[i].award=s[i].award+8000;
if(s[i].qm>85&&s[i].bj>80)
s[i].award=s[i].award+4000;
if(s[i].qm>90)
s[i].award=s[i].award+2000;
if(s[i].qm>85&&s[i].xi=='Y')
s[i].award=s[i].award+1000;
if(s[i].bj>80&&s[i].x=='Y')
s[i].award=s[i].award+850;
}
p=s[0].award;
for(i=0;i<N;i++)
{
if(s[i].award>p)
p=s[i].award;
}
q=0;
for(i=0;i<N;i++)
{
if(s[i].award==p)
{
if(k==0)
{
k=k+1;
printf("%s\n",s[i].name);
printf("%d\n",p);
}
}
q=q+s[i].award;
}
printf("%d",q);
}
|
39
|
19157
|
void main()
{
char name[100][100],student[100][5],west[100][5];
int final[100], clas[100], essay[100],scholarship[100]={0};
int n,total=0;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",&name[i],&final[i],&clas[i],&student[i],&west[i],&essay[i]);
}
for(i=0;i<n;i++)
{
if(final[i]>80&&essay[i]>=1)
scholarship[i]=scholarship[i]+8000;
if(final[i]>85&&clas[i]>80)
scholarship[i]=scholarship[i]+4000;
if(final[i]>90)
scholarship[i]=scholarship[i]+2000;
if(west[i][0]=='Y'&&final[i]>85)
scholarship[i]=scholarship[i]+1000;
if(student[i][0]=='Y'&&clas[i]>80)
scholarship[i]=scholarship[i]+850;
total=total+scholarship[i];
}
int max=0,k;
for(i=0;i<n;i++)
{
if(scholarship[i]>max)
{
max=scholarship[i];
k=i;
}
}
printf("%s\n",name[k]);
printf("%d\n%d\n",scholarship[k],total);
}
|
39
|
19158
|
struct stu
{
char name[21];
int s1;
int s2;
char g;
char x;
int l;
int m;
}stu[101];
int main(int argc, char* argv[])
{
int n,i,j,sum=0,len,max=0,num;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].g,&stu[i].x,&stu[i].l);
stu[i].m=0;
if(stu[i].s1>80&&stu[i].l>=1){
stu[i].m+=8000;
}
if(stu[i].s1>85&&stu[i].s2>80){
stu[i].m+=4000;
}
if(stu[i].s1>90){
stu[i].m+=2000;
}
if(stu[i].s1>85&&stu[i].x=='Y'){
stu[i].m+=1000;
}
if(stu[i].s2>80&&stu[i].g=='Y'){
stu[i].m+=850;
}
sum+=stu[i].m;
if(stu[i].m>max){
max=stu[i].m;
num=i;
}
}
printf("%s\n%d\n%d",stu[num].name,stu[num].m,sum);
return 0;
}
|
39
|
19159
|
void main()
{
struct student
{
char name[20];
int q;
int b;
char g;
char x;
int l;
};
struct student stu[100];
int i,n;
long sum[100]={0},sum2=0,sum1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf(P,stu[i].name,&stu[i].q,&stu[i].b,&stu[i].g,&stu[i].x,&stu[i].l);
}
for(i=0;i<n;i++)
{
if(stu[i].q>80&&stu[i].l>=1)
sum[i]=sum[i]+8000;
if(stu[i].q>85&&stu[i].b>80)
sum[i]=sum[i]+4000;
if(stu[i].q>90)
sum[i]=sum[i]+2000;
if(stu[i].q>85&&stu[i].x=='Y')
sum[i]=sum[i]+1000;
if(stu[i].b>80&&stu[i].g=='Y')
sum[i]=sum[i]+850;
}
sum1=sum[0];
sum2=sum[0];
for(i=1;i<n;i++)
{
if(sum[i]>sum1)
sum1=sum[i];
sum2=sum2+sum[i];
}
for(i=0;i<n;i++)
{
if(sum1==sum[i])
{
printf("%s\n",stu[i].name);
break;
}
}
printf("%ld\n",sum1);
printf("%ld\n",sum2);
}
|
39
|
19160
|
int qm[102],bp[102],lw[102];
char bg[102]={'\0'},xb[102]={'\0'};
int yuanshi(int i)
{
if(qm[i]>80&&lw[i]>0) return 8000;
else return 0;
}
int wusi(int i)
{
if(qm[i]>85&&bp[i]>80) return 4000;
else return 0;
}
int youxiu(int i)
{
if (qm[i]>90 ) return 2000;
else return 0;
}
int xibu(int i)
{
if(qm[i]>85&&xb[i]=='Y') return 1000;
else return 0;
}
int banji(int i)
{
if( bp[i]>80 && bg[i]=='Y') return 850;
else return 0;
}
int main()
{
int i,n,max,num,jxj[102]={0},sum=0;
char name[102][21]={'\0'};
cin>>n;
for(i=1;i<=n;i++)
{
cin>>name[i]>>qm[i]>>bp[i]>>bg[i]>>xb[i]>>lw[i];
jxj[i]=yuanshi(i)+wusi(i)+youxiu(i)+xibu(i)+banji(i);
}
max=jxj[1]; num=1,sum=jxj[1];
for(i=2;i<=n;i++)
{
sum=sum+jxj[i];
if (jxj[i]>max)
{
max=jxj[i];
num=i;
}
}
cout<<name[num]<<endl<<jxj[num]<<endl<<sum<<endl;
return 0;
}
|
39
|
19161
|
int main()
{
int n,i,maxmoney,sum=0;
char name[21];char maxname[21];
int qimo[100]={0};int banji[100]={0};char ganbu[100];char xibu[100];int lunwen[100]={0};int money[100]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",name);
scanf(" %d %d",&qimo[i-1],&banji[i-1]);
scanf(" %c %c",&ganbu[i-1],&xibu[i-1]);
scanf(" %d",&lunwen[i-1]);
if(qimo[i-1]>80&&lunwen[i-1]>=1) money[i-1]=money[i-1]+8000;
if(qimo[i-1]>85&&banji[i-1]>80) money[i-1]=money[i-1]+4000;
if(qimo[i-1]>90) money[i-1]=money[i-1]+2000;
if(qimo[i-1]>85&&xibu[i-1]=='Y') money[i-1]=money[i-1]+1000;
if(banji[i-1]>80&&ganbu[i-1]=='Y') money[i-1]=money[i-1]+850;
if(i==1)
{
maxmoney=money[0];
strcpy(maxname,name);
}
sum=sum+money[i-1];
if(i>=2)
{
if (money[i-1]>maxmoney)
{
maxmoney=money[i-1];
strcpy(maxname,name);
}
}
}
printf("%s\n",maxname);
printf("%d\n",maxmoney);
printf("%d\n",sum);
return 0;
}
|
39
|
19162
|
int main()
{
int N, i, final_g, class_g, nPapers;
int scholarship, max_s, sum;
char isCadre, isWest;
char buffer[21];
char name[21];
scanf("%d", &N);
sum = 0;
max_s = 0;
for (i=0; i<N; i++) {
scanf("%s %d %d %c %c %d", buffer, &final_g, &class_g, &isCadre, &isWest, &nPapers);
scholarship = 0;
if (final_g>80 && nPapers>0)
scholarship += 8000;
if (final_g>85 && class_g>80)
scholarship += 4000;
if (final_g>90)
scholarship += 2000;
if (final_g>85 && isWest=='Y')
scholarship += 1000;
if (class_g>80 && isCadre=='Y')
scholarship += 850;
if (scholarship > max_s) {
strcpy(name, buffer);
max_s = scholarship;
}
sum += scholarship;
}
printf("%s\n%d\n%d\n", name, max_s, sum);
return 0;
}
|
39
|
19163
|
void main()
{
int n,i,s1[100],s2[100],e[100],s[100]={0},all[100]={0},sum=0;
char name[100][30],g[100],w[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
int R[5]={0};
scanf("%s %d %d %c %c %d",name[i],&s1[i],&s2[i],&g[i],&w[i],&e[i]);
if ((s1[i]>80)&&(e[i]>=1))
R[0]= 8000;
if ((s1[i]>85)&&(s2[i]>80))
R[1]= 4000;
if (s1[i]>90)
R[2]= 2000;
if ((s1[i]>85)&&(w[i]=='Y'))
R[3]= 1000;
if ((s2[i]>80)&&(g[i]=='Y'))
R[4]= 850;
all[i]=R[0]+R[1]+R[2]+R[3]+R[4];
}
int r=0,max=all[0];
for(i=0;i<n;i++)
{
sum+=all[i];
if(all[i]>max)
{
max=all[i];
r=i;
}
}
printf("%s\n%d\n%d\n",name[r],all[r],sum);
}
|
39
|
19164
|
struct student
{
char name[20];
int score1;
int score2;
char mon;
char west;
int paper;
int sum;
struct student *next;
};
struct student *creat(int n)
{
struct student *p1,*p2,*head;
int many;
int n1;
n1=n;
p1=p2=(struct student*)malloc(LEN);
head=NULL;
many=0;
while(many<n1)
{
scanf("%s %d %d %c %c %d",&p1->name,&p1->score1,&p1->score2,&p1->mon,&p1->west,&p1->paper);
many++;
if(many==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
}
p2->next=NULL;
return(head);
}
void print(struct student *head)
{
struct student *p,*pmax;
p=head;
int total=0,max=0;
if(head!=NULL)
do
{
p->sum=0;
if(p->score1>80&&p->paper>=1)p->sum=p->sum+8000;
if(p->score1>85&&p->score2>80)p->sum=p->sum+4000;
if(p->score1>90)p->sum=p->sum+2000;
if(p->score1>85&&p->west=='Y')p->sum=p->sum+1000;
if(p->score2>80&&p->mon=='Y')p->sum=p->sum+850;
total=total+p->sum;
p=p->next;
}while(p!=NULL);
p=head;
do
{
if(p->sum>max){max=p->sum;pmax=p;}
p=p->next;
}while(p!=NULL);
printf("%s\n%d\n%d\n",pmax->name,max,total);
}
void main()
{
int n;
struct student *head;
scanf("%d",&n);
head=creat(n);
print(head);
}
|
39
|
19165
|
int main()
{
int n;
scanf("%d",&n);
struct student
{
char name[100];
int qi;
int ping;
char gan;
char xi;
int lun;
}a[1000];
int i;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].qi,&a[i].ping,&a[i].gan,&a[i].xi,&a[i].lun);
}
int d[1000]={0};
for(i=0;i<n;i++)
{
if(a[i].qi>80&&a[i].lun!=0)
{d[i]+=8000;}
if(a[i].qi>85&&a[i].ping>80)
{d[i]+=4000;}
if(a[i].qi>90)
{d[i]+=2000;}
if(a[i].qi>85&&a[i].xi=='Y')
{d[i]+=1000;}
if(a[i].ping>80&&a[i].gan=='Y')
{d[i]+=850;}
}
int sum=0;
for(i=0;i<n;i++)
{sum+=d[i];}
int z=0;
for(i=0;i<n;i++)
{
if(d[z]<d[i])
{z=i;}
}
printf("%s\n%d\n%d",a[z].name,d[z],sum);
return 0;
}
|
39
|
19166
|
void main()
{
int n;
scanf("%d",&n);
struct student
{
char name[20];
int score;
int judge;
char work;
char west;
int paper;
int money;
}stu[100];
int i;
for(i=0;i<n;i++)
{
stu[i].money=0;
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].score,&stu[i].judge,&stu[i].work,&stu[i].west,&stu[i].paper);
if(stu[i].score>80&&stu[i].paper>=1)
stu[i].money=stu[i].money+8000;
if(stu[i].score>85&&stu[i].judge>80)
stu[i].money=stu[i].money+4000;
if(stu[i].score>90)
stu[i].money=stu[i].money+2000;
if(stu[i].score>85&&stu[i].west=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].judge>80&&stu[i].work=='Y')
stu[i].money=stu[i].money+850;
}
int max=0,sum=0;
for(i=0;i<n;i++)
{
sum=sum+stu[i].money;
if(stu[i].money>max)
max=stu[i].money;
}
for(i=0;i<n;i++)
{
if(stu[i].money==max)
{
printf("%s\n%d\n",stu[i].name,max);
break;
}
}
printf("%d\n",sum);
}
|
39
|
19167
|
struct student
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int paper;
}stu[100];
int main()
{ int f(struct student s);
int n,i,a[100],max,count=0,m=0,k=0,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].ganbu,&stu[i].xibu,&stu[i].paper);
for(i=0;i<n;i++)
a[i]=f(stu[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
max=a[0];
for(i=0;i<n;i++)
if(a[i]>max)
{max=a[i];
m=i;}
for(i=0;i<n;i++)
if(a[i]==max)
count++;
if(count==1)
printf("%s\n%d\n%d",stu[m].name,max,sum);
else for(i=0;i<n;i++)
if(a[i]==max)
{printf("%s\n%d\n%d",stu[i].name,max,sum);
break;}
return 0;
}
int f(struct student s)
{int sum=0;
if(s.qimo>80&&s.paper>=1)
sum=sum+8000;
if(s.qimo>85&&s.banji>80)
sum=sum+4000;
if(s.qimo>90)
sum=sum+2000;
if(s.qimo>85&&s.xibu=='Y')
sum=sum+1000;
if(s.banji>80&&s.ganbu=='Y')
sum=sum+850;
return sum;
}
|
39
|
19168
|
void main()
{
struct student
{
char name[30],gb,west;
int sco1,sco2,paper,money;
} stu[100];
int n,i;
long sum=0,max=0;
char maxs[30];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].sco1,&stu[i].sco2,&stu[i].gb,&stu[i].west,&stu[i].paper);
stu[i].money=0;
if (stu[i].sco1>80&&stu[i].paper>=1) stu[i].money+=8000;
if (stu[i].sco1>85&&stu[i].sco2>80) stu[i].money+=4000;
if (stu[i].sco1>90) stu[i].money+=2000;
if (stu[i].sco1>85&&stu[i].west=='Y') stu[i].money+=1000;
if (stu[i].sco2>80&&stu[i].gb=='Y') stu[i].money+=850;
}
for (i=0;i<n;i++)
{
sum+=stu[i].money;
if (stu[i].money>max) {max=stu[i].money;strcpy(maxs,stu[i].name);}
}
printf("%s\n%ld\n%ld",maxs,max,sum);
}
|
39
|
19169
|
int main()
{
int N,i,price,total=0,max=0,t;
scanf("%d",&N);
struct student
{
char name[21];
int ave;
int comment;
char officer;
char province;
int paper;
}stu[100];
for(i=0;i<N;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].ave,&stu[i].comment,&stu[i].officer,&stu[i].province,&stu[i].paper);
}
for(i=0;i<N;i++){
price=0;
if(stu[i].ave>80&&stu[i].paper>0){price=price+8000;}
if(stu[i].ave>85&&stu[i].comment>80){price=price+4000;}
if(stu[i].ave>90){price=price+2000;}
if(stu[i].ave>85&&stu[i].province=='Y'){price=price+1000;}
if(stu[i].comment>80&&stu[i].officer=='Y'){price=price+850;}
total=total+price;
if(price>max){
max=price;
t=i;
}
}
printf("%s\n%d\n%d\n",stu[t].name,max,total);
return 0;
}
|
39
|
19170
|
struct data
{
char name[200];
int score;
int classscore;
char leader;
char west;
int paper;
int scholarship;
struct data *next;
};
int main()
{
int N;
scanf("%d",&N);
int i,sum=0,max=0;
struct data *head,*p1,*p2,*recorder;
p1=(struct data *)malloc(Len);
scanf("%s %d %d %c %c %d",p1->name,&p1->score,&p1->classscore,&p1->leader,&p1->west,&p1->paper);
p1->next=NULL;
p1->scholarship=0;
head=p1;
p2=p1;
for (i=1;i<N;i++)
{
p1=(struct data *)malloc(Len);
scanf("%s %d %d %c %c %d",p1->name,&p1->score,&p1->classscore,&p1->leader,&p1->west,&p1->paper);
p1->next=NULL;
p1->scholarship=0;
p2->next=p1;
p2=p1;
}
for (p1=head;p1!=NULL;p1=p1->next)
{
if (p1->paper>0&&p1->score>80) p1->scholarship+=8000;
if (p1->score>85&&p1->classscore>80) p1->scholarship+=4000;
if (p1->score>90) p1->scholarship+=2000;
if (p1->score>85&& p1->west=='Y') p1->scholarship+=1000;
if (p1->classscore>80 && p1->leader=='Y') p1->scholarship+=850;
if (p1->scholarship>max)
{
max=p1->scholarship;
recorder=p1;
}
sum=sum+p1->scholarship;
}
printf("%s\n%d\n%d\n",recorder->name,recorder->scholarship,sum);
return 0;
}
|
39
|
19171
|
struct Student
{
char name[20];
int a;
int b;
char g;
char x;
int l;
int sum;
}stu[100];
int n;
int main()
{
scanf("%d",&n);
int i;
int all=0;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].a,&stu[i].b,&stu[i].g,&stu[i].x,&stu[i].l);
stu[i].sum=0;
if(stu[i].a>80&&stu[i].l>=1)
stu[i].sum+=8000;
if(stu[i].a>85&&stu[i].b>80)
stu[i].sum+=4000;
if(stu[i].a>90)
stu[i].sum+=2000;
if(stu[i].a>85&&stu[i].x=='Y')
stu[i].sum+=1000;
if(stu[i].b>80&&stu[i].g=='Y')
stu[i].sum+=850;
all+=stu[i].sum;
}
int max=0;
for(i=0;i<n;i++)
{
if(max<stu[i].sum)
max=stu[i].sum;
}
for(i=0;i<n;i++)
{
if(stu[i].sum==max)
{
printf("%s\n",stu[i].name);
printf("%d\n",stu[i].sum);
break;
}
}
printf("%d\n",all);
return 0;
}
|
39
|
19172
|
void main()
{
struct student
{
char name[20];
int score;
int grade;
char ganbu;
char west;
int paper;
long money;
};
int a,i,j,n,sum;
char c;
struct student stu[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s%d%d%c%c%c%c%c%d",stu[i].name,&stu[i].score,&stu[i].grade,&c,&stu[i].ganbu,&c,&stu[i].west,&c,&stu[i].paper);
stu[i].money=0;
}
for(i=0;i<=n-1;i++)
{
if (stu[i].score>80&&stu[i].paper>=1)
stu[i].money=stu[i].money+8000;
if (stu[i].score>85&&stu[i].grade>80)
stu[i].money=stu[i].money+4000;
if (stu[i].score>90)
stu[i].money=stu[i].money+2000;
if (stu[i].score>85&&stu[i].west=='Y')
stu[i].money=stu[i].money+1000;
if (stu[i].grade>80&&stu[i].ganbu=='Y')
stu[i].money=stu[i].money+850;
}
j=0;
a=stu[0].money;
sum=stu[0].money;
for(i=1;i<=n-1;i++)
{
if (stu[i].money>a)
{
j=i;
a=stu[i].money;
}
sum=sum+stu[i].money;
}
printf("%s\n%d\n%d\n",stu[j].name,a,sum);
}
|
39
|
19173
|
struct student{
char mz[20];
int cj;
int py;
char gb;
char xb;
int lw;
int money;
};
int main(){
int N,i,max,sum;
scanf("%d",&N);
struct student *stu=(struct student*)malloc(sizeof(struct student)*N);/*??????*/
struct student *p;
p=stu;
for(i=0;i<N;i++,p++){
scanf("%s %d %d %c %c %d",p->mz,&(p->cj),&(p->py),&(p->gb),&(p->xb),&(p->lw));/*????*/
}
p=stu;
for(i=0;i<N;i++,p++){
(p->money)=0;
if (p->cj>80 && p->lw>0)
{
(p->money)+=8000;
}
if (p->cj>85 && p->py>80)
{
(p->money)+=4000;
}
if (p->cj>90)
{
(p->money)+=2000;
}
if (p->cj>85 && p->xb=='Y')
{
(p->money)+=1000;
}
if (p->py>80 && p->gb=='Y')
{
(p->money)+=850;
}
}/*?????*/
sum=0;
p=stu;
for(i=0;i<N;i++,p++){
sum+=(p->money);
}/*?????*/
max=0;
for (i=0;i<N;i++)
{
if (stu[i].money>stu[max].money)
{
max=i;
}
}/*?????*/
printf("%s\n%d\n%d\n",stu[max].mz,stu[max].money,sum);
free(stu);
return 0;
}
|
39
|
19174
|
void main()
{
struct std
{
char name[21];
int cj;
int py;
char gb;
char xb;
int lw;
int sum;
}std[100];
int n,i,max,sum=0;
scanf("%d",&n);
for(i=0;i<n;i=i+1)
{
scanf("%s %d %d %c %c %d",&std[i].name,&std[i].cj,&std[i].py,&std[i].gb,&std[i].xb,&std[i].lw);
std[i].sum=0;
if(std[i].cj>80&&std[i].lw>=1) std[i].sum=std[i].sum+8000;
else;
if(std[i].cj>85&&std[i].py>80) std[i].sum=std[i].sum+4000;
else;
if(std[i].cj>90) std[i].sum=std[i].sum+2000;
else;
if(std[i].xb=='Y'&&std[i].cj>85) std[i].sum=std[i].sum+1000;
else;
if(std[i].gb=='Y'&&std[i].py>80) std[i].sum=std[i].sum+850;
else;
sum=sum+std[i].sum;
}
for(i=1,max=std[0].sum;i<n;i=i+1)
{
if(max<std[i].sum) max=std[i].sum;
else;
}
for(i=0;i<n;i=i+1)
{
if(std[i].sum==max)
{
printf("%s\n",std[i].name);
printf("%d\n",std[i].sum);
printf("%d\n",sum);
break;
}
}
}
|
39
|
19175
|
struct stus
{
char name[25];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int p;
};
void main()
{
int m,n,i,j,k,s=0;
char c[25]={0};
struct stus stu[101]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
if(stu[i].qimo>80&&stu[i].lunwen>=1)
stu[i].p+=8000;
if(stu[i].qimo>85&&stu[i].banji>80)
stu[i].p+=4000;
if(stu[i].qimo>90)
stu[i].p+=2000;
if(stu[i].xibu=='Y'&&stu[i].qimo>85)
stu[i].p+=1000;
if(stu[i].banji>80&&stu[i].ganbu=='Y')
stu[i].p+=850;
s+=stu[i].p;
}
m=stu[0].p;
strcpy(c,stu[0].name);
for(i=1;i<n;i++)
if(stu[i].p>m)
{
strcpy(c,stu[i].name);
m=stu[i].p;
}
printf("%s\n",c);
printf("%d\n%d",m,s);
}
|
39
|
19176
|
int main()
{
int n,p,i,j,end[100],class[100],issue[100],k[100],sum=0;
char monitor[100],province[100],name[100][20];
int max;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&name[i],&end[i],&class[i],&monitor[i],&province[i],&issue[i]);
for(i=0;i<n;i++)
k[i]=0;
for(i=0;i<n;i++)
{
if(end[i]>80&&issue[i]>=1) k[i]=k[i]+8000;
if(end[i]>85&&class[i]>80) k[i]=k[i]+4000;
if(end[i]>90) k[i]=k[i]+2000;
if(end[i]>85&&province[i]=='Y') k[i]=k[i]+1000;
if(class[i]>80&&monitor[i]=='Y') k[i]=k[i]+850;
}
max=k[0];
for(i=0;i<n;i++)
sum=sum+k[i];
for(i=0;i<n;i++)
{
if(k[i]>max)
{
max=k[i];
p=i;
}
}
printf("%s\n",name[p]);
printf("%d\n%d",max,sum);
return 0;
}
|
39
|
19177
|
int main()
{
int n,i,sum=0,max=0;
int stu[100],com[100],paper[100],money[100]={0};
char name[100][20];
char cadre[100],west[100];
char best[20];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d\n",name[i],&stu[i],&com[i],&cadre[i],&west[i],&paper[i]);
if (stu[i]>80&&paper[i]>0)
money[i]+=8000;
if (stu[i]>85&&com[i]>80)
money[i]+=4000;
if (stu[i]>90)
money[i]+=2000;
if (stu[i]>85&&west[i]=='Y')
money[i]+=1000;
if (com[i]>80&&cadre[i]=='Y')
money[i]+=850;
if (money[i]>max)
{
max=money[i];
strcpy(best,name[i]);
}
sum+=money[i];
}
printf("%s\n%d\n%d",best,max,sum);
}
|
39
|
19178
|
struct student
{
char name[20];
int GPA;
int val;
char moni;
char west;
int paper;
int scholar;
}stu[100];
void main()
{
int n,i,max=0,sum,k;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].GPA,&stu[i].val,&stu[i].moni,&stu[i].west,&stu[i].paper);
}
for(i=0;i<=n-1;i++)
{
stu[i].scholar=0;
if(stu[i].GPA>80&&stu[i].paper>=1)
stu[i].scholar=stu[i].scholar+8000;
if(stu[i].GPA>85&&stu[i].val>80)
stu[i].scholar=stu[i].scholar+4000;
if(stu[i].GPA>90)
stu[i].scholar=stu[i].scholar+2000;
if(stu[i].GPA>85&&stu[i].west=='Y')
stu[i].scholar=stu[i].scholar+1000;
if(stu[i].val>80&&stu[i].moni=='Y')
stu[i].scholar=stu[i].scholar+850;
}
for(i=0,max=stu[0].scholar,sum=0;i<=n-1;i++)
{
if(stu[i].scholar>max)
{
k=i;
max=stu[i].scholar;
}
sum=sum+stu[i].scholar;
}
printf("%s\n%d\n%d",stu[k].name,stu[k].scholar,sum);
}
|
39
|
19179
|
struct scholarship
{
char name[21];
short mark;
short judge;
char cadre;
char west;
short paper;
int ss;
}stu[100];
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].mark,&stu[i].judge,&stu[i].cadre,&stu[i].west,&stu[i].paper);
stu[i].ss=0;
if(stu[i].mark>80&&stu[i].paper>=1){
stu[i].ss=stu[i].ss+8000;
}
if(stu[i].mark>85&&stu[i].judge>80){
stu[i].ss=stu[i].ss+4000;
}
if(stu[i].mark>90){
stu[i].ss=stu[i].ss+2000;
}
if(stu[i].mark>85&&stu[i].west=='Y'){
stu[i].ss=stu[i].ss+1000;
}
if(stu[i].judge>80&&stu[i].cadre=='Y'){
stu[i].ss=stu[i].ss+850;
}
}
int max=stu[0].ss;
int a=0;
int total=0;
for(i=0;i<n;i++){
if(stu[i].ss>max){
max=stu[i].ss;
a=i;
}
total=total+stu[i].ss;
}
printf("%s\n%d\n%d\n",stu[a].name,stu[a].ss,total);
return 0;
}
|
39
|
19180
|
struct money
{
char name[20];
int qm;
int bj;
char gb;
char xb;
int lw;
}
main()
{
struct money stu[100];
int n,i,p;
long a[100]={0},max=0,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qm,&stu[i].bj,&stu[i].gb,&stu[i].xb,&stu[i].lw);
if(stu[i].qm>80&&stu[i].lw>=1)
a[i]=a[i]+8000;
if(stu[i].qm>85&&stu[i].bj>80)
a[i]=a[i]+4000;
if(stu[i].qm>90)
a[i]=a[i]+2000;
if(stu[i].qm>85&&stu[i].xb=='Y')
a[i]=a[i]+1000;
if(stu[i].bj>80&&stu[i].gb=='Y')
a[i]=a[i]+850;
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
if(max<a[i])
max=a[i];
}
for(i=0;i<n;i++)
if(max==a[i])
{
p=i;
break;
}
printf("%s\n%ld\n%ld",stu[p].name,a[p],sum);
}
|
39
|
19181
|
struct student
{
char name[100];
short int score1;
short int score2;
char x;
char y;
short int num;
int sum;
struct student *next;
};
void main()
{
struct student *p1,*p2,*head;
char name2[100];
int max=0,s=0,i,n;
p1=p2=head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct student *)malloc(sizeof(struct student));
scanf("%s %d %d %c %c %d",p1->name,&p1->score1,&p1->score2,&p1->x,&p1->y,&p1->num);
p1->sum=0;
if(p1->score1>90)
{
p1->sum=2000;
if(p1->score2>80)
{
p1->sum=p1->sum+4000;
if(p1->x=='Y')p1->sum=p1->sum+850;
if(p1->y=='Y')p1->sum=p1->sum+1000;
if(p1->num>=1)p1->sum=p1->sum+8000;
}
else
{
if(p1->num>=1)p1->sum=p1->sum+8000;
if(p1->y=='Y')p1->sum=p1->sum+1000;
}
}
else if(p1->score1>85)
{
if(p1->score2>80)
{
p1->sum=p1->sum+4000;
if(p1->x=='Y')p1->sum=p1->sum+850;
if(p1->y=='Y')p1->sum=p1->sum+1000;
if(p1->num>=1)p1->sum=p1->sum+8000;
}
else
{
if(p1->y=='Y')p1->sum=p1->sum+1000;
if(p1->num>=1)p1->sum=p1->sum+8000;
}
}
else if(p1->score1>80)
{
if(p1->num>=1)p1->sum=p1->sum+8000;
if(p1->score2>80&&p1->x=='Y')p1->sum=p1->sum+850;
}
else if(p1->score2>80&&p1->x=='Y')p1->sum=p1->sum+850;
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
}
p2->next=NULL;
max=head->sum;
p1=head;
while(p1!=NULL)
{
if(p1->sum>max){max=p1->sum;strcpy(name2,p1->name);}
s=s+p1->sum;
p1=p1->next;
}
printf("%s\n%d\n%d\n",name2,max,s);
}
|
39
|
19182
|
struct stu
{
char n[30];
int a;
int b;
char c;
char d;
int e;
int sum;
struct stu *next;
};
void main()
{
int i,n,max=0,sum;
struct stu *head,*p1,*p2;
scanf("%d",&n);
head=p1=p2=(struct stu*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->n,&p1->a,&p1->b,&p1->c,&p1->d,&p1->e);
p1->sum=0;
for(i=0;i<n-1;i++)
{
p1=(struct stu*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->n,&p1->a,&p1->b,&p1->c,&p1->d,&p1->e);
p1->sum=0;
p2->next=p1;
p2=p1;
}
p1->next=NULL;
p1=p2=head;
for(i=0;i<n;i++,p1=p1->next)
{
if(p1->a>80&&p1->e>0)
p1->sum+=8000;
if(p1->a>85&&p1->b>80)
p1->sum+=4000;
if(p1->a>90)
p1->sum+=2000;
if(p1->a>85&&p1->d=='Y')
p1->sum+=1000;
if(p1->b>80&&p1->c=='Y')
p1->sum+=850;
}
p1=head;
for(i=0;i<n;i++,p1=p1->next)
{
if(max<p1->sum)
max=p1->sum;
}
p1=head;
sum=0;
for(i=0;i<n;i++,p1=p1->next)
{
sum+=p1->sum;
}
p1=head;
for(i=0;i<n;i++,p1=p1->next)
{
if(p1->sum==max)
{
printf("%s\n%d\n",p1->n,p1->sum);
break;
}
}
printf("%d",sum);
}
|
39
|
19183
|
struct studen{char name[100];int score1;int score2; char H;char W;int paper;int money;}stu[200];
int main()
{
int n,i,j,money=0,student,scholar=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].score1,&stu[i].score2,&stu[i].H,&stu[i].W,&stu[i].paper);
stu[i].money=0;
if(stu[i].score1>80&&stu[i].paper>0)
stu[i].money+=8000;
if(stu[i].score1>85&&stu[i].score2>80)
stu[i].money+=4000;
if(stu[i].score1>90)
stu[i].money+=2000;
if(stu[i].score1>85&&stu[i].W=='Y')
stu[i].money+=1000;
if(stu[i].score2>80&&stu[i].H=='Y')
stu[i].money+=850;
}
for(i=0;i<n;i++)
{
if(stu[i].money>money)
{
student=i;
money=stu[i].money;
}
scholar=scholar+stu[i].money;
}
printf("%s\n%d\n%d\n",stu[student].name,stu[student].money,scholar);
return 0;
}
|
39
|
19184
|
struct student
{
char name[1000];
int final;
int aver;
char xshe;
char xb;
int paper;
int score;
struct student *next;
};
int num;
struct student *creat(void)
{
struct student *head,*p1,*p2;
int i,n;
n=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->final,&p1->aver,&p1->xshe,&p1->xb,&p1->paper);
p1->score=0;
head=NULL;
while(n<num-1)
{
n++;
if(n==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->final,&p1->aver,&p1->xshe,&p1->xb,&p1->paper);
p1->score=0;
}
p2->next=p1;
p1->next=NULL;
return (head);
}
void main()
{
struct student *head,*p1,*p2,*p,*max;
int sum=0;
scanf("%d",&num);
head=creat();
p=p1=p2=head;
for(;p!=NULL;p=p->next)
{
if((p->aver)>80&&p->xshe=='Y')
p->score=p->score+850;
if((p->final)>80&&(p->paper)>=1)
p->score=p->score+8000;
if((p->final)>85&&(p->aver)>80)
p->score=p->score+4000;
if((p->final)>90)
p->score=p->score+2000;
if((p->final)>85&&(p->xb)=='Y')
p->score=p->score+1000;
}
max=p=head;
for(;p!=NULL;p=p->next)
{
if((p->score)>max->score)
max=p;
sum=sum+p->score;
}
printf("%s\n%d\n%d\n",max->name,max->score,sum);
}
|
39
|
19185
|
typedef struct
{
char name[100];
int qm,py;
char gb,xb;
int lw;
int jxj;
} student;
student cl[200];
int sum,n;
void wsj(int k);
void yxj(int k);
void xbj(int k);
void gxj(int k);
void ysj(int k)
{
if(cl[k].qm>80&&cl[k].lw>0)
{
cl[k].jxj+=8000;
sum+=8000;
}
wsj(k);
}
void wsj(int k)
{
if(cl[k].qm>85&&cl[k].py>80)
{
cl[k].jxj+=4000;
sum+=4000;
}
yxj(k);
}
void yxj(int k)
{
if(cl[k].qm>90)
{
cl[k].jxj+=2000;
sum+=2000;
}
xbj(k);
}
void xbj(int k)
{
if(cl[k].qm>85&&cl[k].xb=='Y')
{
cl[k].jxj+=1000;
sum+=1000;
}
gxj(k);
}
void gxj(int k)
{
if(cl[k].py>80&&cl[k].gb=='Y')
{
cl[k].jxj+=850;
sum+=850;
}
}
int main()
{
int i,max=0,maxn;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",cl[i].name,&cl[i].qm,&cl[i].py,&cl[i].gb,&cl[i].xb,&cl[i].lw);
ysj(i);
if(cl[i].jxj>max)
{
max=cl[i].jxj;
maxn=i;
}
}
printf("%s\n%d\n%d",cl[maxn].name,cl[maxn].jxj,sum);
return 0;
}
|
39
|
19186
|
int main() {
struct stu1{
char name[30];
int scor;
int grad;
char as;
char xi;
int num;
int reward;
} stu[100], temp;
int n, i, re=0;
char hhh;
scanf("%d" ,&n);
for(i=0;i<n;i++) {
scanf("%s%d%d%c%c%c%c%d", stu[i].name, &stu[i].scor, &stu[i].grad, &hhh,&stu[i].as,&stu[i].xi,&stu[i].xi, &stu[i].num);
stu[i].reward=0;
if(stu[i].scor>80&&stu[i].num>=1) {
stu[i].reward+=8000;
}
if(stu[i].scor>85&&stu[i].grad>80) {
stu[i].reward+=4000;
}
if(stu[i].scor>90) {
stu[i].reward+=2000;
}
if(stu[i].scor>85&&stu[i].xi=='Y') {
stu[i].reward+=1000;
}
if(stu[i].grad>80&&stu[i].as=='Y') {
stu[i].reward+=850;
}
}
temp=stu[0];
for(i=0;i<n;i++) {
if(stu[i].reward>temp.reward) {
temp=stu[i];
}
}
for(i=0;i<n;i++) {
re+=stu[i].reward;
}
printf("%s\n%d\n%d", temp.name, temp.reward, re);
return 0;
}
|
39
|
19187
|
void main()
{
struct student
{
char name[100];
int marka;
int markb;
char ganbu;
char xibu;
int c;
}stu[100];
int n,i,j,max,sum=0;
int money[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].marka,&stu[i].markb,&stu[i].ganbu,&stu[i].xibu,&stu[i].c);
}
for(i=0;i<n;i++)
{
if(stu[i].marka>80&&stu[i].c>0)
{
money[i]=money[i]+8000;
}
if(stu[i].marka>85&&stu[i].markb>80)
{
money[i]=money[i]+4000;
}
if(stu[i].marka>90)
{
money[i]=money[i]+2000;
}
if(stu[i].marka>85&&stu[i].xibu=='Y')
{
money[i]=money[i]+1000;
}
if(stu[i].markb>80&&stu[i].ganbu=='Y')
{
money[i]=money[i]+850;
}
}
max=0;
for(i=1;i<n;i++)
{
if(money[i]>money[max])
max=i;
}
for(i=0;i<n;i++)
sum=sum+money[i];
printf("%s\n",stu[max].name);
printf("%d\n",money[max]);
printf("%d\n",sum);
}
|
39
|
19188
|
int main()
{
char x[20],y[20],k,l;
int n,a,b,c,sum,i,j,max=0,max2=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",x,&a,&b,&k,&l,&c);
sum=0;
if ((a>80) && (c!=0))
sum=sum+8000;
if ((a>85) && (b>80))
sum=sum+4000;
if (a>90)
sum=sum+2000;
if ((a>85) && (l=='Y'))
sum=sum+1000;
if ((b>80) && (k=='Y'))
sum=sum+850;
if (sum>max)
{
max=sum;
for(j=0;j<20;j++)
y[j]=x[j];
}
max2=max2+sum;
}
printf("%s\n%d\n%d\n",y,max,max2);
return 0;
}
|
39
|
19189
|
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(LEN);
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(LEN);
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 main()
{
int n;
struct student *head;
scanf("%d",&n);
head=creat(n);
print(head);
}
|
39
|
19190
|
struct student
{char name[20];
int test;
int judge;
char leader;
char west;
int paper;
};struct student stu[100];
void main()
{int m=0,n,i;
long sum,t=0,a[100]={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].judge,&stu[i].leader,&stu[i].west,&stu[i].paper);
}
for(sum=0,i=0;i<n;i++)
{if(stu[i].test>80&&stu[i].paper>0) {a[i]=a[i]+8000;}
if(stu[i].test>85&&stu[i].judge>80) {a[i]=a[i]+4000;}
if(stu[i].test>90) {a[i]=a[i]+2000;}
if(stu[i].test>85&&(stu[i].west=='Y')) {a[i]=a[i]+1000;}
if(stu[i].judge>80&&(stu[i].leader=='Y') ) {a[i]=a[i]+850;}
sum=sum+a[i];
if(a[i]>t) {t=a[i];m=i;}
}
printf("%s\n",stu[m].name);
printf("%ld\n",t);
printf("%ld\n",sum);
}
|
39
|
19191
|
int main()
{
int N,i;
int Endmark[100],Classmark[100],Essay[100],award[100]={0},sum=0,BP,X;
char Name[100][21],Zone[100],Leader[100];
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%s %d %d %c %c %d",Name[i],&Endmark[i],&Classmark[i],&Leader[i],&Zone[i],&Essay[i]);
if(Endmark[i]>80&&Essay[i]>0){
award[i]+=8000;
}
if(Endmark[i]>85&&Classmark[i]>80){
award[i]+=4000;
}
if(Endmark[i]>90){
award[i]+=2000;
}
if(Endmark[i]>85&&Zone[i]=='Y'){
award[i]+=1000;
}
if(Classmark[i]>80&&Leader[i]=='Y'){
award[i]+=850;
}
sum+=award[i];
}
BP=award[0];
X=0;
for(i=0;i<N;i++){
if(award[i]>BP){
BP=award[i];
X=i;
}
}
printf("%s\n",Name[X]);
printf("%d\n",award[X]);
printf("%d\n",sum);
return 0;
}
|
39
|
19192
|
int main()
{
int n,i,max=0,sum=0,t;
scanf("%d",&n);
struct student
{
char name[20];
int ascore;
int bscore;
char good;
char west;
int work;
int money;
}stu[100];
for(i=0;i<n;i++)
stu[i].money=0;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].ascore,&stu[i].bscore,&stu[i].good,&stu[i].west,&stu[i].work);
}
i=0;
for(i=0;i<n;i++)
{
if(stu[i].ascore>80&&stu[i].work>=1)
stu[i].money=stu[i].money+8000;
if(stu[i].ascore>85&&stu[i].bscore>80)
stu[i].money=stu[i].money+4000;
if(stu[i].ascore>90)
stu[i].money=stu[i].money+2000;
if(stu[i].ascore>85&&stu[i].west=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].bscore>80&&stu[i].good=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0;i<n;i++)
sum=sum+stu[i].money;
i=0;
for(i=0;i<n-1;i++)
{
if(stu[i].money>max)
{
max=stu[i].money;
t=i;
}
}
printf("%s\n%d\n%d\n",stu[t].name,stu[t].money,sum);
}
|
39
|
19193
|
int n;
struct stu{char name[21];int g1;int g2;char y1;char y2;int g3;int g;struct stu *next;};
struct stu *cr(void)
{struct stu *head;
struct stu *p1,*p2;
int i;
p1=p2=(struct stu*)malloc(LEN);
for(i=0;i<n;i++)
{if(i==0) head=p1;
else p2->next=p1;
p2=p1;
scanf("%s %d %d %c %c %d",&p1->name,&p1->g1,&p1->g2,&p1->y1,&p1->y2,&p1->g3);
p1->g=(p1->g1/81)*((p1->g3+10)/11)*8000+(p1->g1/86)*(p1->g2/81)*4000+(p1->g1/91)*2000+(p1->g1/86)*(p1->y2/81)*1000+(p1->g2/81)*(p1->y1/81)*850;
p1=(struct stu*)malloc(LEN);
}
p2->next=NULL;
return (head);
}
int main()
{int i,max=0,sum=0;
struct stu *p,*q;
scanf("%d",&n);
p=q=cr();
for(i=0;i<n;i++)
{if((p->g)>max) max=p->g;
sum=sum+p->g;
p=p->next;}
for(i=0;i<n;i++)
{if((q->g)==max) {printf("%s\n%d\n%d\n",q->name,q->g,sum); break;}
q=q->next;}
}
|
39
|
19194
|
struct student
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int paper;
}stu[100];
void main()
{
int n,i,s[100]={0},sum=0,k,max;
struct student *p;
scanf("%d",&n);
for(p=stu,i=0;p<stu+n;p++,i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->qimo,&p->banji,&p->ganbu,&p->xibu,&p->paper);
if(p->qimo>80&&p->paper>=1)
s[i]+=8000;
if(p->qimo>85&&p->banji>80)
s[i]+=4000;
if(p->qimo>90)
s[i]+=2000;
if(p->qimo>85&&p->xibu=='Y')
s[i]+=1000;
if(p->banji>80&&p->ganbu=='Y')
s[i]+=850;
}
max=s[0];
for(i=0;i<n;i++)
{
sum+=s[i];
if(s[i]>max)
{
max=s[i];
k=i;
}
}
printf("%s\n%d\n%d\n",stu[k].name,s[k],sum);
}
|
39
|
19195
|
struct asd
{
char str[21];
int a;
int b;
int c;
int sum;
char x;
char y;
}stu[100];
void main()
{
int i,n,max,m,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d", stu[i].str, &stu[i].a, &stu[i].b, &stu[i].x, &stu[i].y, &stu[i].c);
stu[i].sum=0;
}
for(i=0;i<n;i++)
{
if(stu[i].a>80 && stu[i].c>0)
stu[i].sum+=8000;
if(stu[i].a>85 && stu[i].b>80)
stu[i].sum+=4000;
if(stu[i].a>90)
stu[i].sum+=2000;
if(stu[i].a>85 && stu[i].y=='Y')
stu[i].sum+=1000;
if(stu[i].b>80 && stu[i].x=='Y')
stu[i].sum+=850;
}
m=0;
for(i=0;i<n;i++)
{
m+=stu[i].sum;
}
max=0;t=0;
for(i=0;i<n;i++)
{
if(stu[i].sum>max)
{max=stu[i].sum;t=i;}
}
printf("%s\n%d\n%d\n", stu[t].str, max, m);
}
|
39
|
19196
|
int main()
{
int n,e,f,h,j,k,max=0,l=0,s=0,i;
scanf("%d",&n);
struct xinxi{
char name[50];
int qc;// ???? //
int bc;// ???? //
char g;// ?????? //
char w;// ??????? //
int ls;//????//
}a[100];
int score[100]={0};
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&a[i].name,&a[i].qc,&a[i].bc,&a[i].g,&a[i].w,&a[i].ls);
e=f=h=j=k=0;
if(a[i].qc>80 && a[i].ls>=1)
e=8000;
if(a[i].qc>85 && a[i].bc>80)
f=4000;
if(a[i].qc>90)
h=2000;
if(a[i].qc>85 && a[i].w=='Y')
j=1000;
if(a[i].bc>80 && a[i].g=='Y')
k=850;
score[i]=e+f+h+j+k;
s=s+score[i];
if (max<score[i])
max=score[i];
}
for(i=0;i<n;i++){
if(max==score[i]){
printf("%s\n",a[i].name);
printf("%d\n",max);
printf("%d\n",s);
l++;
}
if(l>0)
break;
}
return 0;
}
|
39
|
19197
|
int main()
{
struct student
{
char name[20];
int mark1;
int mark2;
int number;
char a[2];
char b[2];
};
int i,m,n[100],p=0,q=0,w=0;
scanf("%d",&m);
struct student stu[100];
for(i=0;i<m;i++)
{
scanf("%s ",stu[i].name);
scanf("%d ",&stu[i].mark1);
scanf("%d ",&stu[i].mark2);
scanf("%s ",&stu[i].a);
scanf("%s ",&stu[i].b);
scanf("%d",&stu[i].number);
}
for(i=0;i<m;i++)
{ n[i]=0;
if(stu[i].mark1>80&&stu[i].number>=1)
n[i]+=8000;
if(stu[i].mark1>85&&stu[i].mark2>80)
n[i]+=4000;
if(stu[i].mark1>90)
n[i]+=2000;
if(stu[i].mark1>85&&stu[i].b[0]=='Y')
n[i]+=1000;
if(stu[i].mark2>80&&stu[i].a[0]=='Y')
n[i]+=850;
}
for(i=0;i<m;i++)
{
if(n[i]>p)
{
p=n[i];
w=i;
}
q=q+n[i];
}
printf("%s\n",stu[w].name);
printf("%d\n",n[w]);
printf("%d\n",q);
return 0;
}
|
39
|
19198
|
struct stu{
char name[20];
int final;
int cla;
char ban[2];
char xi[2];
int pap;
int sum;
}a[100];
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",a[i].name);
scanf("%d%d",&a[i].final,&a[i].cla);
scanf("%s",a[i].ban);
scanf("%s",a[i].xi);
scanf("%d",&a[i].pap);
}
for(i=0;i<n;i++){
a[i].sum=0;
if(a[i].final>80&&a[i].pap>=1)
a[i].sum=a[i].sum+8000;
if(a[i].final>85&&a[i].cla>80)
a[i].sum=a[i].sum+4000;
if(a[i].final>90)
a[i].sum=a[i].sum+2000;
if(a[i].final>85&&a[i].xi[0]=='Y')
a[i].sum=a[i].sum+1000;
if(a[i].cla>80&&a[i].ban[0]=='Y')
a[i].sum=a[i].sum+850;
}
int max=a[0].sum;
int t=0,zong=0;
for(i=0;i<n;i++){
if(max<a[i].sum){
max=a[i].sum;
t=i;
}
zong=zong+a[i].sum;
}
printf("%s\n%d\n%d\n",a[t].name,a[t].sum,zong);
return 0;
}
|
39
|
19199
|
/*????????*/
void main()
{
int n,k,x[100][4],y,z;
char a[100][20],b[100],c[100];
scanf("%d",&n);
for(k=0,y=0,z=0;k<n;k++)
{
scanf("%s %d %d %c %c %d",a[k],&x[k][0],&x[k][1],&b[k],&c[k],&x[k][2]);
x[k][3]=0;
if(x[k][0]>80&&x[k][2]>0)
{
x[k][3]=x[k][3]+8000;
}
if(x[k][0]>85&&x[k][1]>80)
{
x[k][3]=x[k][3]+4000;
}
if(x[k][0]>90)
{
x[k][3]=x[k][3]+2000;
}
if(x[k][0]>85&&c[k]=='Y')
{
x[k][3]=x[k][3]+1000;
}
if(x[k][1]>80&&b[k]=='Y')
{
x[k][3]=x[k][3]+850;
}
z=z+x[k][3];
if(x[k][3]>x[y][3])y=k;
}
printf("%s\n%d\n%d\n",a[y],x[y][3],z);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.