label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
39
|
19200
|
struct s
{char name[20];
int q;
int b;
char x;
char w;
int l;
};
void main()
{
struct s stu[100];
int n,i,p,m[100],j;
double t=0.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].b,&stu[i].x,&stu[i].w,&stu[i].l);
m[i]=0;
if(stu[i].q>80&&stu[i].l!=0)m[i]=m[i]+8000;
if(stu[i].q>85&&stu[i].b>80)m[i]=m[i]+4000;
if(stu[i].q>90)m[i]=m[i]+2000;
if(stu[i].q>85&&stu[i].w=='Y')m[i]=m[i]+1000;
if(stu[i].b>80&&stu[i].x=='Y')m[i]=m[i]+850;
}
p=m[0];
for(i=0;i<n;i++)
{
if(p<m[i])
{
p=m[i];
j=i;
}
t=m[i]+t;
}
printf("%s\n",stu[j].name);
printf("%d\n%.0f\n",p,t);
}
|
39
|
19201
|
struct student
{
char name[30];
int qimocj;
int banjicj;
char ganbu;
char xibu;
int lunwen;
int jiangjin;
};
int main()
{
int n,i,sum=0;
struct student ren[102]={0},max={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",ren[i].name,&ren[i].qimocj,&ren[i].banjicj,&ren[i].ganbu,&ren[i].xibu,&ren[i].lunwen);
}
for(i=0;i<n;i++)
{
if(ren[i].qimocj>80 && ren[i].lunwen>=1)
{
ren[i].jiangjin+=8000;
}
if(ren[i].qimocj>85 && ren[i].banjicj>80)
{
ren[i].jiangjin+=4000;
}
if(ren[i].qimocj>90)
{
ren[i].jiangjin+=2000;
}
if(ren[i].qimocj>85 && ren[i].xibu=='Y')
{
ren[i].jiangjin+=1000;
}
if(ren[i].banjicj>80 && ren[i].ganbu=='Y')
{
ren[i].jiangjin+=850;
}
}
max.jiangjin=0;
for(i=0;i<n;i++)
{
sum+=ren[i].jiangjin;
if(ren[i].jiangjin>max.jiangjin)
{
max=ren[i];
}
}
printf("%s\n%d\n%d\n",max.name,max.jiangjin,sum);
return 0;
}
|
39
|
19202
|
int main()
{
int n,i,sum=0,k=0,t;
struct point{char name[21],ganbu,xibu;int x,y,z,money;}stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].x,&stu[i].y,&stu[i].ganbu,&stu[i].xibu,&stu[i].z);
stu[i].money=0;
if(stu[i].x>80&&stu[i].z>0)
{
stu[i].money+=8000;
sum+=8000;
}
if(stu[i].x>85&&stu[i].y>80)
{
stu[i].money+=4000;
sum+=4000;
}
if(stu[i].x>90)
{
stu[i].money+=2000;
sum+=2000;
}
if(stu[i].x>85&&stu[i].xibu=='Y')
{
stu[i].money+=1000;
sum+=1000;
}
if(stu[i].y>80&&stu[i].ganbu=='Y')
{
stu[i].money+=850;
sum+=850;
}
}
for(i=0;i<n;i++)
{
if(stu[i].money>k)
{
k=stu[i].money;
t=i;
}
}
printf("%s\n",stu[t].name);
printf("%d\n",stu[t].money);
printf("%d",sum);
return 0;
}
|
39
|
19203
|
struct student
{
char name[20];
int qimo;
int banpin;
char ganbu;
char xibu;
int lunwen;
double sum;
}stu[100];
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].qimo,&stu[i].banpin,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
stu[i].sum=0;
if(stu[i].qimo>80&&stu[i].lunwen>0)stu[i].sum=stu[i].sum+8000;
if(stu[i].qimo>85&&stu[i].banpin>80)stu[i].sum=stu[i].sum+4000;
if(stu[i].qimo>90)stu[i].sum=stu[i].sum+2000;
if(stu[i].xibu=='Y'&&stu[i].qimo>85)stu[i].sum=stu[i].sum+1000;
if(stu[i].ganbu=='Y'&&stu[i].banpin>80)stu[i].sum=stu[i].sum+850;
}
int max=0,totalsum=0;
for(i=0;i<n;i++)
{if(stu[i].sum>max)max=stu[i].sum;}
for(i=0;i<n;i++)
{if(stu[i].sum==max){printf("%s\n",stu[i].name);break;}}
for(i=0;i<n;i++)
{
totalsum=totalsum+stu[i].sum;
}
printf("%d\n%d",max,totalsum);
}
|
39
|
19204
|
int main()
{
int i,n,sum=0;
scanf("%d",&n);
typedef struct{
char name[20];
char ganbu;
char xibu;
int qimo;
int qizhong;
int lunwen;
int money;
}jiangxuejin;
jiangxuejin a[100];
jiangxuejin *p,*max;
max=a;
for(p=a;p<a+n;p++)
{
p->money=0;
scanf("%s %d %d %c %c %d",&p->name,&p->qimo,&p->qizhong,&p->ganbu,&p->xibu,&p->lunwen);
if((p->qimo>80)&&(p->lunwen>=1))
(p->money)+=8000;
if((p->qimo>85)&&(p->qizhong>80))
(p->money)+=4000;
if(p->qimo>90)
(p->money)+=2000;
if((p->qimo>85)&&(p->xibu=='Y'))
(p->money)+=1000;
if((p->qizhong>80)&&(p->ganbu=='Y'))
(p->money)+=850;
if(p->money>max->money)
max=p;
sum+=p->money;
}
printf("%s\n%d\n%d",max->name,max->money,sum);
}
|
39
|
19205
|
struct stu
{
char name[20];
int mark1;
int mark2;
char position;
char hometown;
int paper;
int fund;
struct stu *next;
};
struct stu *creat(int n)
{
int i=1;
struct stu *head;
struct stu *p1,*p2;
p1=(struct stu *)malloc(sizeof(struct stu));
scanf(A,p1->name,&p1->mark1,&p1->mark2,&p1->position,&p1->hometown,&p1->paper);
p1->fund=0;
if(n==1)
{
head=p1;
p1->next=NULL;
free(p1);
return head;
}
else
{
head=p1;
p2=p1;
do
{
p1=(struct stu *)malloc(sizeof(struct stu));
scanf(A,p1->name,&p1->mark1,&p1->mark2,&p1->position,&p1->hometown,&p1->paper);
p1->fund=0;
i++;
if(i==n)
{
p1->next=NULL;
p2->next=p1;
break;
}
else
{
p2->next=p1;
p2=p1;
}
}while(1);
return head;
}
}
int main(void)
{
int n,i,j=0,max=0;
struct stu *head;
struct stu *p;
scanf("%d",&n);
head=creat(n);
p=head;
while(p)
{
if(p->mark1>80&&p->paper>0)
p->fund+=8000;
if(p->mark1>85&&p->mark2>80)
p->fund+=4000;
if(p->mark1>90)
p->fund+=2000;
if(p->mark1>85&&p->hometown=='Y')
p->fund+=1000;
if(p->mark2>80&&p->position=='Y')
p->fund+=850;
p=p->next;
}
p=head;
while(p)
{
/*printf("%d %d\n",p->fund,i);*/
j+=p->fund;
if(p->fund>max)
max=p->fund;
p=p->next;
}
p=head;
while(p)
if(max==p->fund)
{
printf("%s\n%d\n%d\n",p->name,p->fund,j);
break;
}
else p=p->next;
}
|
39
|
19206
|
int main()
{
struct data
{
char name[22];
int score1;
int score2;
char mas;
char dis;
int paper;
int sum;
}p[100];
int n;
scanf("%d",&n);
int i = 0 ;
for ( i = 0 ; i < n ; i++ )
{
scanf("%s",p[i].name);
scanf("%d",&(p[i].score1));
scanf("%d",&(p[i].score2));
getchar();
scanf("%c",&(p[i].mas));
getchar();
scanf("%c",&(p[i].dis));
scanf("%d",&(p[i].paper));
}
for ( i = 0 ; i < n ; i++ )
{
p[i].sum = 0;
}
int k = 0;
int max = 0;
int total = 0;
for ( i = 0 ; i < n ; i++ )
{
if ( p[i].score1 > 80 && p[i].paper >= 1 )
{
p[i].sum += 8000;
}
if ( p[i].score1 > 85 && p[i].score2 > 80)
{
p[i].sum += 4000;
}
if ( p[i].score1 > 90 )
{
p[i].sum += 2000;
}
if ( p[i].score1 > 85 && p[i].dis == 'Y' )
{
p[i].sum += 1000;
}
if ( p[i].score2 > 80 && p[i].mas == 'Y' )
{
p[i].sum += 850;
}
total += p[i].sum;
if ( p[i].sum > max )
{
max = p[i].sum;
k = i;
}
}
printf("%s\n",p[k].name);
printf("%d\n",max);
printf("%d\n",total);
return 0;
}
|
39
|
19207
|
int main()
{
int i,n,j,r,t,m,q=0;
int a[101];
struct student {
char name[20];
int zong;
int ban;
char gan;
char xi;
int lun;
int z;
}stu[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].zong,&stu[i].ban,&stu[i].gan,&stu[i].xi,&stu[i].lun);
}
for(i=1;i<=n;i++)
{ stu[i].z=0;
if(stu[i].zong>80&&stu[i].lun>0)
stu[i].z=stu[i].z+8000;
if(stu[i].zong>85&&stu[i].ban>80)
stu[i].z=stu[i].z+4000;
if(stu[i].zong>90)
stu[i].z=stu[i].z+2000;
if(stu[i].zong>85&&stu[i].xi=='Y')
stu[i].z=stu[i].z+1000;
if(stu[i].ban>80&&stu[i].gan=='Y')
stu[i].z=stu[i].z+850;
a[i]=stu[i].z;
q=q+stu[i].z;
}
for(j=n;j>0;j--)
{ for(r=0;r<j;r++)
if(stu[r].z>stu[r+1].z)
{t=stu[r+1].z;
stu[r+1].z=stu[r].z;
stu[r].z=t;
}
}
for(i=1;i<=n;i++)
if(a[i]==stu[n].z)
{ m=i;
break;
}
printf("%s\n%d\n%d\n",stu[m].name,stu[n].z,q);
return 0;
}
|
39
|
19208
|
int main()
{
int n;
scanf("%d",&n);
struct student
{
char name[20];
int scores1,scores2,paper;
char a,b;
}s[100];
int p[100];
int i;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&s[i].name,&s[i].scores1,&s[i].scores2,&s[i].a,&s[i].b,&s[i].paper);
}
int sum;
for(i=0;i<n;i++)
{
sum=0;
if(s[i].scores1>80&&s[i].paper>=1)
{
sum+=8000;
}
if(s[i].scores1>85&&s[i].scores2>80)
{
sum+=4000;
}
if(s[i].scores1>90)
{
sum+=2000;
}
if(s[i].scores1>85&&s[i].b=='Y')
{
sum+=1000;
}
if(s[i].scores2>80&&s[i].a=='Y')
{
sum+=850;
}
p[i]=sum;
}
int max=0,c=0;
for(i=0;i<n;i++)
{
if(p[i]>=max)
{
max=p[i];
}
c+=p[i];
}
for(i=0;i<n;i++)
{
if(p[i]==max)
{
printf("%s\n%d\n%d\n",s[i].name,p[i],c);
break;
}
}
return 0;
}
|
39
|
19209
|
struct student
{
char name[20];
int test;
int term;
char key;
char west;
int art;
int money;
}person[100];
int main()
{
int n,i,j,q=0,k;
struct student temp;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s %d %d %c %c %d",person[i].name,&person[i].test,&person[i].term,&person[i].key,&person[i].west,&person[i].art);
person[i].money=0;
if(person[i].art>0&&person[i].test>80) {person[i].money=person[i].money+8000;}
if(person[i].test>85&&person[i].term>80) {person[i].money=person[i].money+4000;}
if(person[i].test>90) {person[i].money=person[i].money+2000;}
if(person[i].test>85&&person[i].west=='Y') {person[i].money=person[i].money+1000;}
if(person[i].term>80&&person[i].key=='Y') {person[i].money=person[i].money+850;}
q=q+person[i].money;
}
for(i=0;i<=n-2;i++)
{
k=i;
for(j=i+1;j<=n-1;j++)
if(person[j].money>person[k].money)
k=j;
temp=person[k]; person[k]=person[i];person[i]=temp;
}
printf("%s\n",person[0].name);
printf("%d\n",person[0].money);
printf("%d",q);
return 0;
}
|
39
|
19210
|
int main()
{struct student
{char name[20],o,w;
int score,cla,paper;
}n[100];
int t=0,N,i,j,m[100],e[100],k;
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;i++)
{m[i]=0;
if(n[i].cla>80&&n[i].o=='Y') m[i]+=850;
if(n[i].score>85&&n[i].w=='Y') m[i]+=1000;
if(n[i].score>90) m[i]+=2000;
if(n[i].score>85&&n[i].cla>80) m[i]+=4000;
if(n[i].score>80&&n[i].paper) m[i]+=8000;}
for(i=0;i<N;i++)
e[i]=i;
for(i=0;i<N;i++)
for(j=i;j<N;j++)
{if(m[e[i]]<m[e[j]]) {k=e[i];e[i]=e[j];e[j]=k;}}
printf("%s\n%d\n",n[e[0]].name,m[e[0]]);
for(i=0;i<N;i++)
t+=m[i];
printf("%d",t);
return 0;}
|
39
|
19211
|
struct student
{
char name[22];
int qimo;
int banji;
char gan;
char sheng;
int num;
};
void main()
{
int n,i,j=0,sum,tol=0,max=0;
struct student t,*s;
scanf("%d",&n);
s=(struct student *)malloc(n*sizeof(struct student));
for(i=0;i<n;i++)
{ sum=0;
scanf("%s %d %d %c %c %d",(*(s+i)).name,&(*(s+i)).qimo,&(*(s+i)).banji,&(*(s+i)).gan,&(*(s+i)).sheng,&(*(s+i)).num);
if (((*(s+i)).qimo>80)&&((*(s+i)).num>=1)) sum=sum+8000;
if (((*(s+i)).qimo>85)&&((*(s+i)).banji>80)) sum=sum+4000;
if ((*(s+i)).qimo>90) sum=sum+2000;
if (((*(s+i)).qimo>85)&&((*(s+i)).sheng=='Y')) sum=sum+1000;
if (((*(s+i)).banji>80)&&((*(s+i)).gan=='Y')) sum=sum+850;
if(sum>max) {max=sum;j=i;}
tol=tol+sum;
}
printf("%s\n%d\n%d\n",(*(s+j)).name,max,tol);
}
|
39
|
19212
|
int main(int argc, char* argv[])
{
char name[100][100];
char s[2], w[2];
int a, b, c;
int n, sum[100], sum1=0, i, f=-1, g=0, j;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d", name[i], &a, &b, s, w, &c);
sum[i] = 0;
if(a>80 && c!=0)
{
sum[i] += 8000;
sum1 += 8000;
}
if(a>85 && b>80)
{
sum[i] += 4000;
sum1 += 4000;
}
if(a>90)
{
sum[i] += 2000;
sum1 += 2000;
}
if(a>85 && w[0]=='Y')
{
sum[i] += 1000;
sum1 += 1000;
}
if(b>80 && s[0]=='Y')
{
sum[i] += 850;
sum1 += 850;
}
}
for(j=0;j<n;j++)
{
if(sum[j]>f)
{
f=sum[j];
g=j;
}
}
printf("%s\n", name[g]);
printf("%d\n", f);
printf("%d\n", sum1);
return 0;
}
|
39
|
19213
|
struct point
{
char a[20];
int x;
int y;
char xue;
char xi;
int z;
int sum;
};
int main(int argc, char* argv[])
{
int n,i,max=0,m=0,gong=0;
scanf("%d",&n);
struct point *s;
s=(struct point*)malloc(sizeof(struct point)*n);
for(i=0;i<n;i++)
{
s[i].sum=0;
scanf("%s %d %d %c %c %d",s[i].a,&s[i].x,&s[i].y,&s[i].xue,&s[i].xi,&s[i].z);
}
for(i=0;i<n;i++)
{
if(s[i].x>80&&s[i].z>=1) s[i].sum=s[i].sum+8000;
if(s[i].x>85&&s[i].y>80) s[i].sum=s[i].sum+4000;
if(s[i].x>90) s[i].sum=s[i].sum+2000;
if(s[i].x>85&&s[i].xi=='Y') s[i].sum=s[i].sum+1000;
if(s[i].y>80&&s[i].xue=='Y') s[i].sum=s[i].sum+850;
}
for(i=0;i<n;i++)
{
if(s[i].sum>max)
{max=s[i].sum;m=i;}
}
printf("%s\n",s[m].a);
printf("%d\n",max);
for(i=0;i<n;i++)
{
gong=gong+s[i].sum;
}
printf("%d\n",gong);
free (s);
return 0;
}
|
39
|
19214
|
struct stu
{
char str[30];
int a,b;
char s1,s2;
int c;
int e;
}sm[1000];
void main()
{
int t,i,max,sum;
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%s%d%d %c %c%d",sm[i].str,&sm[i].a,&sm[i].b,&sm[i].s1,&sm[i].s2,&sm[i].c);
sm[i].e=0;
}
for(i=0;i<t;i++)
{ if((sm[i].a)>80&&(sm[i].c)>=1)
{
(sm[i].e)=(sm[i].e)+8000;
}
if((sm[i].a)>85&&(sm[i].b)>80)
{
(sm[i].e)=(sm[i].e)+4000;
}
if((sm[i].a)>90)
{
(sm[i].e)=(sm[i].e)+2000;
}
if((sm[i].a)>85&&(sm[i].s2)=='Y')
{
(sm[i].e)=(sm[i].e)+1000;
}
if((sm[i].b)>80&&(sm[i].s1)=='Y')
{
(sm[i].e)=(sm[i].e)+850;
}
}
max=sm[0].e;
sum=sm[0].e;
for(i=1;i<t;i++)
{
if(max<sm[i].e)
max=sm[i].e;
sum=sum+sm[i].e;
}
for(i=0;i<t;i++)
{
if(sm[i].e==max)
{
printf("%s\n%d\n",sm[i].str,sm[i].e);
break;
}
}
printf("%d",sum);
}
|
39
|
19215
|
struct student
{
char name[20];
int fs;
int cs;
char gb;
char xb;
int paper;
int sch;
}stu[100];
int ys(int a,int b);
int ws(int a,int b);
int cj(int a);
int xibu(int a,char b);
int bj(int a,char b);
int main()
{
int n=0,i=0,sum=0,k=0,j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].fs,&stu[i].cs,&stu[i].gb,&stu[i].xb,&stu[i].paper);
stu[i].sch=0;
}
for(i=0;i<n;i++)
{
if(ys(stu[i].fs,stu[i].paper)==1)
{
stu[i].sch+=8000;
sum+=8000;
}
if(ws(stu[i].fs,stu[i].cs)==1)
{
stu[i].sch+=4000;
sum+=4000;
}
if(cj(stu[i].fs)==1)
{
stu[i].sch+=2000;
sum+=2000;
}
if(xibu(stu[i].fs,stu[i].xb)==1)
{
stu[i].sch+=1000;
sum+=1000;
}
if(bj(stu[i].cs,stu[i].gb)==1)
{
stu[i].sch+=850;
sum+=850;
}
}
k=stu[0].sch;
for(i=0;i<n;i++)
{
if(k<stu[i].sch)
{
j=i;
k=stu[i].sch;
}
}
printf("%s\n%d\n%d",stu[j].name,stu[j].sch,sum);
return 0;
}
int ys(int a,int b)
{
if(a>80&&b>=1)
{return 1;}
else return 0;
}
int ws(int a,int b)
{
if(a>85&&b>80)
{return 1;}
else return 0;
}
int cj(int a)
{
if(a>90)
{return 1;}
else return 0;
}
int xibu(int a,char b)
{
if(a>85&&b=='Y')
{return 1;}
else return 0;
}
int bj(int a,char b)
{
if(a>80&&b=='Y')
{return 1;}
else return 0;
}
|
39
|
19216
|
struct info
{
char name[20];
int final;
int ass;
char gan;
char west;
int paper;
struct info *next;
};
struct info *create(int n)
{
struct info *p1,*p2,*head;
int i;
p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %d %d %c %c %d",p1->name,&p1->final,&p1->ass,&p1->gan,&p1->west,&p1->paper);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<n;i++)
{
p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %d %d %c %c %d",p1->name,&p1->final,&p1->ass,&p1->gan,&p1->west,&p1->paper);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return head;
}
int main()
{
int n;
struct info *head;
struct info *p1;
int i,m,sum,max;
char namemax[22];
scanf("%d",&n);
head=create(n);
p1=head;
sum=0;
max=0;
for(i=0;i<n;i++)
{
m=0;
if(p1->final>80&&p1->paper>=1)
{m+=8000;}
if(p1->final>85&&p1->ass>80)
{m+=4000;}
if(p1->final>90)
{m+=2000;}
if(p1->final>85&&p1->west=='Y')
{m+=1000;}
if(p1->ass>80&&p1->gan=='Y')
{m+=850;}
if(m>max)
{max=m;strcpy(namemax,p1->name);}
p1=p1->next;
}
p1=head;
for(m=0,i=0;i<n;i++)
{
if(p1->final>80&&p1->paper>=1)
{m+=8000;}
if(p1->final>85&&p1->ass>80)
{m+=4000;}
if(p1->final>90)
{m+=2000;}
if(p1->final>85&&p1->west=='Y')
{m+=1000;}
if(p1->ass>80&&p1->gan=='Y')
{m+=850;}
p1=p1->next;
}
sum=m;
printf("%s\n%d\n%d\n",namemax,max,sum);
}
|
39
|
19217
|
int main()
{
int N;
scanf("%d",&N);
struct std
{
char name[21];
int pin;
int yi;
char gan;
char west;
int n;
}std[100];
int i;
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",std[i].name,&std[i].pin,&std[i].yi,&std[i].gan,&std[i].west,&std[i].n);
}
int sum[100];
for(i=0;i<N;i++)
sum[i]=0;
for(i=0;i<N;i++)
{
if(std[i].pin>80&&std[i].n>0)
sum[i]+=8000;
if(std[i].pin>85&&std[i].yi>80)
sum[i]+=4000;
if(std[i].pin>90)
sum[i]+=2000;
if(std[i].pin>85&&std[i].west=='Y')
sum[i]+=1000;
if(std[i].yi>80&&std[i].gan=='Y')
sum[i]+=850;
}
int max=sum[0],k=0,he=sum[0];
for(i=1;i<N;i++)
{
he+=sum[i];
if(max<sum[i])
{
max=sum[i];
k=i;
}
}
printf("%s\n",std[k].name);
printf("%d\n",max);
printf("%d\n",he);
return 0;
}
|
39
|
19218
|
struct student
{
char name[25];
int qimo;
int pingshi;
char ganbu;
char xibu;
int lunwen;
int money;
};
int jiangxuejin(struct student s);
int main(int argc, char* argv[])
{
struct student a[101];
int N,sum,max,MAX;
scanf("%d",&N);
for(int i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].qimo,&a[i].pingshi,&a[i].ganbu,&a[i].xibu,&a[i].lunwen);
a[i].money=jiangxuejin(a[i]);
}
sum=max=0;
MAX=0;
for(int j=0;j<N;j++)
{
if(a[j].money>max)
{
max=a[j].money;
MAX=j;
}
sum+=a[j].money;
}
printf("%s\n",a[MAX].name);
printf("%d\n",max);
printf("%d\n",sum);
return 0;
}
int jiangxuejin(struct student s)
{
int sum=0;
if((s.qimo>80)&&(s.lunwen>=1))
{
sum+=8000;
}
if((s.qimo>85)&&(s.pingshi>80))
{
sum+=4000;
}
if(s.qimo>90)
{
sum+=2000;
}
if((s.xibu=='Y')&&(s.qimo>85))
{
sum+=1000;
}
if((s.pingshi>80)&&(s.ganbu=='Y'))
{
sum+=850;
}
return sum;
}
|
39
|
19219
|
struct student
{
char name[21];
short finalscore;
short clascore;
char position;
char westen;
short essaynum;
int reward;
}
;
int main()
{
int nstu=4;
int total=0;
scanf("%d",&nstu);
struct student *p=(struct student*)malloc(nstu*sizeof(struct student));
int i;
for(i=0;i<nstu;i++)
{
scanf("%s",p[i].name);
scanf("%d",&(p[i].finalscore));
scanf("%d ",&(p[i].clascore));
scanf("%c ",&p[i].position);
scanf("%c",&p[i].westen);
scanf("%d",&(p[i].essaynum));
p[i].reward=0;
}
for(i=0;i<nstu;i++)
{
if(p[i].finalscore>80&&p[i].essaynum>0)
(p[i].reward)+=8000;
if(p[i].finalscore>85&&p[i].clascore>80)
(p[i].reward)+=4000;
if(p[i].finalscore>90)
(p[i].reward)+=2000;
if(p[i].westen=='Y'&&p[i].finalscore>85)
(p[i].reward)+=1000;
if(p[i].position=='Y'&&p[i].clascore>80)
(p[i].reward)+=850;
}
int money=p[0].reward;
for(i=0;i<nstu-1;i++)
{
if(money<p[i+1].reward)
money=(p[i+1].reward);
total+=(p[i].reward);
}
total+=(p[nstu-1].reward);
int j;
for(j=0;j<nstu;j++)
{
if(p[j].reward==money)
break;
}
printf("%s\n",p[j].name);
printf("%d\n",p[j].reward);
printf("%d\n",total);
return 0;
}
|
39
|
19220
|
struct student
{
char name[20];
int score;
int ping;
char gan;
char xi;
int lun;
int jiang;
}stu[100];
int main()
{
int n,i,t,h=0;scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].score,
&stu[i].ping,&stu[i].gan,&stu[i].xi,&stu[i].lun);
stu[i].jiang=0;
if(stu[i].score>80&&stu[i].lun>0)stu[i].jiang=stu[i].jiang+8000;
if(stu[i].score>85&&stu[i].ping>80)stu[i].jiang=stu[i].jiang+4000;
if(stu[i].score>90)stu[i].jiang=stu[i].jiang+2000;
if(stu[i].score>85&&stu[i].xi=='Y')stu[i].jiang=stu[i].jiang+1000;
if(stu[i].ping>80&&stu[i].gan=='Y')stu[i].jiang=stu[i].jiang+850;
}for(i=0,t=stu[0].jiang;i<n-1;i++)
{h=h+stu[i].jiang;if(stu[i+1].jiang>t)t=stu[i+1].jiang;}
for(i=0;i<n;i++)
if(stu[i].jiang==t){printf("%s\n%d\n%d",stu[i].name,t,h+stu[n-1].jiang);break;}
return 0;
}
|
39
|
19221
|
struct Student
{char name[20];
int a;
int b;
char c;
char d;
int e;
int f;
};
int main()
{
int n,i,k,m,t;
scanf ("%d",&n);
struct Student stu[200];
for (i=0;i<n;i++)
{
scanf ("%s %d %d %c %c %d",stu[i].name,&stu[i].a,&stu[i].b,&stu[i].c,&stu[i].d,&stu[i].e);
stu[i].f=0;
}
for (i=0,m=0;i<n;i++)
{
if (stu[i].a>80&&stu[i].e>0)
stu[i].f=stu[i].f+8000;
if (stu[i].a>85&&stu[i].b>80)
stu[i].f=stu[i].f+4000;
if (stu[i].a>90)
stu[i].f=stu[i].f+2000;
if (stu[i].a>85&&stu[i].d=='Y')
stu[i].f=stu[i].f+1000;
if (stu[i].b>80&&stu[i].c=='Y')
stu[i].f=stu[i].f+850;
if (stu[i].f>m)
{
m=stu[i].f;
t=i;
}
}
for (i=0,k=0;i<n;i++)
k=k+stu[i].f;
printf ("%s\n%d\n%d\n",stu[t].name,m,k);
return 0;
}
|
39
|
19222
|
int main ()
{
int N,i,m,s1,s2,max=0,sum=0,t;
char name[20],maxname[20],t1,t2;
scanf ("%d",&N);
for(i=0;i<N;i++)
{
t=0;
scanf("%s %d %d %c %c %d",name,&s1,&s2,&t1,&t2,&m);
if(s1>80 && m>=1)
t+=8000;
if(s1>85 && s2>80)
t+=4000;
if(s1>90)
t+=2000;
if(s1>85 && t2=='Y')
t+=1000;
if(s2>80 && t1=='Y')
t+=850;
sum+=t;
if(t>max)
{
strcpy(maxname,name);
max=t;
}
}
printf("%s\n%d\n%d\n",maxname,max,sum);
return 0 ;
}
|
39
|
19223
|
int main()
{
int n;
int i;
scanf("%d", &n);
struct student
{
char name[1000];
int final;
int clas;
char ganbu;
char west;
int paper;
}stu[1000];
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d", stu[i].name, &stu[i].final, &stu[i].clas, &stu[i].ganbu, &stu[i].west, &stu[i].paper);
}
int total[1000]={0};
for(i=1;i<=n;i++)
{
if(stu[i].final>80&&stu[i].paper>=1)
{
total[i]=total[i]+8000;
}
if(stu[i].final>85&&stu[i].clas>80)
{
total[i]=total[i]+4000;
}
if(stu[i].final>90)
{
total[i]=total[i]+2000;
}
if(stu[i].final>85&&stu[i].west=='Y')
{
total[i]=total[i]+1000;
}
if(stu[i].clas>80&&stu[i].ganbu=='Y')
{
total[i]=total[i]+850;
}
}
int max=total[1];
int sum=total[1];
int k;
for(i=2;i<=n;i++)
{
sum=sum+total[i];
if(total[i]>max)
{
max=total[i];
}
}
for(i=1;i<=n;i++)
{
if(total[i]==max)
{
printf("%s\n", stu[i].name);
break;
}
}
printf("%d\n", max);
printf("%d", sum);
return 0;
}
|
39
|
19224
|
void main()
{
struct student
{
char num[21];
int scor1;
int scor2;
char g;
char x;
int lun;
int ss;
}stu[100];
int i,n,sum=0;
struct student max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].num,&stu[i].scor1,&stu[i].scor2,&stu[i].g,&stu[i].x,&stu[i].lun);
stu[i].ss=0;
}
for(i=0;i<n;i++)
{
if(stu[i].scor1>80&&stu[i].lun>0)
stu[i].ss+=8000;
if(stu[i].scor1>85&&stu[i].scor2>80)
stu[i].ss+=4000;
if(stu[i].scor1>90)
stu[i].ss+=2000;
if(stu[i].scor1>85&&stu[i].x=='Y')
stu[i].ss+=1000;
if(stu[i].scor2>80&&stu[i].g=='Y')
stu[i].ss+=850;
}
max=stu[0];
for(i=0;i<n;i++)
{
if(stu[i].ss>max.ss)
max=stu[i];
sum+=stu[i].ss;
}
printf("%s\n",max.num);
printf("%d\n",max.ss);
printf("%d\n",sum);
}
|
39
|
19225
|
struct person{
char pname[30];
int s1,s2,s3;
char c1,c2;
int money;
};
int main(){
struct person p[100];
int n,m,i,j,k;
long tot;
for(i=0;i<100;i++){
p[i].s1=0;
p[i].s2=0;
p[i].s3=0;
p[i].money=0;
}
scanf("%d",&n);
k=0;
tot=0;
for(i=0;i<n;i++){
scanf("%s%d%d %c %c %d",p[i].pname,&p[i].s1,&p[i].s2,&p[i].c1,&p[i].c2,&p[i].s3);
if(p[i].s1>80&&p[i].s3>=1)
p[i].money+=8000;
if(p[i].s1>85&&p[i].s2>80)
p[i].money+=4000;
if(p[i].s1>90)
p[i].money+=2000;
if(p[i].s1>85&&p[i].c2=='Y')
p[i].money+=1000;
if(p[i].s2>80&&p[i].c1=='Y')
p[i].money+=850;
tot+=p[i].money;
if(p[i].money>p[k].money)
k=i;
}
printf("%s\n%d\n%d\n",p[k].pname,p[k].money,tot);
return 0;
}
|
39
|
19226
|
int main(){
int n , i , p = 0 , sum = 0 , q;
struct student{
char name[200];
int c1 , c2 , wx , wa;
char bg , xb ;
}stu[101];
scanf("%d" , &n);
for( i = 0 ; i <= n - 1; i++){
stu[i].wa = 0 ;
scanf("%s %d %d %c %c %d", stu[i].name , &stu[i].c1 , &stu[i].c2 , &stu[i].bg , &stu[i].xb , &stu[i].wx);
// printf("%s %d %d %c %c %d\n", stu[i].name , stu[i].c1 , stu[i].c2 , stu[i].bg , stu[i].xb , stu[i].wx);
if( stu[i].c1 > 80 && stu[i].wx != 0 ) stu[i].wa = stu[i].wa + 8000 ;
if( stu[i].c1 > 85 && stu[i].c2 > 80 ) stu[i].wa = stu[i].wa + 4000 ;
if( stu[i].c1 > 90 ) stu[i].wa = stu[i].wa + 2000;
if( stu[i].c1 > 85 && stu[i].xb == 'Y' ) stu[i].wa = stu[i].wa + 1000;
if( stu[i].c2 > 80 && stu[i].bg == 'Y' ) stu[i].wa = stu[i].wa + 850 ;
if( stu[i].wa > p ) {p = stu[i].wa ;q = i ;}
sum = sum + stu[i].wa ;
// printf("wa%d\n %d\n" , stu[i].wa , q);
}
printf("%s\n%d\n%d\n" , stu[q].name , stu[q].wa , sum);
return(0);
}
|
39
|
19227
|
struct Student{
char name[20];
int mark;
int classpoint;
char leader;
char west;
int paper;
int money;
};
void main(){
int i,n,maxnum,tot=0;
struct Student stu[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].mark,&stu[i].classpoint,&stu[i].leader,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++)
{if(stu[i].mark>80&&stu[i].paper>0) stu[i].money=stu[i].money+8000;
if(stu[i].mark>85&&stu[i].classpoint>80) stu[i].money=stu[i].money+4000;
if(stu[i].mark>90) stu[i].money=stu[i].money+2000;
if(stu[i].mark>85&&(stu[i].west=='Y')) stu[i].money=stu[i].money+1000;
if( stu[i].leader=='Y'&&(stu[i].classpoint>80) )stu[i].money=stu[i].money+850;
}
maxnum=0;
for(i=1;i<n;i++)
if(stu[maxnum].money<stu[i].money) maxnum=i;
for(i=0;i<n;i++)
tot=tot+stu[i].money;
printf("%s\n%d\n%d",stu[maxnum].name,stu[maxnum].money,tot);
}
|
39
|
19228
|
struct student{
char name[21];
int qimo;
int banji;
char ganbu;
char west;
int article;
int total;
};
int main(){
int n,i,max,sum;
scanf("%d",&n);
struct student *stu=(struct student *)malloc(sizeof(int)*4*n+sizeof(char)*23*n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].ganbu,&stu[i].west,&stu[i].article);
stu[i].total =0;
}
for(i=0;i<n;i++){
if(stu[i].qimo>80&&stu[i].article>0){
stu[i].total +=8000;
}
if(stu[i].qimo>85&&stu[i].banji>80){
stu[i].total +=4000;
}
if(stu[i].qimo>90){
stu[i].total+=2000;
}
if(stu[i].qimo >85&&stu[i].west=='Y'){
stu[i].total +=1000;
}
if(stu[i].banji >80&&stu[i].ganbu =='Y'){
stu[i].total +=850;
}
}
max=stu[0].total ;
sum=0;
for(i=0;i<n;i++){
if(stu[i].total>max){
max=stu[i].total ;
}
sum+=stu[i].total ;
}
for(i=0;i<n;i++){
if(max==stu[i].total){
printf("%s\n%d\n%d\n",stu[i].name,max,sum);
break;
}
}
return 0;
}
|
39
|
19229
|
struct stu
{
char x[20];
int a;
int b;
char c[2];
char d[2];
int e;
int t;
};
int main()
{
int n,i,m;
struct stu h[100]={0};
scanf("%d",&n);
for(i=0,m=0;i<=(n-1);i++)
{
scanf("%s%d%d%s%s%d",&h[i].x,&h[i].a,&h[i].b,&h[i].c,&h[i].d,&h[i].e);
if(h[i].a>80&&h[i].e>=1)
h[i].t+=8000;
if(h[i].a>85&&h[i].b>80)
h[i].t+=4000;
if(h[i].a>90)
h[i].t+=2000;
if(h[i].a>85&&strcmp(h[i].d,"Y")==0)
h[i].t+=1000;
if(h[i].b>80&&strcmp(h[i].c,"Y")==0)
h[i].t+=850;
m+=h[i].t;
}
for(i=0;i<=(n-1);i++)
{
if(h[i].t>=h[i+1].t)
h[i+1]=h[i];
}
printf("%s\n%d\n%d",h[n-1].x,h[n-1].t,m);
}
|
39
|
19230
|
struct scholarship
{
char name[20];
int avscore;
int clscore;
char ganbu;
char xibu;
int paper;
}stu[100];
void main()
{
int n,i,b[100]={0},c=0,d=0,all=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].avscore,&stu[i].clscore,&stu[i].ganbu,&stu[i].xibu,&stu[i].paper);
if(stu[i].avscore>80&&stu[i].paper>0)
b[i]=b[i]+8000;
if(stu[i].avscore>85&&stu[i].clscore>80)
b[i]=b[i]+4000;
if(stu[i].avscore>90)
b[i]=b[i]+2000;
if(stu[i].avscore>85&&stu[i].xibu=='Y')
b[i]=b[i]+1000;
if(stu[i].ganbu=='Y'&&stu[i].clscore>80)
b[i]=b[i]+850;
if(i>0&&b[i]>c)
{
c=b[i];
d=i;
}
else if(i==0)
c=b[0];
}
for(i=0;i<n;i++)
all=all+b[i];
printf("%s\n%d\n%d\n",stu[d].name,c,all);
}
|
39
|
19231
|
struct student
{
char name[20];
int a;
int b;
char c1;
char c2;
int d;
}stu[100];
int main()
{
int n,i,p[100]={0},sum=0,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].name);
scanf("%d %d %c %c %d",&stu[i].a,&stu[i].b,&stu[i].c1,&stu[i].c2,&stu[i].d);
}
for(i=0;i<n;i++)
{
if((stu[i].a>80)&&(stu[i].d>0))
p[i]=p[i]+8000;
if((stu[i].a>85)&&(stu[i].b>80))
p[i]=p[i]+4000;
if(stu[i].a>90)
p[i]=p[i]+2000;
if((stu[i].a>85)&&(stu[i].c2=='Y'))
p[i]=p[i]+1000;
if((stu[i].b>80)&&(stu[i].c1=='Y'))
p[i]=p[i]+850;
sum=sum+p[i];
}
max=p[0];
for(i=0;i<n;i++)
{
if(p[i]>max)
max=p[i];
}
for(i=0;i<n;i++)
{
if(p[i]==max)
{
printf("%s\n",stu[i].name);
printf("%d\n",p[i]);
break;
}
}
printf("%d\n",sum);
return 0;
}
|
39
|
19232
|
struct
{
char name[20];
int qimo;
int banji;
char gb;
char xb;
int paper;
}stu[101];
void main()
{
int N, i, max=0, p=0, total=0, sch[101]={0};
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].gb,&stu[i].xb,&stu[i].paper);
for(i=0;i<N;i++)
{
if(stu[i].qimo>80&&stu[i].paper>0)
sch[i]+=8000;
if(stu[i].qimo>85&&stu[i].banji>80)
sch[i]+=4000;
if(stu[i].qimo>90)
sch[i]+=2000;
if(stu[i].qimo>85&&stu[i].xb=='Y')
sch[i]+=1000;
if(stu[i].banji>80&&stu[i].gb=='Y')
sch[i]+=850;
}
max=0;
for(i=0;i<N;i++)
{
if(sch[i]>max)
{
max=sch[i];
p=i;
}
total=total+sch[i];
}
printf("%s\n%d\n%d\n",stu[p].name,sch[p],total);
}
|
39
|
19233
|
struct student
{
char name[20];
int score;
int value;
char cadre;
char west;
int paper;
int sum;
};
int deal(struct student stu)
{
stu.sum=0;
if(stu.score>80&&stu.paper>0)
stu.sum+=8000;
if(stu.score>85&&stu.value>80)
stu.sum+=4000;
if(stu.score>90)
stu.sum+=2000;
if(stu.score>85&&stu.west=='Y')
stu.sum+=1000;
if(stu.value>80&&stu.cadre=='Y')
stu.sum+=850;
return(stu.sum);
}
void main()
{
int n,i,total=0,top=0,t=0;
scanf("%d",&n);
struct student stu[100];
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].score,&stu[i].value,&stu[i].cadre,&stu[i].west,&stu[i].paper);
stu[i].sum=deal(stu[i]);total+=stu[i].sum;
if(stu[i].sum>top)
{top=stu[i].sum;t=i;}
}
printf("%s\n%d\n%d",stu[t].name,top,total);
}
|
39
|
19234
|
int main (){
int n;
scanf("%d",&n);
int i;
int sum=0,max=0;
char t[30];
for(i=0;i<n;i++){
char p[30],c,v;
int m,k,b,g=0,z=0;
scanf("%s %d %d %c %c %d",p,&m,&k,&c,&v,&b);
if(m>80&&b>=1) g=g+8000;
if(m>85&&k>80) g=g+4000;
if(m>90) g=g+2000;
if(m>85&&v=='Y') g=g+1000;
if(k>80&&c=='Y') g=g+850;
if(g>max){
max=g;
z=strlen(p);
for(int h=0;h<z;h++){
t[h]=p[h];
}
t[z]='\0';
}
else max=max;
sum=sum+g;
}
printf("%s\n%d\n%d",t,max,sum);
return 0;
}
|
39
|
19235
|
struct student
{
char name[35];
int final;
int score;
char leader;
char west;
int paper;
int money;
struct student *next;
};
struct student *creat(void)
{
struct student *p,*q,*head;
int n,i=0;
scanf("%d",&n);
head=(struct student*)malloc(sizeof (struct student));
scanf("%s %d %d %c %c %d",&head->name,&head->final,&head->score,&head->leader,&head->west,&head->paper);
q=head;
p=head;
for(i=0;i<n;i++)
{
q=p;
q->money=0;
if ((q->final>80)&&(q->paper>0)) q->money=q->money+8000;
if ((q->final>85)&&(q->score>80)) q->money=q->money+4000;
if (q->final>90) q->money=q->money+2000;
if ((q->final>85)&&(q->west=='Y')) q->money=q->money+1000;
if ((q->score>80)&&(q->leader=='Y')) q->money=q->money+850;
if(i<n-1)
{p=(struct student*)malloc(sizeof (struct student));
scanf("%s %d %d %c %c %d",&p->name,&p->final,&p->score,&p->leader,&p->west,&p->paper);
q->next=p;}
}
q->next=NULL;
return(head);
}
void main()
{
struct student *p,*q,*r;
int sum=0,max=0;
p=creat();
for(q=p;q!=NULL;)
{if (q->money>max) {max=q->money; r=q;}
sum=sum+q->money;
q=q->next;
}
printf("%s\n%d\n",r->name,r->money);
printf("%d",sum);
}
|
39
|
19236
|
int main()
{
int N,fgrade[101],cgrade[101],lunwen[101],jiang[101],max=0,x,sum=0;
cin>>N;
cin.get();
char name[101][20],ganbu[101],xibu[101];
for(int i=1;i<=N;i++)
{
cin>>name[i]>>fgrade[i]>>cgrade[i]>>ganbu[i]>>xibu[i]>>lunwen[i];
}
for(int i=1;i<=N;i++)
{
jiang[i]=(fgrade[i]>80&&lunwen[i]>=1)*8000+(fgrade[i]>85&&cgrade[i]>80)*4000+(fgrade[i]>90)*2000+
(fgrade[i]>85&&xibu[i]=='Y')*1000+(cgrade[i]>80&&ganbu[i]=='Y')*850;
sum=sum+jiang[i];
if(max<jiang[i])
{
max=jiang[i];
x=i;
}
}
cout<<name[x]<<endl<<jiang[x]<<endl<<sum<<endl;
return 0;
}
|
39
|
19237
|
struct student
{
char name[20];
int score1;
int score2;
char lead;
char west;
int paper;
int sch;
struct student *next;
};
void main()
{
struct student *p0,*p1,*p2,*head;
int n,k,i;
scanf("%d",&n);
p1=(struct student *)malloc(sizeof(struct student));
p1->sch=0;
scanf("%s %d %d %c %c %d",p1->name,&p1->score1,&p1->score2,&p1->lead,&p1->west,&p1->paper);
if((p1->score1>80)&&(p1->paper>0))
p1->sch=p1->sch+8000;
if((p1->score1>85)&&(p1->score2>80))
p1->sch=p1->sch+4000;
if(p1->score1>90)
p1->sch=p1->sch+2000;
if((p1->score1>85)&&(p1->west=='Y'))
p1->sch=p1->sch+1000;
if((p1->score2>80)&&(p1->lead=='Y'))
p1->sch=p1->sch+850;
head=p1;
p1->next=NULL;
for(i=1;i<n;i++)
{
p1=head;
p0=(struct student *)malloc(sizeof(struct student));
scanf("%s %d %d %c %c %d",p0->name,&p0->score1,&p0->score2,&p0->lead,&p0->west,&p0->paper);
p0->sch=0;
if((p0->score1>80)&&(p0->paper>0))
p0->sch=p0->sch+8000;
if((p0->score1>85)&&(p0->score2>80))
p0->sch=p0->sch+4000;
if(p0->score1>90)
p0->sch=p0->sch+2000;
if((p0->score1>85)&&(p0->west=='Y'))
p0->sch=p0->sch+1000;
if((p0->score2>80)&&(p0->lead=='Y'))
p0->sch=p0->sch+850;
while((p0->sch<=p1->sch)&&(p1->next!=NULL))
{
p2=p1;
p1=p1->next;
}
if(p0->sch>p1->sch)
{
if(head==p1)
head=p0;
else p2->next=p0;
p0->next=p1;
}
else
{
p1->next=p0;
p0->next=NULL;
}
}
k=0;
p1=head;
while(p1!=NULL)
{
k=k+p1->sch;
p1=p1->next;
}
printf("%s\n%d\n%d",head->name,head->sch,k);
}
|
39
|
19238
|
struct stu
{ char name[100];
int qm;
int py;
char gb;
char xb;
int lw;
int jj;
};
int a[101]={0};
int main()
{ void pai(struct stu s[],int n,int a[]);
struct stu s[101];
int i=0,n=0,sum=0;
char m[100]={'\0'};
for(i=0;i<101;i++)
{ strcpy(s[i].name,m);
s[i].qm=0;
s[i].py=0;
s[i].gb='\0';
s[i].xb='\0';
s[i].lw=0;
s[i].jj=0;
}
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s",s[i].name);
scanf("%d %d %c %c %d",&s[i].qm,&s[i].py,&s[i].gb,&s[i].xb,&s[i].lw);
if(s[i].qm>80&&s[i].lw>=1) s[i].jj=s[i].jj+8000;
if(s[i].qm>85&&s[i].py>80) s[i].jj=s[i].jj+4000;
if(s[i].qm>90) s[i].jj=s[i].jj+2000;
if(s[i].xb=='Y'&&s[i].qm>85) s[i].jj=s[i].jj+1000;
if(s[i].py>80&&s[i].gb=='Y') s[i].jj=s[i].jj+850;
sum=sum+s[i].jj;
a[i]=i;
}
pai(s,n,a);
printf("%s\n",s[a[0]].name);
printf("%d\n",s[a[0]].jj);
printf("%d",sum);
return(0);
}
void pai(struct stu s[],int n,int a[])
{ int t=0;
int i=0,j=0;
for(i=0;i<n;i++)
{for(j=0;j<n-i-1;j++)
{ if(s[a[j]].jj<s[a[j+1]].jj)
{ t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
}
|
39
|
19239
|
struct student
{
char name[20];
int end;
int clas;
char leader;
char west;
int paper;
struct student *next;
};
int main()
{
struct student *p,*q,*head;
char *a;
int *b,*c;
int n,i,max=0;
long int sum=0;
scanf("%d\n",&n);
head=p=q=(struct student *)malloc(LEN);
a=(char*)malloc(20*sizeof(char));
b=c=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d\n",p->name,&p->end,&p->clas,&p->leader,&p->west,&p->paper);
p=(struct student *)malloc(LEN);
q->next=p;
q=p;
}
q->next=NULL;
q=p=head;
for(i=0;i<n;i++)
{
if(((p->end)>80)&&((p->paper)>0))*b+=8000;
if(((p->end)>85)&&((p->clas)>80))*b+=4000;
if((p->end)>90)*b+=2000;
if(((p->end)>85)&&((p->west)=='Y'))*b+=1000;
if(((p->clas)>80)&&((p->leader)=='Y'))*b+=850;
b++;
p=q->next;
q=p;
}
q=p=head;
b=c;
for(i=0;i<n;i++)
{
if(*b>max)
{
max=*b;
strcpy(a,p->name);
}
sum+=*b;
b++;
p=q->next;
q=p;
}
printf("%s\n%d\n%ld\n",a,max,sum);
}
|
39
|
19240
|
struct student
{
char name[21];
int gpa;
int c_gpa;
char official;
char west;
int paper;
};
void main()
{
int process( struct student *p);
struct student stu[100],*p,*P=NULL;
int i=0,n,TOTAL=0,max=0,MAX=0;
p=stu;
scanf("%d\n",&n);
for(i;i<n;i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->gpa,&p->c_gpa,&p->official,&p->west,&p->paper);
max=process(p++);
if(max>MAX) {MAX=max;P=p-1;}
TOTAL += max;
}
printf("%s\n%d\n%d", P->name,MAX,TOTAL);
}
int process( struct student *p)
{
int prize=0;
if (p->gpa>80 && p->paper>=1) prize += 8000;
if (p->gpa>85 && p->c_gpa>80) prize += 4000;
if (p->gpa>90) prize += 2000;
if (p->gpa>85 && p->west=='Y') prize += 1000;
if (p->c_gpa>80 && p->official=='Y') prize +=850;
return prize;
}
|
39
|
19241
|
struct student
{
char name[30];
int sco;
int pin;
char gan;
char xi;
int lun;
};
struct student stu[100];
void main()
{
int i,j,k,m,n,a[100],sum=0,t,add=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].sco,&stu[i].pin,&stu[i].gan,&stu[i].xi,&stu[i].lun);
a[i]=0;
}
for(i=1;i<=n;i++)
{
if(stu[i].sco>80&&stu[i].lun>=1)
a[i]=a[i]+8000;
if(stu[i].sco>85&&stu[i].pin>80)
a[i]=a[i]+4000;
if(stu[i].sco>90)
a[i]=a[i]+2000;
if(stu[i].sco>85&&stu[i].xi=='Y')
a[i]=a[i]+1000;
if(stu[i].pin>80&&stu[i].gan=='Y')
a[i]=a[i]+850;
}
for(i=1;i<=n;i++)
{
if(sum<a[i])
sum=a[i];
}
for(i=1;i<=n;i++)
{
if(a[i]==sum)
{
t=i;break;
}
}
for(i=1;i<=n;i++)
{add=add+a[i];}
printf("%s\n%d\n%d",stu[t].name,sum,add);
}
|
39
|
19242
|
int main()
{
struct std{
char name[20];
int qm,bp,lw,jj;
char gb,xb;
}stu[200];
int n,i,s=0,max;
char mn[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
stu[i].jj=0;
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qm,&stu[i].bp,&stu[i].gb,&stu[i].xb,&stu[i].lw);
if(stu[i].qm>80&&stu[i].lw>0){stu[i].jj+=8000;}
if(stu[i].qm>85&&stu[i].bp>80){stu[i].jj+=4000;}
if(stu[i].qm>90){stu[i].jj+=2000;}
if(stu[i].qm>85&&stu[i].xb=='Y'){stu[i].jj+=1000;}
if(stu[i].bp>80&&stu[i].gb=='Y'){stu[i].jj+=850;}
s=s+stu[i].jj;
}
max=stu[0].jj;
strcpy(mn,stu[0].name);
for(i=0;i<n;i++)
{
if(max<stu[i].jj)
{
max=stu[i].jj;
strcpy(mn,stu[i].name);
}
}
printf("%s\n%d\n%d",mn,max,s);
return 0;
}
|
39
|
19243
|
/*????????????????????????????????????????????
1) ????????8000??????????80??>80???????????1??1?????????????
2) ????????4000??????????85??>85????????????80??>80?????????
3) ????????2000??????????90??>90?????????
4) ????????1000??????????85??>85?????????????
5) ????????850??????????80??>80???????????
????????????????????????????????????????????????????????87??
??????82????????????????????????????????????????4850??
??????????????????????????????????????????????????
????
???????????N?1 ? N ? 100??????????????N????????????????????????????
??????????????????????????????????????????????????????20???????????
???????????????0?100????????0?100?????????????????????????????Y????N?????
???????0?10??????0?10????????????????????
????
?????????????????????????????????????????????????????????????
????????????????????????????N?????????????
????
4
YaoLin 87 82 Y N 0
ChenRuiyi 88 78 N Y 1
LiXin 92 88 N N 0
ZhangQin 83 87 Y N 1
????
ChenRuiyi
9000
28700*/
int main()
{
int n,i,sum[100],b[100],c[100],f[100],total=0,max=0,x=0;
char a[100][20],d[100],e[100];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i]>>b[i]>>c[i]>>d[i]>>e[i]>>f[i];
}
for(i=0;i<n;i++)
{
sum[i]=0;
if(b[i]>90)
{
sum[i]=sum[i]+2000;
}
if((c[i]>80)&&(d[i]=='Y'))
{
sum[i]=sum[i]+850;
}
if((b[i]>85)&&(e[i]=='Y'))
{
sum[i]=sum[i]+1000;
}
if((b[i]>85)&&(c[i]>80))
{
sum[i]=sum[i]+4000;
}
if((b[i]>80)&&(f[i]>=1))
{
sum[i]=sum[i]+8000;
}
total=total+sum[i];
if(sum[i]>max)
{
max=sum[i];
x=i;
}
}
cout<<a[x]<<endl;
cout<<max<<endl;
cout<<total<<endl;
return 0;
}
|
39
|
19244
|
struct student
{
char name[40];
int end;
int cls;
int lead;
int west;
int paper;
int money;
} stu[100];
int main()
{
int i,n,t=1,sum=0,max=0,print;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].end,&stu[i].cls,&stu[i].lead,&stu[i].west,&stu[i].paper);
}
for(i=1;i<=n;i++)
{
if(stu[i].end>80&&stu[i].paper>=1) stu[i].money+=8000;
if(stu[i].end>85&&stu[i].cls>80) stu[i].money+=4000;
if(stu[i].end>90) stu[i].money+=2000;
if(stu[i].end>85&&stu[i].west==89) stu[i].money+=1000;
if(stu[i].cls>80&&stu[i].lead==89) stu[i].money+=850;
sum+=stu[i].money;
}
for(i=1;i<=n;i++)
{
if(stu[i].money>max)
{
max=stu[i].money;
print=i;
}
}
printf("%s\n%d\n%d",stu[print].name,stu[print].money,sum);
return 0;
}
|
39
|
19245
|
int main()
{
struct student
{
char name[20];
int a;
int b;
char c;
char d;
int e;
struct student*next;
}student[100];
int N,i,money[100],max,sum,flag;
max=sum=0;
for(i=0;i<100;i++)
{
money[i]=0;
}
struct student *p;
scanf("%d",&N);
for(i=0;i<N;i++)
{
student[i].next=&student[i+1];
}
student[N-1].next=NULL;
p=&student[0];
i=0;
while(p!=NULL)
{
scanf("%s %d %d %c %c %d",p->name,&p->a,&p->b,&p->c,&p->d,&p->e);
if((p->a)>80&&(p->e)>0)
money[i]+=8000;
if((p->a)>85&&(p->b)>80)
money[i]+=4000;
if((p->a)>90)
money[i]+=2000;
if((p->a)>85&&(p->d)=='Y')
money[i]+=1000;
if((p->b)>80&&(p->c)=='Y')
money[i]+=850;
i++;
p=p->next;
}
for(i=0;i<N;i++)
{
if(money[i]>max)
{
max=money[i];
flag=i;
}
}
printf("%s\n",student[flag].name);
printf("%d\n",max);
for(i=0;i<N;i++)
{
sum+=money[i];
}
printf("%d",sum);
return 0;
}
|
39
|
19246
|
struct Student{
char name[21];
int avg;
int cls;
char off;
char west;
int paper;
};
int main()
{
int i,j,N,high;
long sch[100]={0};
long schtot=0;
char c;
struct Student ptcpt[100];
struct Student tmp;
scanf("%d",&N);
for (i=0;i<N-1;i++){
j=0;
while (j<22&&(c=getchar())!=' '){
ptcpt[i].name[j]=c;
j++;
}
ptcpt[i].name[j]='\0';
scanf(" %d %d %c %c %d\n",&ptcpt[i].avg,&ptcpt[i].cls,&ptcpt[i].off,&ptcpt[i].west,&ptcpt[i].paper);
if (ptcpt[i].avg>80&&ptcpt[i].paper>=1){
sch[i]=sch[i]+8000;}
if (ptcpt[i].avg>85&&ptcpt[i].cls>80){
sch[i]=sch[i]+4000;}
if (ptcpt[i].avg>90){
sch[i]=sch[i]+2000;}
if (ptcpt[i].avg>85&&ptcpt[i].west=='Y'){
sch[i]=sch[i]+1000;}
if (ptcpt[i].cls>80&&ptcpt[i].off=='Y'){
sch[i]=sch[i]+850;}
schtot=schtot+sch[i];
}
j=0;
while (j<22&&(c=getchar())!=' '){
ptcpt[N-1].name[j]=c;
j++;
}
ptcpt[N-1].name[j]='\0';
scanf(" %d %d %c %c %d",&ptcpt[N-1].avg,&ptcpt[N-1].cls,&ptcpt[N-1].off,&ptcpt[N-1].west,&ptcpt[N-1].paper);
if (ptcpt[N-1].avg>80&&ptcpt[N-1].paper>=1) {
sch[N-1]=sch[N-1]+8000;
}
if (ptcpt[N-1].avg>85&&ptcpt[N-1].cls>80){
sch[N-1]=sch[N-1]+4000;}
if (ptcpt[N-1].avg>90){
sch[N-1]=sch[N-1]+2000;}
if (ptcpt[N-1].avg>85&&ptcpt[N-1].west=='Y'){
sch[N-1]=sch[N-1]+1000;}
if (ptcpt[N-1].cls>80&&ptcpt[N-1].off=='Y'){
sch[N-1]=sch[N-1]+850;}
schtot=schtot+sch[N-1];
strcpy(tmp.name,ptcpt[N-1].name);
high=sch[N-1];
for (i=N-1;i>-1;i--){
if (high<=sch[i]){
strcpy(tmp.name,ptcpt[i].name);
high=sch[i];
}
else continue;
}
printf("%s\n%d\n%ld",tmp.name,high,schtot);
return 0;
}
|
39
|
19247
|
struct student{
char name[20];
int smark;
int cmark;
char lead;
char west;
int num;
};
struct student stu[200];
int s[100];
int n;
int js(int x)
{
int reval=0;
if (stu[x].smark>80&&stu[x].num>=1) reval+=8000;
if (stu[x].smark>85&&stu[x].cmark>80) reval+=4000;
if (stu[x].smark>90) reval+=2000;
if (stu[x].smark>85&&stu[x].west=='Y') reval+=1000;
if (stu[x].cmark>80&&stu[x].lead=='Y') reval+=850;
return reval;
}
int main()
{
int maxnum=0,max=0,sum=0,i=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>stu[i].name>>stu[i].smark>>stu[i].cmark>>stu[i].lead>>stu[i].west>>stu[i].num;
}
for(i=0;i<n;i++)
{
// cout<<js(i)<<endl;
sum+=js(i);
if(js(i)>max){
maxnum=i;
max=js(i);
}
}
cout<<stu[maxnum].name<<endl<<max<<endl<<sum<<endl;
return 0;
}
|
39
|
19248
|
void main()
{
struct student
{
char name[30];
int num1;
int num2;
char isstu;
char iswest;
int paper;
}stu[100];
int n,i,max,all=0;
int reward[100];
scanf("%d",&n);
for(i=0;i<n;i++)
reward[i]=0;
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].num1,&stu[i].num2,&stu[i].isstu,&stu[i].iswest,&stu[i].paper);
for(i=0;i<n;i++)
{
if(stu[i].num1>80&&stu[i].paper>=1)
reward[i]=reward[i]+8000;
if(stu[i].num1>85&&stu[i].num2>80)
reward[i]=reward[i]+4000;
if(stu[i].num1>90)
reward[i]=reward[i]+2000;
if(stu[i].num1>85&&stu[i].iswest=='Y')
reward[i]=reward[i]+1000;
if(stu[i].num2>80&&stu[i].isstu=='Y')
reward[i]=reward[i]+850;
}
for(i=0;i<n;i++)
all=all+reward[i];
max=reward[0];
for(i=1;i<n;i++)
if(max<reward[i])
max=reward[i];
for(i=0;i<n;i++)
if(max==reward[i])
break;
printf("%s\n%d\n%d\n",stu[i].name,reward[i],all);
}
|
39
|
19249
|
struct student
{
char name[20];
int pingjun;
int pingyi;
char bgb[3];
char xb[3];
int lunwen;
int qian;
};
int main()
{
struct student stu[100]={{"\0"}};
struct student total={"\0"};
struct student temp={"\0"};
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d",stu[i].name,&stu[i].pingjun,&stu[i].pingyi);
scanf("%s%s%d",&stu[i].bgb,&stu[i].xb,&stu[i].lunwen);
if(stu[i].pingjun>80&&stu[i].lunwen>=1)
stu[i].qian=stu[i].qian+8000;
if(stu[i].pingjun>85&&stu[i].pingyi>80)
stu[i].qian=stu[i].qian+4000;
if(stu[i].pingjun>90)
stu[i].qian=stu[i].qian+2000;
if(stu[i].pingjun>85&&stu[i].xb[0]=='Y')
stu[i].qian=stu[i].qian+1000;
if(stu[i].pingyi>80&&stu[i].bgb[0]=='Y')
stu[i].qian=stu[i].qian+850;
total.qian=total.qian+stu[i].qian;
}
for(i=0;i<n;i++)
{
if(stu[i].qian>temp.qian)
temp=stu[i];
}
printf("%s\n%d\n%d\n",temp.name,temp.qian,total.qian);
return 0;
}
|
39
|
19250
|
struct student
{
char name[20];
int gradeA;
int gradeB;
char a;
char b;
int num;
int n;//??
int np;//??
}
stu[100];
void main()
{
int m,k,i,max;
int total=0;
scanf("%d\n",&m);
for(i=0;i<m;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].gradeA,&stu[i].gradeB,&stu[i].a,&stu[i].b,&stu[i].num);
stu[i].n=0;
stu[i].np=0;
}
for(i=0;i<m;i++)
{
if(stu[i].gradeA>80&&stu[i].num>=1)
{
total=total+8000;
stu[i].n++;
stu[i].np=stu[i].np+8000;
}
if(stu[i].gradeA>85&&stu[i].gradeB>80)
{
total=total+4000;
stu[i].n++;
stu[i].np=stu[i].np+4000;
}
if(stu[i].gradeA>90)
{
total=total+2000;
stu[i].n++;
stu[i].np=stu[i].np+2000;
}
if(stu[i].gradeA>85&&stu[i].b=='Y')
{
total=total+1000;
stu[i].n++;
stu[i].np=stu[i].np+1000;
}
if(stu[i].gradeB>80&&stu[i].a=='Y')
{
total=total+850;
stu[i].n++;
stu[i].np=stu[i].np+850;
}
}
for(i=0,max=0;i<m;i++)
if(stu[i].np>max)
{
max=stu[i].np;
}
for(i=0;i<m;i++)
{
if(stu[i].np==max)
{
k=i;
break;
}
}
printf("%s\n%d\n%d\n",stu[k].name,stu[k].np,total);
}
|
39
|
19251
|
int main(int argc, char* argv[])
{
int n;
char name[100][50];
int qimo[100];
int banji[100];
char ganbu[100];
char xibu[100];
int lunwen[100];
int i=0,sum[100]={0},sumz=0,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",name[i],&qimo[i],&banji[i],&ganbu[i],&xibu[i],&lunwen[i]);
}
for(i=0;i<n;i++)
{
if(qimo[i]>80&&lunwen[i]>=1) sum[i]+=8000;
if(qimo[i]>85&&banji[i]>80) sum[i]+=4000;
if(qimo[i]>90) sum[i]+=2000;
if(qimo[i]>85&&xibu[i]=='Y') sum[i]+=1000;
if(banji[i]>80&&ganbu[i]=='Y') sum[i]+=850;
}
int summax=sum[0];
for(i=1;i<n;i++)
{
sumz+=sum[i];
if(sum[i]>summax)
{
summax=sum[i];
k=i;
}
}
sumz=sumz+sum[0];
printf("%s\n%d\n%d\n",name[k],sum[k],sumz);
return 0;
}
|
39
|
19252
|
void main()
{
struct stu
{char name[20];
int fen;
int pin;
char gan;
char sheng;
int lun;
int jiang;
}a[100];
int n,i,max,k,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].fen,&a[i].pin,&a[i].gan,&a[i].sheng,&a[i].lun);
a[i].jiang=0;
if(a[i].fen>80&&a[i].lun>0)
a[i].jiang=a[i].jiang+8000;
if(a[i].fen>85&&a[i].pin>80)
a[i].jiang=a[i].jiang+4000;
if(a[i].fen>90)
a[i].jiang=a[i].jiang+2000;
if(a[i].fen>85&&a[i].sheng=='Y')
a[i].jiang=a[i].jiang+1000;
if(a[i].pin>80&&a[i].gan=='Y')
a[i].jiang=a[i].jiang+850;
sum=sum+a[i].jiang;
}
for(i=1,k=0,max=a[0].jiang;i<n;i++)
if(a[i].jiang>max)
{
max=a[i].jiang;
k=i;
}
printf("%s\n%d\n%d",a[k].name,a[k].jiang,sum);
}
|
39
|
19253
|
int main()
{
int i,n,smax=0;
struct s{
char name[21];
int qimo;
int banji;
char bangan;
char xibu;
int lunwen;
int sum;}s[101];
scanf("%d",&n);
for(i=0;i<n;i++){
s[i].sum=0;
scanf("%s %d %d %c %c %d",s[i].name,&s[i].qimo,&s[i].banji,&s[i].bangan,&s[i].xibu,&s[i].lunwen);
}
for(i=0;i<n;i++){
if((s[i].qimo>80)&&(s[i].lunwen>0))
s[i].sum=s[i].sum+8000;
if((s[i].qimo>85)&&(s[i].banji>80))
s[i].sum=s[i].sum+4000;
if(s[i].qimo>90)
s[i].sum=s[i].sum+2000;
if((s[i].qimo>85)&&(s[i].xibu=='Y'))
s[i].sum=s[i].sum+1000;
if((s[i].banji>80)&&(s[i].bangan=='Y'))
s[i].sum=s[i].sum+850;}
for(i=0;i<n;i++)
{smax+=s[i].sum;
if(s[i].sum>s[0].sum){
s[0].sum=s[i].sum;
s[0]=s[i]; }
}
printf("%s\n",s[0].name);
printf("%d\n",s[0].sum);
printf("%d",smax);
return 0;
}
|
39
|
19254
|
struct student
{
char name[21];
int final;
int cla;
char stu;
char west;
int paper;
int sch;
};
int award(struct student *p)
{
int total=0;
if(p->final>80&&p->paper>0)
total+=8000;
if(p->final>85&&p->cla>80)
total+=4000;
if(p->final>90)
total+=2000;
if(p->final>85&&p->west=='Y')
total+=1000;
if(p->cla>80&&p->stu=='Y')
total+=850;
return total;
}
int main()
{
int n,i,j;
long int all=0;
struct student s[100],*p[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&s[i].name,&s[i].final,&s[i].cla,&s[i].stu,&s[i].west,&s[i].paper);
p[i]=&s[i];
s[i].sch=award(p[i]);
all+=s[i].sch;
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(s[j].sch>s[i].sch)
{
struct student temp;
temp=s[i];
s[i]=s[j];
s[j]=temp;
}
}
}
printf("%s\n%d\n%ld",s[0].name,s[0].sch,all);
return 0;
}
/*????????8000??????????80??>80???????????1??1?????????????
2) ????????4000??????????85??>85????????????80??>80?????????
3) ????????2000??????????90??>90?????????
4) ????????1000??????????85??>85?????????????
5) ????????850??????????80??>80???????????
???????????N?1 ? N ? 100??????????????N????????????
???????????????????????????????????????????????????*/
|
39
|
19255
|
struct student
{
char name[20];
int a;
int b;
char c;
char d;
int e;
int f;
}stu[101];
main()
{
int n,i,sum=0,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].a,&stu[i].b,&stu[i].c,&stu[i].d,&stu[i].e);
stu[i].f=0;
if(stu[i].a>80&&stu[i].e>0) stu[i].f+=8000;
if(stu[i].a>85&&stu[i].b>80) stu[i].f+=4000;
if(stu[i].a>90) stu[i].f+=2000;
if(stu[i].d=='Y'&&stu[i].a>85) stu[i].f+=1000;
if(stu[i].b>80&&stu[i].c=='Y') stu[i].f+=850;
}
for(j=0;j<n;j++)
sum=sum+stu[j].f;
stu[100]=stu[0];
for(j=1;j<n;j++)
{
if(stu[j].f>stu[100].f )
stu[100]=stu[j];
}
printf("%s\n%d\n%d\n",stu[100].name,stu[100].f,sum);
}
|
39
|
19256
|
void main()
{
struct stu
{
char name[20];
int end;
int cls;
char lead;
char west;
int pap;
int sum;
}std[100];
int n,i,j,summ=0,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d %d %c %c %d",&std[i].name,&std[i].end,&std[i].cls,&std[i].lead,&std[i].west,&std[i].pap);
std[i].sum=0;
if((std[i].end>80)&&(std[i].pap>=1))SS=SS+8000;
if((S.end>85)&&(S.cls>80))SS=SS+4000;
if(S.end>90)SS=SS+2000;
if((S.end>85)&&(S.west=='Y'))SS=SS+1000;
if((S.cls>80)&&(S.lead=='Y'))SS=SS+850;
summ=summ+SS;
}
for(i=0;i<n;i++)
{
if(SS>k)
{
k=SS;
j=i;
}
}
printf("%s\n%d\n%d\n",std[j].name,std[j].sum,summ);
}
|
39
|
19257
|
void main()
{
struct information
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int money;
}info[100];
int n,max,sum=0,i;
char scholar[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",info[i].name,&info[i].qimo,&info[i].banji,&info[i].ganbu,&info[i].xibu,&info[i].lunwen);
info[i].money=0;
}
for(i=0;i<n;i++)
{
if(info[i].qimo>80&&info[i].lunwen>0)
info[i].money+=8000;
if(info[i].qimo>85&&info[i].banji>80)
info[i].money+=4000;
if(info[i].qimo>90)
info[i].money+=2000;
if(info[i].qimo>85&&info[i].xibu=='Y')
info[i].money+=1000;
if(info[i].banji>80&&info[i].ganbu=='Y')
info[i].money+=850;
sum+=info[i].money;
}
strcpy(scholar,info[0].name);
max=info[0].money;
for(i=0;i<n;i++)
{
if(max<info[i].money)
{
max=info[i].money;
strcpy(scholar,info[i].name);
}
}
printf("%s\n%d\n%d\n",scholar,max,sum);
}
|
39
|
19258
|
struct student
{
char name[20];
int score;
int pscore;
char gjud;
char wjud;
int paper;
int sum;
}stu[100];
void main()
{
int n,i,ssum=0,tsum=0,ti;scanf("%d",&n);
for(i=0;i<n;i++)scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].score,&stu[i].pscore,&stu[i].gjud,&stu[i].wjud,&stu[i].paper),stu[i].sum=0;
for(i=0;i<n;i++)
{
if(stu[i].score>80&&stu[i].paper>=1)stu[i].sum+=8000;
if(stu[i].score>85&&stu[i].pscore>80)stu[i].sum+=4000;
if(stu[i].score>90)stu[i].sum+=2000;
if(stu[i].score>85&&stu[i].wjud=='Y')stu[i].sum+=1000;
if(stu[i].pscore>80&&stu[i].gjud=='Y')stu[i].sum+=850;
ssum+=stu[i].sum;
}
for(i=0;i<n;i++)if(stu[i].sum>tsum)tsum=stu[i].sum,ti=i;
printf("%s\n%d\n%d",stu[ti].name,tsum,ssum);
}
|
39
|
19259
|
struct student
{
char name[20];
int finalmarks;
int classmarks;
char monitor;
char west;
int paper;
}stu;
void main()
{
int n;
char bigname[20]="0";
int max=0,temp=0;
int sum=0;
int i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
stu.name[20]="0";
temp=0;
scanf("%s %d %d %c %c %d",stu.name,&stu.finalmarks,&stu.classmarks,&stu.monitor,&stu.west,&stu.paper);
//????????8000??????????80??>80???????????1??1?????????????
if( stu.finalmarks>80 && stu.paper>=1 )
temp=temp+8000;
//????????4000??????????85??>85????????????80??>80?????????
if( stu.finalmarks>85 && stu.classmarks>80 )
temp=temp+4000;
//????????2000??????????90??>90?????????
if( stu.finalmarks>90 )
temp=temp+2000;
//????????1000??????????85??>85?????????????
if( stu.finalmarks>85 && stu.west=='Y' )
temp=temp+1000;
//????????850??????????80??>80???????????
if( stu.classmarks>80 && stu.monitor=='Y' )
temp=temp+850;
sum=sum+temp;
if( max<temp )
{
max=temp;
strcpy(bigname,stu.name);
}
}
printf("%s\n",bigname);
printf("%d\n",max);
printf("%d",sum);
}
|
39
|
19260
|
void main()
{
int i,j=0,max,N,mark1[150],mark2[150],p[150],s[150]={0},sum=0;
char name[150][20]={'0'},a[150]={'0'},b[150]={'0'};
scanf("%d",&N);
for (i=0;i<N;i++)
{ scanf("%s %d %d %s %s %d",name[i],&mark1[i],&mark2[i],&a[i],&b[i],&p[i]);}
for (i=0;i<N;i++)
{
if (mark1[i]>80 && p[i]>=1)
{ s[i]=s[i]+8000;}
if (mark1[i]>85 && mark2[i]>80)
{ s[i]=s[i]+4000;}
if (mark1[i]>90)
{ s[i]=s[i]+2000;}
if (mark1[i]>85 && (int)(b[i])==89)
{ s[i]=s[i]+1000;}
if (mark2[i]>80 && (int)(a[i])==89)
{ s[i]=s[i]+850;}
}
for (i=0;i<N;i++)
{ sum=sum+s[i];}
max=s[0];
for (i=0;i<N;i++)
{
if (s[i]>max)
{ max=s[i];
j=i;}
}
printf("%s\n%d\n",name[j],s[j]);
printf("%d\n",sum);
}
|
39
|
19261
|
struct stu
{
char name[21];
int avs;
int pys;
char gb;
char xb;
int lw;
} stu[100];
main()
{
int n,i,max,maxstu,sum;
int jj[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].avs,&stu[i].pys,&stu[i].gb,&stu[i].xb,&stu[i].lw);
jj[i]=0;
if(stu[i].avs>80&&stu[i].lw>0){
jj[i]+=8000;
}
if(stu[i].avs>85&&stu[i].pys>80){
jj[i]+=4000;
}
if(stu[i].avs>90){
jj[i]+=2000;
}
if(stu[i].avs>85&&stu[i].xb=='Y'){
jj[i]+=1000;
}
if(stu[i].pys>80&&stu[i].gb=='Y'){
jj[i]+=850;
}
}
max=jj[0];
maxstu=0;
sum=jj[0];
for(i=1;i<n;i++){
if(jj[i]>max){
max=jj[i];
maxstu=i;
}
sum+=jj[i];
}
printf("%s\n%d\n%d\n",stu[maxstu].name,max,sum);
}
|
39
|
19262
|
void main()
{struct student
{char name[30];
int final;
int crit;
char leader;
char west;
int paper;}stu;
int max=0,n,i,total=0,money;
char bestboy[30];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s ",stu.name);
scanf("%d ",&stu.final);
scanf("%d ",&stu.crit);
scanf("%c ",&stu.leader);
scanf("%c ",&stu.west);
scanf("%d",&stu.paper);
money=0;
if(stu.final>80&&stu.paper!=0)//1) ????????8000??????????80??>80???????????1??1?????????????
//3) ????????2000??????????90??>90?????????
//4) ????????1000??????????85??>85?????????????
//5) ????????850??????????80??>80???????????
money+=8000;
if(stu.final>85&&stu.crit>80)//2) ????????4000??????????85??>85????????????80??>80?????????
money+=4000;
if(stu.final>90)
money+=2000;
if(stu.final>85&&stu.west=='Y')
money+=1000;
if(stu.crit>80&&stu.leader=='Y')
{money+=850;}
total+=money;
if(money>max)
{max=money;
strcpy(bestboy,stu.name);
}
}
printf("%s\n%d\n%d",bestboy,max,total);
}
|
39
|
19263
|
int main()
{
struct student
{
char nam[50];
int ave;
int ping;
char gan;
char xi;
int wen;
int total[5];
int all;
}stu[100];
int num,i,j;
int a[100]={0};
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%s%d%d %c %c%d",stu[i].nam,&stu[i].ave,&stu[i].ping,&stu[i].gan,&stu[i].xi,&stu[i].wen);
stu[i].all = 0;
memset(stu[i].total, 0, sizeof(stu[i].total));
}
for(i=0;i<num;i++)
{
if(stu[i].ave>80&&stu[i].wen>=1)
stu[i].total[0]=8000;
if(stu[i].ave>85&&stu[i].ping>80)
stu[i].total[1]=4000;
if(stu[i].ave>90)
stu[i].total[2]=2000;
if(stu[i].ave>85&&stu[i].xi=='Y')
stu[i].total[3]=1000;
if(stu[i].ping>80&&stu[i].gan=='Y')
stu[i].total[4]=850;
}
for(i=0;i<num;i++)
{
for(j=0;j<5;j++)
{
stu[i].all+=stu[i].total[j]; //????????????.
}
}
int max=0;
for(i=0;i<num;i++)
{
if(stu[i].all>max)
{
max=stu[i].all;//????????,????????
j=i;
}
}
int whole=0;
for(i=0;i<num;i++)
{
whole+=stu[i].all;
}
printf("%s\n%d\n%d",stu[j].nam,max,whole);
return 0;
}
|
39
|
19264
|
struct student
{
char Name[20];
int agrades;
int bgrades;
char a;
char b;
int n;
};
int main(int argc, char* argv[])
{
struct student *p;
int i,j,num;
scanf("%d",&num);
p=(struct student*)malloc(num*sizeof(struct student));
for(i=0;i<num;i++)
{
scanf("%s%d%d %c %c%d",p[i].Name,&p[i].agrades,&p[i].bgrades,&p[i].a,&p[i].b,&p[i].n);
//printf("%s %d %d %c %c %d",p[i].Name,p[i].agrades,p[i].bgrades,p[i].a,p[i].b,p[i].n);
}
int *p1,*p2;
p1=(int*)malloc(num*sizeof(int));
p2=(int*)malloc(num*sizeof(int));
for(i=0;i<num;i++)
{
p1[i]=0;
p2[i]=0;
if(p[i].agrades>80&&p[i].n>=1)
{
p1[i]++;
p2[i]+=8000;
}
if(p[i].agrades>85&&p[i].bgrades>80)
{
p1[i]++;
p2[i]+=4000;
}
if(p[i].agrades>90)
{
p1[i]++;
p2[i]+=2000;
}
if(p[i].agrades>85&&p[i].b=='Y')
{
p1[i]++;
p2[i]+=1000;
}
if(p[i].bgrades>80&&p[i].a=='Y')
{
p1[i]++;
p2[i]+=850;
}
}
int sum=0;
for(i=0;i<num;i++)
{
sum+=p2[i];
}
int max;
max=p2[0];
for(i=0;i<num;i++)
{
if(max<p2[i])
max=p2[i];
}
for(i=0;i<num;i++)
{
if(max==p2[i])
break;
}
printf("%s\n",p[i].Name);
printf("%d\n",p2[i]);
printf("%d",sum);
return 0;
}
|
39
|
19265
|
int main()
{
struct stu
{
char name[21];
int qm;
int cm;
char xs[21];
char west[21];
int paper;
int sp;
};
struct stu a[101];
int i,n;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",&a[i].name);
scanf("%d",&a[i].qm);
scanf("%d",&a[i].cm);
scanf("%s",&a[i].xs);
scanf("%s",&a[i].west);
scanf("%d",&a[i].paper);
a[i].sp=0;
if ((a[i].qm>80)&&(a[i].paper>0)) a[i].sp+=8000;
if ((a[i].qm>85)&&(a[i].cm>80)) a[i].sp+=4000;
if (a[i].qm>90) a[i].sp+=2000;
if ((a[i].qm>85)&&(a[i].west[0]=='Y')) a[i].sp+=1000;
if ((a[i].cm>80)&&(a[i].xs[0]=='Y')) a[i].sp+=850;
}
int max,total;
max=0;
total=0;
for (i=0;i<n;i++)
{
if (a[i].sp>a[max].sp) max=i;
total=total+a[i].sp;
}
printf("%s\n",a[max].name);
printf("%d\n",a[max].sp);
printf("%d\n",total);
return 0;
}
|
39
|
19266
|
void main()
{struct xuesheng
{char x[21];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int qian;
};
struct xuesheng x[101],*p;
int i,n,max=0,total=0,money;
char name[21];
scanf("%d",&n);
for (i=0;i<n;i++)
{scanf("%s %d %d %c %c %d\n",&x[i].x,&x[i].qimo,&x[i].banji,&x[i].ganbu,&x[i].xibu,&x[i].lunwen);
x[i].qian=0;
if (x[i].qimo>80&&x[i].lunwen!=0)
x[i].qian+=8000;
if (x[i].qimo>85&&x[i].banji>80)
x[i].qian+=4000;
if (x[i].qimo>90)
x[i].qian+=2000;
if (x[i].qimo>85&&x[i].xibu=='Y')
x[i].qian+=1000;
if (x[i].banji>80&&x[i].ganbu=='Y')
x[i].qian+=850;
total=total+x[i].qian;
}
for (i=0;i<n;i++)
if(max<x[i].qian)
{strcpy(name,x[i].x);max=x[i].qian;}
printf("%s\n%d\n%d",name,max,total);
}
|
39
|
19267
|
int main()
{
struct stu
{
char name[20];
int qimo;
int banping;
char gb[2];
char xb[2];
int lw;
long int jxj;
}stu[100];
int n,N,a=0,b=0,c=0,d=0,e=0,max,temp,totle=0;
scanf("%d",&N);
for(n=0;n<N;n++)
scanf("%s%d%d%s%s%d",&stu[n].name,&stu[n].qimo,&stu[n].banping,&stu[n].gb,&stu[n].xb,&stu[n].lw);
for(n=0;n<N;n++)
{
a=0;b=0;c=0;d=0;e=0;
if((stu[n].qimo>80)&&(stu[n].lw>=1))a=8000;
if((stu[n].qimo>85)&&(stu[n].banping>80))b=4000;
if(stu[n].qimo>90)c=2000;
if((stu[n].banping>80)&&(strcmp(stu[n].gb,"Y")==0))e=850;
if((stu[n].qimo>85)&&(strcmp("Y",stu[n].xb)==0))d=1000;
stu[n].jxj=a+b+c+d+e;
}
for(n=0;n<N;n++)
{
totle+=stu[n].jxj;
}
for(n=1;n<N;n++)
if(stu[n].jxj>stu[0].jxj)
{
temp=stu[0].jxj;
stu[0].jxj=stu[n].jxj;
stu[n].jxj=temp;
strcpy(stu[0].name,stu[n].name);
}
printf("%s\n%d\n%d\n",stu[0].name,stu[0].jxj,totle);
return 0;
}
|
39
|
19268
|
struct student
{
char name[20];
int aver;
int judge;
char a;
char b;
int punish;
int prize;
struct student *next;
};
int stu_num;
struct student *creat(void)
{
struct student *head,*p1,*p2;
int n;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->aver,&p1->judge,&p1->a,&p1->b,&p1->punish);
head=NULL;
n=0;
while(n<stu_num-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->aver,&p1->judge,&p1->a,&p1->b,&p1->punish);
}
p2->next=p1;
p1->next=NULL;
return(head);
}
void main()
{
struct student *head,*q1,*q2;
int sum=0;
scanf("%d",&stu_num);
head=creat();
q1=head;
q2=head;
while(q1!=NULL)
{
q1->prize=0;
if(q1->aver>80&&q1->punish>0)
q1->prize+=8000;
if(q1->aver>85&&q1->judge>80)
q1->prize+=4000;
if(q1->aver>90)
q1->prize+=2000;
if(q1->aver>85&&q1->b=='Y')
q1->prize+=1000;
if(q1->judge>80&&q1->a=='Y')
q1->prize+=850;
sum+=q1->prize;
if(q2->prize<q1->prize)
q2=q1;
q1=q1->next;
}
printf("%s\n%d\n%d\n",q2->name,q2->prize,sum);
}
|
39
|
19269
|
void main()
{
int max,n,i,g=0,sum,qimo,banji,lunwen,zong[200];
char name[200][20],ganbu,xibu;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",name[i],&qimo,&banji,&ganbu,&xibu,&lunwen);
zong[i]=0;
if(qimo>80&&lunwen>=1)
zong[i]=zong[i]+8000;
if(banji>80&&qimo>85)
zong[i]=zong[i]+4000;
if(qimo>90)
zong[i]=zong[i]+2000;
if(qimo>85&&xibu=='Y')
zong[i]=zong[i]+1000;
if(banji>80&&ganbu=='Y')
zong[i]=zong[i]+850;
}
max=zong[0];
sum=zong[0];
for(i=1;i<n;i++)
{
if(zong[i]>max)
{
max=zong[i];
g=i;
}
sum=sum+zong[i];
}
for(i=0;i<strlen(name[g]);i++)
printf("%c",name[g][i]);
printf("\n%d\n%d",zong[g],sum);
}
|
39
|
19270
|
int main(){
struct scholar {
char z[21];
int qm;
int bj;
char gb;
char xb;
int paper;
int total;
};
struct scholar a[1000];
int n, i;
scanf("%d", &n);
for (i=0; i<n; i++){
scanf("%s %d %d %c %c %d", a[i].z, &a[i].qm, &a[i].bj, &a[i].gb, &a[i].xb, &a[i].paper);
a[i].total=0;
}
for (i=0; i<n; i++){
if (a[i].qm>80&&a[i].paper>0)
a[i].total+=8000;
if (a[i].qm>85&&a[i].bj>80)
a[i].total+=4000;
if (a[i].qm>90)
a[i].total+=2000;
if (a[i].qm>85&&a[i].xb=='Y')
a[i].total+=1000;
if (a[i].bj>80&&a[i].gb=='Y')
a[i].total+=850;
}
int max=0;
char name[22];
int total=0;
for (i=0; i<n; i++){
if (a[i].total>max){
max=a[i].total;
strcpy(name, a[i].z);
}
total+=a[i].total;
}
printf("%s\n%d\n%d\n", name, max, total);
return 0;
}
|
39
|
19271
|
struct student
{
char name[25];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int jiangjin;
};
void main()
{
int n,q=0;
struct student stu[100];
int i,j,k,r,m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
// scanf("%d",&stu[i].qimo);
// scanf("%d",&stu[i].banji);
// scanf("&c",&stu[i].ganbu);
// scanf("%c",&stu[i].xibu);
// scanf("%d",&stu[i].lunwen);
stu[i].jiangjin=0;
}
for(i=0;i<n;i++)
{
if(stu[i].qimo>80&&stu[i].lunwen>=1)stu[i].jiangjin=stu[i].jiangjin+8000;
if(stu[i].qimo>85&&stu[i].banji>80)stu[i].jiangjin=stu[i].jiangjin+4000;
if(stu[i].qimo>90)stu[i].jiangjin=stu[i].jiangjin+2000;
if(stu[i].qimo>85&&stu[i].xibu=='Y')stu[i].jiangjin=stu[i].jiangjin+1000;
if(stu[i].banji>80&&stu[i].ganbu=='Y')stu[i].jiangjin=stu[i].jiangjin+850;
q=q+stu[i].jiangjin;
}
for(i=0,q=0;i<n;i++)
{
if(stu[i].jiangjin>m)m=stu[i].jiangjin;
q=q+stu[i].jiangjin;
}
for(i=0;i<n;i++)
{
if(stu[i].jiangjin==m)
{
printf("%s\n",stu[i].name);
printf("%d\n",m);
printf("%d",q);
break;
}
}
}
|
39
|
19272
|
struct stu
{
char nam[40];
int qi;
int pi;
char gan;
char xi;
int lun;
int ji;
}stu[102];
void main()
{
int total=0;
int i,n,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].nam,&stu[i].qi,&stu[i].pi,&stu[i].gan,&stu[i].xi,&stu[i].lun);
}
for(i=0;i<n;i++)
{
stu[i].ji=0;
if(stu[i].qi>80&&stu[i].lun>0)
stu[i].ji+=8000;
if(stu[i].qi>85&&stu[i].pi>80)
stu[i].ji+=4000;
if(stu[i].qi>90)
stu[i].ji+=2000;
if(stu[i].qi>85&&stu[i].xi=='Y')
stu[i].ji+=1000;
if(stu[i].pi>80&&stu[i].gan=='Y')
stu[i].ji+=850;
}
for(i=0;i<n;i++)
{
total+=stu[i].ji;
}
for(i=1;i<n;i++)
{
if(stu[i].ji>stu[k].ji)
stu[k]=stu[i];
}
printf("%s\n",stu[k].nam);
printf("%d\n",stu[k].ji);
printf("%d\n",total);
}
|
39
|
19273
|
void main()
{
char name[100][21],gan[100],west[100],temp1[21];
int end[100],cls[100],esy[100],rmb[100];
int n,i,j,sum,temp2;
char a='Y';
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",name[i],&end[i],&cls[i],&gan[i],&west[i],&esy[i]);
}
for(i=0;i<n;i++)
{
rmb[i]=0;
if(end[i]>80&&esy[i]>0) rmb[i]+=8000;
if(end[i]>85&&cls[i]>80) rmb[i]+=4000;
if(end[i]>90) rmb[i]+=2000;
if(end[i]>85&&west[i]==a) rmb[i]+=1000;
if(cls[i]>80&&gan[i]==a) rmb[i]+=850;
}
for(i=0,sum=0;i<n;i++)
{
sum+=rmb[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(rmb[j]>=rmb[j+1])
{
temp2=rmb[j];
rmb[j]=rmb[j+1];
rmb[j+1]=temp2;
strcpy(temp1,name[j]);
strcpy(name[j],name[j+1]);
strcpy(name[j+1],temp1);
}
}
}
printf("%s\n",name[n-1]);
printf("%d\n",rmb[n-1]);
printf("%d\n",sum);
}
|
39
|
19274
|
struct stu
{
char name[25];
int score;
int clas;
char job;
char west;
int paper;
int sum;
struct stu*next;
};
void main()
{
int n,m=0,max=0,all=0;
char c[25]={'\0'};
scanf("%d",&n);
struct stu*p1,*p2,*head;
struct stu*p;
p1=(struct stu*)malloc(LEN);
scanf("%s%d%d %c %c %d",p1->name,&p1->score,&p1->clas,&p1->job,&p1->west,&p1->paper);
p1->sum=0;
head=NULL;
while(n)
{
m+=1;
if(m==1)
head=p1;
else p2->next=p1;
p2=p1;
p1=(struct stu*)malloc(LEN);
scanf("%s%d%d %c %c %d",p1->name,&p1->score,&p1->clas,&p1->job,&p1->west,&p1->paper);
p1->sum=0;
n--;
}
p2->next=NULL;
p=head;
while(p)
{
if(p->clas>80)
{
if(p->job=='Y')
p->sum+=850;
if(p->score>85)
p->sum+=4000;
}
if(p->score>80)
{
if(p->paper)
p->sum+=8000;
if(p->score>85)
{
if(p->west=='Y')
p->sum+=1000;
if(p->score>90)
p->sum+=2000;
}
}
if(p->sum>max)
{
max=p->sum;
strcpy(c,p->name);
}
all+=p->sum;
p=p->next;
}
puts(c);
printf("%d\n%d",max,all);
}
|
39
|
19275
|
struct file
{
char name[50];
int exam;
int judge;
char worker;
char west;
int paper;
int scholarship;
};
int yuanshi(int exam,int paper)
{
if(exam>80&&paper>=1)
{
return 1;
}
else
{
return 0;
}
}
int wusi(int exam,int judge)
{
if(exam>85&&judge>80)
{
return 1;
}
else
{
return 0;
}
}
int chengji(int exam)
{
if(exam>90)
{
return 1;
}
else
{
return 0;
}
}
int xibu(int exam,char west)
{
if(exam>85&&west=='Y')
{
return 1;
}
else
{
return 0;
}
}
int banji(int judge,char worker)
{
if(judge>80&&worker=='Y')
{
return 1;
}
else
{
return 0;
}
}
void main()
{
struct file a[110];
int i,n,sum=0,max=0,orient;
for(i=1;i<=110;i++)
{
a[i-1].scholarship=0;
}
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&a[i].name,&a[i].exam,&a[i].judge,&a[i].worker,&a[i].west,&a[i].paper);
if(yuanshi(a[i].exam,a[i].paper))
{
a[i].scholarship+=8000;
}
if(wusi(a[i].exam,a[i].judge))
{
a[i].scholarship+=4000;
}
if(chengji(a[i].exam))
{
a[i].scholarship+=2000;
}
if(xibu(a[i].exam,a[i].west))
{
a[i].scholarship+=1000;
}
if(banji(a[i].judge,a[i].worker))
{
a[i].scholarship+=850;
}
sum+=a[i].scholarship;
}
for(i=1;i<=n;i++)
{
if(a[i].scholarship>max)
{
max=a[i].scholarship;
orient=i;
}
}
printf("%s\n%d\n%d",a[orient].name,max,sum);
}
|
39
|
19276
|
struct student
{
char name[20];
int final;
int cla;
char job;
char west;
int essay;
int bonus;
};
int sco1(struct student a);
int sco2(struct student a);
int sco3(struct student a);
int sco4(struct student a);
int sco5(struct student a);
void bubble(struct student *p,int n);
void main()
{
int n,i,total=0;
struct student stu[101]={0,0,0,0,0,0,0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].cla,&stu[i].job,&stu[i].west,&stu[i].essay);
stu[i].bonus=sco1(stu[i])+sco2(stu[i])+sco3(stu[i])+sco4(stu[i])+sco5(stu[i]);
total=total+stu[i].bonus;
}
bubble(stu,n);
printf("%s\n%d\n%d",stu[0].name,stu[0].bonus,total);
}
int sco1(struct student a)
{
if(a.final>80&&a.essay>0)
return 8000;
else
return 0;
}
int sco2(struct student a)
{
if(a.final>85&&a.cla>80)
return 4000;
else
return 0;
}
int sco3(struct student a)
{
if(a.final>90)
return 2000;
else
return 0;
}
int sco4(struct student a)
{
if(a.final>85&&a.west=='Y')
return 1000;
else
return 0;
}
int sco5(struct student a)
{
if(a.cla>80&&a.job=='Y')
return 850;
else
return 0;
}
void bubble(struct student * p,int n)
{
int i,j;
struct student t;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
{
if(p[j].bonus<p[j+1].bonus)
{t=p[j];p[j]=p[j+1];p[j+1]=t;}
}
}
}
|
39
|
19277
|
void main()
{
int n,all=0,i,j,m;
struct student
{
char name[20];
int score1;
int score2;
char monitor;
char west;
int paper;
int money;
}stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,
&stu[i].score1,&stu[i].score2,&stu[i].monitor,&stu[i].west,
&stu[i].paper);
}
for(i=0;i<n;i++)
{
stu[i].money=0;
if(stu[i].score1>80 && stu[i].paper>=1)
stu[i].money+=8000;
if(stu[i].score1>85 && stu[i].score2>80)
stu[i].money+=4000;
if(stu[i].score1>90)
stu[i].money+=2000;
if(stu[i].score1>85 && stu[i].west=='Y')
stu[i].money+=1000;
if(stu[i].score2>80 && stu[i].monitor=='Y')
stu[i].money+=850;
}
m=stu[0].money;
j=0;
for(i=0;i<n;i++)
{
if(stu[i].money>m)
{
m=stu[i].money;j=i;
}
}
for(i=0;i<n;i++)
all+=stu[i].money;
printf("%s\n%d\n",stu[j].name,stu[j].money);
printf("%d\n",all);
}
|
39
|
19278
|
struct student
{
char name[20];
int exam;
int chara;
char ganbu;
char west;
int paper;
};
int scholarship(struct student stu)
{
int s=0;
if(stu.exam>80&&stu.paper>0)
s=s+8000;
if(stu.exam>85&&stu.chara>80)
s=s+4000;
if(stu.exam>90)
s=s+2000;
if(stu.exam>85&&(stu.west=='Y'))
s=s+1000;
if((stu.ganbu=='Y')&&stu.chara>80)
s=s+850;
return(s);
}
void main()
{
int n,c[100],i,sum=0,max,k;
struct student stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].exam,&stu[i].chara,&stu[i].ganbu,&stu[i].west,&stu[i].paper);
}
for(i=0;i<n;i++)
{
c[i]=scholarship(stu[i]);
sum=sum+c[i];
}
max=c[0];
k=0;
for(i=1;i<n;i++)
{
if(c[i]>max)
{
max=c[i];
k=i;
}
}
printf("%s\n",stu[k].name);
printf("%d\n",c[k]);
printf("%d\n",sum);
}
|
39
|
19279
|
struct student
{
char name[21],a,b;
int score,c,e,scholar;
};
struct student stu[100],temp;
void main()
{
int n,i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].score,&stu[i].c,&stu[i].a,&stu[i].b,&stu[i].e);
}
/*for(i=0;i<n;i++)
{
printf("%s %d %d %c %c %d\n",stu[i].name,stu[i].score,stu[i].c,stu[i].a,stu[i].b,stu[i].e);
}*/
for(i=0;i<n;i++)
{
stu[i].scholar=0;
if(stu[i].c>80&&stu[i].a=='Y')
{
stu[i].scholar+=850;
}
if(stu[i].score>85&&stu[i].b=='Y')
{
stu[i].scholar+=1000;
}
if(stu[i].score>90)
{
stu[i].scholar+=2000;
}
if(stu[i].score>85&&stu[i].c>80)
{
stu[i].scholar+=4000;
}
if(stu[i].score>80&&stu[i].e>=1)
{
stu[i].scholar+=8000;
}
}
for(j=1;j<n;j++)
{
if(stu[0].scholar<stu[j].scholar)
{
temp=stu[0];
stu[0]=stu[j];
stu[j]=temp;
}
}
for(j=0;j<n;j++)
k+=stu[j].scholar;
printf("\n%s\n%d\n%d",stu[0].name,stu[0].scholar,k);
}
|
39
|
19280
|
int main ()
{
char name[100][30];
int n,i,totle=0,m,mast=0;
int s[100][4];
char x;
char g;
scanf("%d",&n);
for(i=0;i<n;i++){
s[i][3]=0;
scanf("%s%d%d %c %c%d",name[i],&s[i][0],&s[i][1],&g,&x,&s[i][2]);
if(s[i][0]>80){
if(s[i][2]!=0){
s[i][3]=s[i][3]+8000;
}
}
if(s[i][0]>85){
if(s[i][1]>80){
s[i][3]=s[i][3]+4000;
}
if(x=='Y'){
s[i][3]=s[i][3]+1000;
}
}
if(s[i][0]>90){
s[i][3]=s[i][3]+2000;
}
if(s[i][1]>80&&g=='Y'){
s[i][3]=s[i][3]+850;
}
if(s[i][3]>mast){
mast=s[i][3];
m=i;
}
totle=totle+s[i][3];
}
printf("%s",name[m]);
printf("\n%d\n%d",mast,totle);
return 0;
}
|
39
|
19281
|
int main()
{
int i,n,zong=0,max;
int a[100],b[100],r[100];
char name[100][21],s[100],t[100],temp[20];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",&name[i],&a[i],&b[i],&s[i],&t[i],&r[i]);
}
int sum[100]={0};
for(i=0;i<n;i++){
if((a[i]>80)&&(r[i]>=1)){
sum[i]+=8000;
}
if((a[i]>85)&&(b[i]>80)){
sum[i]+=4000;
}
if(a[i]>90){
sum[i]+=2000;
}
if((a[i]>85)&&(t[i]=='Y')){
sum[i]+=1000;
}
if((b[i]>80)&&(s[i]=='Y')){
sum[i]+=850;
}
}
max=sum[0];
for(i=0;i<n;i++){
if(sum[i]>max){
max=sum[i];
strcpy(temp,name[i]);
}
}
for(i=0;i<n;i++){
zong+=sum[i];
}
printf("%s\n",temp);
printf("%d\n",max);
printf("%d\n",zong);
return 0;
}
|
39
|
19282
|
void main()
{
int n,i,r;
char a[101][50],b[101],c[101];
int d[101],e[101],f[101],g[150];
scanf("%d",&n);
for (i=0;i<n;i++)
{
g[i]=0;
scanf("%s %d %d %c %c %d",a[i],&d[i],&e[i],&b[i],&c[i],&f[i]);
if (d[i]>80&&f[i]>=1)
g[i]=g[i]+8000;
if (d[i]>85&&e[i]>80)
g[i]=g[i]+4000;
if (d[i]>90)
g[i]=g[i]+2000;
if (d[i]>85&&c[i]=='Y')
g[i]=g[i]+1000;
if (e[i]>80&&b[i]=='Y')
g[i]=g[i]+850;
}
g[101]=0;g[102]=0;
for (i=0;i<n;i++)
{
g[102]=g[102]+g[i];
if (g[i]>g[101])
{
g[101]=g[i];r=i;
}
}
printf("%s\n",a[r]);
printf("%d\n",g[101]);
printf("%d\n",g[102]);
}
|
39
|
19283
|
struct student
{
char name[20];
int mark[2];
char leader;
char west;
int paper;
int money;
}stu[100];
void main()
{
int n,i,j,max,sum=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].mark[0],&stu[i].mark[1],
&stu[i].leader,&stu[i].west,&stu[i].paper);
stu[i].money=0;
if (stu[i].mark[0]>80 && stu[i].paper>=1) stu[i].money+=8000;
if (stu[i].mark[0]>85 && stu[i].mark[1]>80) stu[i].money+=4000;
if (stu[i].mark[0]>90) stu[i].money+=2000;
if (stu[i].mark[0]>85 && stu[i].west=='Y') stu[i].money+=1000;
if (stu[i].mark[1]>80 && stu[i].leader=='Y') stu[i].money+=850;
sum+=stu[i].money;
}
max=stu[0].money;
for (i=1;i<n;i++)
{
if (stu[i].money>max) {max=stu[i].money;j=i;}
}
printf("%s\n%d\n",stu[j].name,stu[j].money);
printf("%d",sum);
}
|
39
|
19284
|
struct stu
{char name[24];
int score;
int ass;
char pos;
char west;
int paper;
int fel;
};
int f(struct stu*q)
{int z=0;
if( q->score>80 && q->paper>0 ) z=z+8000;
if( q->score>85 && q->ass>80 ) z=z+4000;
if( q->score>90) z=z+2000;
if( q->score>85 && q->west=='Y' ) z=z+1000;
if( q->ass>80 && q->pos=='Y' ) z=z+850;
return(z);
}
void main()
{struct stu* p;
int n,i,m=0,t=0;
scanf("%d",&n);
p=(struct stu*)malloc(n*sizeof(struct stu));
for(i=0;i<n;i++)
{scanf("%s %d %d %c %c %d",(p+i)->name,&(p+i)->score,&(p+i)->ass,&(p+i)->pos,&(p+i)->west,&(p+i)->paper);
(p+i)->fel=f(p+i);
t=t+(p+i)->fel;
}
for(i=1;i<n;i++)
if( (p+i)->fel > (p+m)->fel ) m=i;
printf("%s\n%d\n%d",(p+m)->name,(p+m)->fel,t);
}
|
39
|
19285
|
struct student
{char name[20];
int endmark;
int mark;
char ganbu;
char xibu;
int essay;
}stu[100];
void main()
{
int n,i,max,p,sum=0;
int scholar[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].endmark,&stu[i].mark,&stu[i].ganbu,&stu[i].xibu,&stu[i].essay);
}
for(i=0;i<n;i++)
{
if(stu[i].endmark>80&&stu[i].essay>=1) scholar[i]=scholar[i]+8000;
if(stu[i].endmark>85&&stu[i].mark>80) scholar[i]=scholar[i]+4000;
if(stu[i].endmark>90) scholar[i]=scholar[i]+2000;
if(stu[i].endmark>85&&stu[i].xibu=='Y') scholar[i]=scholar[i]+1000;
if(stu[i].mark>80&&stu[i].ganbu=='Y') scholar[i]=scholar[i]+850;
}
max=scholar[0];
for(i=0;i<n;i++)
{
if(scholar[i]>max) max=scholar[i];
}
for(i=n-1;i>=0;i--)
{
if(scholar[i]==max) p=i;
}
for(i=0;i<n;i++)
{
sum=sum+scholar[i];
}
printf("%s\n%d\n%d\n",stu[p].name,max,sum);
}
|
39
|
19286
|
int main()
{
struct stud
{
char na[25];
int ag,cg,l;
int t;
char gb,x;
}st[101];
int i,n,num=0,re,max=0;
long total;
total=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
st[i].t=0;
scanf("%s",st[i].na);
scanf("%d %d %c %c %d",&st[i].ag,&st[i].cg,&st[i].gb,&st[i].x,&st[i].l);
if ((st[i].ag>85) && (st[i].x=='Y'))
st[i].t=st[i].t+1000;
if ((st[i].ag>85) && (st[i].cg>80))
st[i].t=st[i].t+4000;
if ((st[i].ag>80) && (st[i].l>=1))
st[i].t=st[i].t+8000;
if ((st[i].gb=='Y') && (st[i].cg>80))
st[i].t=st[i].t+850;
if (st[i].ag>90)
st[i].t=st[i].t+2000;
total=(long)(total+st[i].t);
}
for (i=0;i<n;i++)
{
if (st[i].t>=max)
{
max=st[i].t;
num++;
re=i;
}
}
if (num==1)
printf("%s\n%d\n%ld\n",st[re].na,st[re].t,total);
else
{
num=0;
for (i=0;num<1;i++)
{
if (st[i].t==max)
{
printf("%s\n%d\n%d\n",st[i].na,st[i].t,total);
num++;
}
}
}
return 0;
}
|
39
|
19287
|
struct l
{
char a[22];
int x;
int y;
char m;
char n;
int h;
};
int main()
{
int n,i;
cin>>n;
struct l s[101];
int f=0,j,c=0;
for(i=1;i<=n;i++)
{
int p=0;
cin>>s[i].a;
cin>>s[i].x;
cin>>s[i].y;
cin>>s[i].m;
cin>>s[i].n;
cin>>s[i].h;
if(s[i].x>80&&s[i].h>=1)
p+=8000;
if(s[i].x>85&&s[i].y>80)
p+=4000;
if(s[i].x>90)
p+=2000;
if(s[i].x>85&&s[i].n=='Y')
p+=1000;
if(s[i].y>80&&s[i].m=='Y')
p+=850;
c+=p;
if(p>f)
{
f=p;
j=i;
}
}
cout<<s[j].a<<endl;
cout<<f<<endl;
cout<<c<<endl;
return 0;
}
|
39
|
19288
|
struct student
{
char name[21];
int qimo;
int pingyi;
char ganbu;
char xibu;
int paper;
int money;
};
int main()
{
int n,i,j,e,moneyzong=0;
char name1[21];
scanf("%d",&n);
struct student*a=(struct student*)malloc(sizeof(struct student)*n);
for(i=0;i<n;i++)
{
a[i].money=0;
}
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].qimo,&a[i].pingyi,&a[i].ganbu,&a[i].xibu,&a[i].paper);
if(a[i].qimo>80&&a[i].paper>=1)
a[i].money+=8000;
if(a[i].qimo>85&&a[i].pingyi>80)
a[i].money+=4000;
if(a[i].qimo>90)
a[i].money+=2000;
if(a[i].qimo>85&&a[i].xibu=='Y')
a[i].money+=1000;
if(a[i].pingyi>80&&a[i].ganbu=='Y')
a[i].money+=850;
}
for(i=0;i<n;i++)
{
moneyzong+=a[i].money;
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1;j++)
{
if(a[i].money>=a[i+1].money)
{
e=a[i].money;
a[i].money=a[i+1].money;
a[i+1].money=e;
strcpy(name1,a[i].name);
strcpy(a[i].name,a[i+1].name);
strcpy(a[i+1].name,name1);
}
}
}
printf("%s\n%d\n%d\n",a[n-1].name,a[n-1].money,moneyzong);
return 0;
}
|
39
|
19289
|
int main()
{
struct student
{
char name[21];
int final;
int cla;
char l;
char w;
int paper;
int total;
};
int k,i,t,max;
t=max=0;
struct student stu[100];
scanf("%d",&k);
for(i=0;i<=k-1;i++)
{
scanf("%s %d%d %c %c %d",stu[i].name,&stu[i].final,&stu[i].cla,&stu[i].l,&stu[i].w,&stu[i].paper);
stu[i].total=0;
if(stu[i].final>80&&stu[i].paper>=1) stu[i].total=stu[i].total+8000;
if(stu[i].final>85&&stu[i].cla>80) stu[i].total=stu[i].total+4000;
if(stu[i].final>90) stu[i].total=stu[i].total+2000;
if(stu[i].final>85&&stu[i].w=='Y') stu[i].total=stu[i].total+1000;
if(stu[i].cla>80&&(stu[i].l=='Y')) stu[i].total=stu[i].total+850;
}
for(i=0;i<=k-1;i++)
{
if(stu[i].total>max)
max=stu[i].total;
t=t+stu[i].total;
}
for(i=0;i<=k-1;i++)
{
if(stu[i].total==max)
{
printf("%s\n",stu[i].name);
printf("%d\n",stu[i].total);
break;
}
}
printf("%d\n",t);
return 0;
}
|
39
|
19290
|
int main()
{
int n,i,a,b,c,j[100],j1[100],sum=0;
char m,l,s[100][20];
scanf("%d",&n);
for(i=0;i<n;i++){
j[i]=0;
scanf("%s %d %d %c %c %d",s[i],&a,&b,&m,&l,&c);
if(a>80&&c>=1){
j[i]=j[i]+8000;
}
if(a>85&&b>80){
j[i]=j[i]+4000;
}
if(a>90){
j[i]=j[i]+2000;
}
if(l=='Y'&&a>85){
j[i]=j[i]+1000;
}
if(m=='Y'&&b>80){
j[i]=j[i]+850;
}
}
for(i=0;i<n;i++){
sum=sum+j[i];
j1[i]=j[i];
}
for(i=0;i<n;i++){
if(j[i]>j[i+1])
j[i+1]=j[i];
}
for(i=0;i<n;i++){
if(j1[i]==j[n-1])
{
printf("%s\n",s[i]);
printf("%d\n",j[n-1]);
break;
}
}
printf("%d\n",sum);
return 0;
}
|
39
|
19291
|
struct stu
{
char name[20];
int chengji;
int pingyi;
char ganbu[1];
char xibu[1];
int lunwen;
int scholarship;
struct stu *next;
};
struct stu *creat(void)
{
int i,n;
struct stu *head;
struct stu *p1,*p2;
p1=p2=(struct stu*)malloc(LEN);
head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %s %s %d",p1->name,&p1->chengji,&p1->pingyi,p1->ganbu,p1->xibu,&p1->lunwen);
if(i==0)head=p1;
else p2=p1;
if(i!=(n-1))p1=p2->next=(struct stu*)malloc(LEN);
else {p2->next=NULL;}
}
return(head);
}
struct stu *px(struct stu *head)
{
struct stu *p1,*p2,*p3,*p4;
int k,add=0,max=0;
for(p2=head;p2!=NULL;p2=p2->next)
{
p2->scholarship=0;
}
for(p1=head;p1!=NULL;p1=p1->next)
{
if((p1->chengji>80)&&(p1->lunwen>=1))
p1->scholarship=p1->scholarship+8000;
if((p1->chengji>85)&&(p1->pingyi>80))
p1->scholarship=p1->scholarship+4000;
if(p1->chengji>90)
p1->scholarship=p1->scholarship+2000;
if((p1->chengji>85)&&(p1->xibu[0]=='Y'))
p1->scholarship=p1->scholarship+1000;
if((p1->pingyi>80)&&(p1->ganbu[0]=='Y'))
p1->scholarship=p1->scholarship+850;
}
for(p3=head;p3!=NULL;p3=p3->next)
{
k=0;
for(p4=head;p4!=NULL;p4=p4->next)
{
if(p3->scholarship<p4->scholarship)
k++;
}
if(k==0)
{
printf("%s\n%d\n",p3->name,p3->scholarship);
break;
}
}
for(p1=head;p1!=NULL;p1=p1->next)
{
add=add+p1->scholarship;
}
printf("%d\n",add);
return head;
}
void main()
{
struct stu *a,*b;
a=creat();
b=px(a);
}
|
39
|
19292
|
struct student
{
char a[20];
int chengji;
int pingyi;
char x;
char y;
int h;
struct student *next;
};
int n;
struct student *creat()
{
struct student *head;
struct student *p1,*p2;
int m;
scanf("%d",&m);
n=1;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->a,&p1->chengji,&p1->pingyi,&p1->x,&p1->y,&p1->h);
head=NULL;
do
{
if(n==1){head=p1;p2=p1;}
else {
p1=(struct student *)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->a,&p1->chengji,&p1->pingyi,&p1->x,&p1->y,&p1->h);
p2->next=p1;
p2=p1;}
n=n+1;
}while(n<=m);
p2->next=NULL;
return(head);
}
void main()
{
struct student *q,*head,*p;
int max;
int s,sum;
sum=0;
head=creat();
q=head;
max=0;
while(q!=NULL)
{
s=0;
if(q->chengji >80 && (q->h )>=1) s=s+8000;
if(q->chengji >85 && q->pingyi >80 ) s=s+4000;
if(q->chengji >90 ) s=s+2000;
if(q->chengji >85 && q->y=='Y') s=s+1000;
if(q->pingyi >80 && q->x=='Y') s=s+850;
if(s>max) max=s;
sum=sum+s;
q=q->next;
}
p=head;
while(p!=NULL)
{
s=0;
if(p->chengji >80 && (p->h )>=1) s=s+8000;
if(p->chengji >85 && p->pingyi >80 ) s=s+4000;
if(p->chengji >90 ) s=s+2000;
if(p->chengji >85 && p->y=='Y') s=s+1000;
if(p->pingyi >80 && p->x=='Y') s=s+850;
if(s==max)
{ printf("%s\n%d\n",p->a,s) ;break;}
p=p->next;
}
printf("%d",sum);
}
|
39
|
19293
|
char name[200][21];
int qmg[200];
int cg[200];
char gb[200];
char xb[200];
int lw[200];
int schsum[200];
int main(){
int n,i,num,whole;
char str1[21];
scanf("%d",&n);
for(i=0;i<n;i++){
int j;
char str2[21],x4,x5;
int x2,x3,x6;
scanf("%s %d %d %c %c %d",str2,&x2,&x3,&x4,&x5,&x6);
for (j=0;j<21;j++) name[i][j]=str2[j];
qmg[i]=x2;
cg[i]=x3;
gb[i]=x4;
xb[i]=x5;
lw[i]=x6;
//puts(str2);
}
for(i=0;i<n;i++){
schsum[i]=0;
if(qmg[i]>80&&lw[i]>=1) schsum[i]+=8000;
if(qmg[i]>85&&cg[i]>80) schsum[i]+=4000;
if(qmg[i]>90) schsum[i]+=2000;
if(xb[i]=='Y'&&qmg[i]>85) schsum[i]+=1000;
if(gb[i]=='Y'&&cg[i]>80) schsum[i]+=850;
}
num=0;
for(i=1;i<n;i++){
if (schsum[num]<schsum[i]) num=i;
}
for(i=0;i<21;i++) str1[i]=name[num][i];
puts(str1);
printf("%d\n" ,schsum[num]);
whole=0;
for(i=0;i<n;i++){
whole+=schsum[i];
}
printf("%d",whole);
//printf("%d %d %d %d" ,schsum[0],schsum[1],schsum[2],schsum[3]);
return 0;
}
|
39
|
19294
|
void main()
{
int n,i,j;
scanf("%d",&n);
char a[n][30];
int b[n][3];
char c[n][2];
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&a[i],&b[i][0],&b[i][1],&c[i][0],&c[i][1],&b[i][2]);
}
int sum[n];
for(i=0;i<n;i++)
{
sum[i]=0;
if (b[i][0]>80&&b[i][2]>0) sum[i]=sum[i]+8000;
if (b[i][0]>85&&b[i][1]>80) sum[i]=sum[i]+4000;
if (b[i][0]>90) sum[i]=sum[i]+2000;
if (b[i][0]>85&&c[i][1]=='Y') sum[i]=sum[i]+1000;
if (b[i][1]>80&&c[i][0]=='Y') sum[i]=sum[i]+850;
}
int max=sum[0],t,total=0;
char name[10];
for(i=0;i<n;i++)
{
if (max<sum[i]) {max=sum[i];t=i;}
}
for(i=0;i<n;i++)
{
total=total+sum[i];
}
printf("%s\n%d\n%d",a[t],max,total);
}
|
39
|
19295
|
struct points
{
char name[30];
int score1;
int score2;
char west;
char leader;
int essay;
int money;
}points[100];
int main()
{
int n,i,max=0,m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",points[i].name,&points[i].score1,&points[i].score2,&points[i].leader,&points[i].west,&points[i].essay);
points[i].money=0;
}
for(i=0;i<n;i++)
{
if(points[i].score1>90)
{
points[i].money=points[i].money+2000;
}
if(points[i].score1>85&&points[i].score2>80)
{
points[i].money=points[i].money+4000;
}
if(points[i].score1>85&&points[i].west=='Y')
{
points[i].money=points[i].money+1000;
}
if(points[i].score2>80&&points[i].leader=='Y')
{
points[i].money=points[i].money+850;
}
if(points[i].score1>80&&points[i].essay>=1)
{
points[i].money=points[i].money+8000;
}
}
char *p=points[0].name;
for(i=0;i<n;i++)
{
if( points[i].money>max)
{
max=points[i].money;
p=points[i].name;
}
}
for(i=0;i<n;i++)
{
m=m+points[i].money;
}
printf("%s\n",p);
printf("%d\n",max);
printf("%d\n",m);
return 0;
}
|
39
|
19296
|
int N;
struct student
{
char name[20];
int score1;
int score2;
char c1;
char c2;
int paper;
int money;
struct student*next;
};
void mon(struct student*p)
{
p->money=0;
if((p->score1>80)&&(p->paper>=1))
{
p->money=p->money+8000;
}
if((p->score1>85)&&(p->score2>80))
{
p->money+=4000;
}
if(p->score1>90)
{
p->money+=2000;
}
if((p->score1>85)&&(p->c2=='Y'))
{
p->money+=1000;
}
if((p->score2>80)&&(p->c1=='Y'))
{
p->money+=850;
}
}
struct student*creat()
{
struct student*head,*p1,*p2;
int i;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->score1,&p1->score2,&p1->c1,&p1->c2,&p1->paper);
p1->next=NULL;
mon(p1);
head=p1;
p2=p1;
for(i=1;i<N;i++)
{
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->score1,&p1->score2,&p1->c1,&p1->c2,&p1->paper);
p1->next=NULL;
mon(p1);
p2->next=p1;
p2=p1;
}
return(head);
}
void f(struct student*head)
{
int max;
int sum=0;
char name[20];
struct student*p;
max=head->money;
strcpy(name,head->name);
for(p=head;p;p=p->next)
{
sum+=p->money;
if(p->money>max)
{
max=p->money;
strcpy(name,p->name);
}
}
printf("%s\n%d\n%d\n",name,max,sum);
}
int main()
{
struct student*head;
scanf("%d",&N);
head=creat();
f(head);
}
|
39
|
19297
|
struct student
{
char name[20];
int score;
int judge;
char c1;
char c2;
char num;
int money;
};
int main()
{
struct student a[501];
char s1[20];
int i,n,max=0,sum=0;
int score1,num1,judge1;
char c11,c12;
struct student *p;
p=a;
scanf("%d",&n);
for(;p<a+n;p++)
{
scanf("%s",s1);
strcpy(p->name,s1);
scanf("%d %d %c %c %d",&score1,&judge1,&c11,&c12,&num1);
p->c1=c11;
p->c2=c12;
p->judge=judge1;
p->num=num1;
p->score=score1;
p->money=0;
}
p=a;
for(;p<a+n;p++)
{
if(p->score>80&&p->num>0) p->money+=8000;
if(p->judge>80&&p->score>85) p->money+=4000;
if(p->score>90) p->money+=2000;
if(p->c1=='Y'&&p->judge>80) p->money+=850;
if(p->c2=='Y'&&p->score>85) p->money+=1000;
}
p=a;
for(;p<a+n;p++)
{
if(p->money>max) max=p->money;
sum+=p->money;
}
p=a;
for(;p<a+n;p++)
{
if(p->money==max)
{
printf("%s\n%d\n",p->name,p->money);
break;
}
}
printf("%d\n",sum);
return 0;
}
|
39
|
19298
|
main()
{struct student
{char name[20];
int average;
int classeva;
char leader;
char western;
int paper;
};
int n,i;
scanf("%d",&n);
struct student stu[100];
for(i=0;i<n;i++)
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].average,&stu[i].classeva,
&stu[i].leader,&stu[i].western,&stu[i].paper);
int sum[100],max=0;
long total=0;
for(i=0;i<n;i++)
{sum[i]=0;
if(stu[i].average>80&&stu[i].paper>=1)sum[i]+=8000;
if(stu[i].average>85&&stu[i].classeva>80)sum[i]+=4000;
if(stu[i].average>90)sum[i]+=2000;
if(stu[i].average>85&&stu[i].western=='Y')sum[i]+=1000;
if(stu[i].classeva>80&&stu[i].leader=='Y')sum[i]+=850;
total+=sum[i];
if(sum[i]>max)max=sum[i];
}
for(i=0;i<n;i++)
if(sum[i]==max)break;
printf("%s\n%d\n%ld",stu[i].name,max,total);
}
|
39
|
19299
|
main()
{
int n;
int i;
int j=0;
int s;
int all=0;
scanf("%d",&n);
struct student
{
char name[20];
int avg;
int cls;
char aso[2];
char wst[2];
int pap;
int mny;
};
struct student stu[101];
for(i=0;i<n;i++)
{
scanf("%s %d %d %s %s %d",stu[i].name,&stu[i].avg,&stu[i].cls,stu[i].aso,stu[i].wst,&stu[i].pap);
}
for(i=0;i<n;i++)
stu[i].mny=0;
for(i=0;i<n;i++)
{
if((stu[i].avg>80)&(stu[i].pap>=1))
stu[i].mny=stu[i].mny+8000;
if((stu[i].avg>85)&(stu[i].cls>80))
stu[i].mny=stu[i].mny+4000;
if(stu[i].avg>90)
stu[i].mny=stu[i].mny+2000;
if((stu[i].avg>85)&(stu[i].wst[0]=='Y'))
stu[i].mny=stu[i].mny+1000;
if((stu[i].cls>80)&(stu[i].aso[0]=='Y'))
stu[i].mny=stu[i].mny+850;
}
s=stu[0].mny;
for(i=1;i<n;i++)
{
if(stu[i].mny>s)
{
s=stu[i].mny;
j=i;
}
}
for(i=0;i<n;i++)
all=all+stu[i].mny;
printf("%s\n",stu[j].name);
printf("%d\n",s);
printf("%d",all);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.