id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
19,300 | 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 |
19,301 | struct student
{
char name[20];
int qimo;
int banji;
char ganbu;
char xisheng;
int lunwen;
}stu[300];
int main(){
int n,m,i,sum=0;
int money[300];
char a[20];
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].xisheng,&stu[i].lunwen);
}
for(i=0;i<n;i++){
money[i]=0;
if(stu[i].qimo>80&&stu[i].lunwen>0){
money[i]=money[i]+8000;
}
if(stu[i].qimo>85&&stu[i].banji>80){
money[i]=money[i]+4000;
}
if(stu[i].qimo>90){
money[i]=money[i]+2000;
}
if(stu[i].qimo>85&&stu[i].xisheng=='Y'){
money[i]=money[i]+1000;
}
if(stu[i].banji>80&&stu[i].ganbu=='Y'){
money[i]=money[i]+850;
}
sum=sum+money[i];
}
strcpy(a,stu[0].name);
m=money[0];
for(i=1;i<n;i++){
if(money[i]>m){
m=money[i];
strcpy(a,stu[i].name);
}
}
printf("%s\n%d\n%d\n",a,m,sum);
return 0;
}
| 39 |
19,302 | struct student
{
char name[25];
int qmpj;
int bjpy;
char gb;
char xb;
int paper;
int money;
};
void main()
{
int n,i,total=0,c1,c2,c3;
struct student stu[100];
struct student *p,*m;
scanf("%d",&n);
for(p=stu;p<stu+n;p++)
{
scanf("%s%d%d%c%c%c%c%c%d",&((*p).name),&((*p).qmpj),&((*p).bjpy),&c1,&((*p).gb),&c2,&((*p).xb),&c3,&((*p).paper));
p->money=0;
}
for(p=stu;p<stu+n;p++)
{
if(p->qmpj>80&&p->paper>0)
p->money=p->money+8000;
if(p->qmpj>85&&p->bjpy>80)
p->money=p->money+4000;
if(p->qmpj>90)
p->money=p->money+2000;
if(p->qmpj>85&&p->xb=='Y')
p->money=p->money+1000;
if(p->bjpy>80&&p->gb=='Y')
p->money=p->money+850;
}
m=stu;
for(p=stu;p<stu+n;p++)
{
if(p->money>m->money)
m=p;
total=p->money+total;
}
printf("%s\n%d\n%d\n",m->name,m->money,total);
} | 39 |
19,303 |
int main(int argc, char* argv[])
{
int n,i,j,z=0,p[100],b[100],l[100],sum[100];
char g[100],x[100];
char m[100][20];
scanf("%d\n",&n);
for (i=0;i<n;i++)
{
scanf("%s",m[i]);
scanf("%d%d",&p[i],&b[i]);
scanf(" %c %c ",&g[i],&x[i]);
scanf("%d",&l[i]);
}
for (i=0;i<n;i++)
{
sum[i]=0;
if (p[i]>90) sum[i]=sum[i]+2000;
if (p[i]>85)
{
if (b[i]>80) sum[i]=sum[i]+4000;
if (x[i]=='Y') sum[i]=sum[i]+1000;
}
if ((p[i]>80)&&(l[i]>0)) sum[i]=sum[i]+8000;
if ((b[i]>80)&&(g[i]=='Y')) sum[i]=sum[i]+850;
}
for (i=0;i<n;i++) z=sum[i]+z;
int max=sum[0];
j=0;
for (i=0;i<n;i++)
{
if (sum[i]>max)
{
max=sum[i];
j=i;
}
}
printf("%s\n%d\n%d\n",m[j],max,z);
return 0;
}
| 39 |
19,304 | struct student
{
char name[30];
int mark1;
int mark2;
char worker;
char west;
int paper;
int RMB;
}stu[Max];
int main()
{
int n,i=0,j,S=0,b[Max],t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
stu[i].RMB=0;
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].mark1,&stu[i].mark2,&stu[i].worker,&stu[i].west,&stu[i].paper);
if(stu[i].mark1>80&&stu[i].paper!=0)
stu[i].RMB=stu[i].RMB+8000;
if(stu[i].mark1>85&&stu[i].mark2>80)
stu[i].RMB=stu[i].RMB+4000;
if(stu[i].mark1>90)
stu[i].RMB=stu[i].RMB+2000;
if(stu[i].mark2>80&&stu[i].worker=='Y')
stu[i].RMB=stu[i].RMB+850;
if(stu[i].mark1>85&&stu[i].west=='Y')
stu[i].RMB=stu[i].RMB+1000;
b[i]=stu[i].RMB;
}
for(i=0;i<n;i++)
{
S=S+stu[i].RMB;
}
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
{
if(b[j+1]<b[j])
{
t=b[j+1];
b[j+1]=b[j];
b[j]=t;
}
}
for(i=0;i<n;i++)
if(stu[i].RMB==b[n-1]){
printf("%s\n%d\n%d\n",stu[i].name,stu[i].RMB,S);
break;}
return 0;
}
| 39 |
19,305 | 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 |
19,306 | 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 |
19,307 | int main(){
struct student{
char name[20];
int grade1;
int grade2;
char jerk;
char west;
int paper;
};
struct student nerd[100];
int n,i,j,blame[100]={0},max=0,sin=0;
scanf("%d",&n);
for(i=0;i<=(n-1);i++){
scanf("%s %d %d %c %c %d",nerd[i].name,&nerd[i].grade1,&nerd[i].grade2,&nerd[i].jerk,&nerd[i].west,&nerd[i].paper);
}
for(i=0;i<n;i++){
if(nerd[i].grade1>80&&nerd[i].paper>=1){
blame[i]+=8000;
}
if(nerd[i].grade1>85&&nerd[i].grade2>80){
blame[i]+=4000;
}
if(nerd[i].grade1>90){
blame[i]+=2000;
}
if(nerd[i].grade1>85&&nerd[i].west=='Y'){
blame[i]+=1000;
}
if(nerd[i].grade2>80&&nerd[i].jerk=='Y'){
blame[i]+=850;
}
}
for(i=0;i<n;i++){
if(blame[i]>max){
j=i;
max=blame[i];
}
sin+=blame[i];
}
printf("%s\n",nerd[j].name);
printf("%d\n%d",max,sin);
return 0;
} | 39 |
19,308 | struct student
{
char name[20];
int score1;
int score2;
char lead;
char west;
int paper;
int sum;
struct student *next;
};
int money(struct student *p)
{
int z=0;
if((p->score1>80)&&(p->paper>=1))
z+=8000;
if((p->score1>85)&&(p->score2>80))
z+=4000;
if(p->score1>90)
z+=2000;
if((p->score1>85)&&(p->west=='Y'))
z+=1000;
if((p->score2>80)&&(p->lead=='Y'))
z+=850;
return(z);
}
void main()
{
long total=0;
struct student *p1,*p2,*p0,*head;
int n,i;
scanf("%d",&n);
p1=p2=(struct student*)malloc(LEN);
head=NULL;
scanf("%s %d %d %c %c %d\n",p1->name,&p1->score1,&p1->score2,&p1->lead,&p1->west,&p1->paper);
p0=p1;
p1->sum=money(p1);
total+=p1->sum;
for(i=1;i<n;i++)
{
if(i==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d\n",p1->name,&p1->score1,&p1->score2,&p1->lead,&p1->west,&p1->paper);
p1->sum=money(p1);
if(p0->sum<p1->sum)p0=p1;
total+=p1->sum;
}
printf("%s\n%d\n%ld\n",p0->name,p0->sum,total);
} | 39 |
19,309 | void main()
{
int a[100]={0},i,j,n,sum=0,p;
struct student
{
char name[20];
int qimo;
int banpin;
char ganbu;
char pro;
int pap;
}stu[101];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d%d %c %c%d",stu[i].name,&stu[i].qimo,&stu[i].banpin,&stu[i].ganbu,&stu[i].pro,&stu[i].pap);
for(i=0;i<n;i++)
{
if(stu[i].qimo>80&&stu[i].pap>=1)
a[i]=a[i]+8000;
if(stu[i].qimo>85&&stu[i].banpin>80)
a[i]=a[i]+4000;
if(stu[i].qimo>90)
a[i]=a[i]+2000;
if(stu[i].qimo>85&&stu[i].pro=='Y')
a[i]=a[i]+1000;
if(stu[i].banpin>80&&stu[i].ganbu=='Y')
a[i]=a[i]+850;
}
for(i=0;i<n;i++)
sum=sum+a[i];
for(i=0;i<n;i++)
for(j=0;j<n-1;j++)
if(a[j]<a[j+1])
{
p=a[j+1];
a[j+1]=a[j];
a[j]=p;
stu[100]=stu[j+1];
stu[j+1]=stu[j];
stu[j]=stu[100];
}
printf("%s\n%d\n%d\n",stu[0].name,a[0],sum);
}
| 39 |
19,310 | int main()
{
struct stu{
char name[35];
int sum;
};
struct stu m[102],temp;
int i,j,k,n;
char a,b;
scanf("%d",&n);
struct stu *p=m;
struct stu *q;
for(;p<m+n;p++)
{
scanf("%s%d%d %c %c%d",(*p).name,&i,&j,&a,&b,&k);
(*p).sum=0;
if(i>80 && k>0)
(*p).sum+=8000;
if(i>85 && j>80)
(*p).sum+=4000;
if(i>90)
(*p).sum+=2000;
if(i>85 && b=='Y')
(*p).sum+=1000;
if(a=='Y' && j>80)
(*p).sum+=850;
}
p=m;
i=0;
i=(*p).sum;
for(q=p+1;q<m+n;q++)
{
i+=(*q).sum;
if((*p).sum < (*q).sum)
{
temp=*p;
*p=*q;
*q=temp;
}
}
printf("%s\n%d\n%d\n",m->name,m->sum,i);
return 0;
} | 39 |
19,311 | 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 |
19,312 | 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 |
19,313 |
struct xinxi
{
char ming[22];
int qimo;
int pingyi;
char guan;
char xibu;
int lunwen;
int award;
struct xinxi *next;
};
void main()
{
struct xinxi *head,*pt,*p,*x;
int i,n,t;
int awardmax,awardsum;
scanf("%d",&n);
p=(struct xinxi *)malloc(sizeof(struct xinxi));
scanf("%s %d %d %c %c %d\n",p->ming,&p->qimo,&p->pingyi,&p->guan,&p->xibu,&p->lunwen);
pt=p;
head=NULL;
t=1;
while(t<n)
{
if(t==1)head=p;
if(t>1)pt->next=p;
pt=p;
p=(struct xinxi *)malloc(sizeof(struct xinxi));
t=t+1;
scanf("%s %d %d %c %c %d",p->ming,&p->qimo,&p->pingyi,&p->guan,&p->xibu,&p->lunwen);
}
pt->next=p;
p->next=NULL;
x=head;
while(x!=NULL)
{
x->award=0;
if(x->qimo>80&&x->lunwen!=0)x->award=x->award+8000;
if(x->qimo>85&&x->pingyi>80)x->award=x->award+4000;
if(x->qimo>90)x->award=x->award+2000;
if(x->qimo>85&&x->xibu=='Y')x->award=x->award+1000;
if(x->pingyi>80&&x->guan=='Y')x->award=x->award+850;
x=x->next;
}
awardsum=0;
awardmax=0;
x=head;
while(x!=NULL)
{
awardsum=x->award+awardsum;
if(x->award>awardmax)awardmax=x->award;
x=x->next;
}
for(x=head;x->award!=awardmax;x=x->next);
printf("%s\n",x->ming);
printf("%d\n",x->award);
printf("%d",awardsum);
}
| 39 |
19,314 | void main()
{
struct stu
{
char name[21];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
int zongjiangjin;
}stu[100];
struct stu temp;
int n,i,j;
int sum;
int total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].banji,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
sum=0;
if(stu[i].qimo>80&&stu[i].lunwen>=1)
sum=sum+8000;
if(stu[i].qimo>85&&stu[i].banji>80)
sum=sum+4000;
if(stu[i].qimo>90)
sum=sum+2000;
if(stu[i].qimo>85&&stu[i].xibu=='Y')
sum=sum+1000;
if(stu[i].banji>80&&stu[i].ganbu=='Y')
sum=sum+850;
stu[i].zongjiangjin=sum;
total=total+sum;
}
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
if(stu[i].zongjiangjin<stu[i+1].zongjiangjin)
{
temp=stu[i];
stu[i]=stu[i+1];
stu[i+1]=temp;
}
printf("%s\n",stu[0].name);
printf("%d\n",stu[0].zongjiangjin);
printf("%d\n",total);
} | 39 |
19,315 | 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 |
19,316 | struct s
{
char name[20],ganbu,xibu;
int qimo,pingyi,lunwen,sum;
};
int main()
{
int n,i,max=0,tot=0;
char c;
struct s a[101],b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i].name);
c=getchar();
scanf("%d%d %c %c%d",&a[i].qimo,&a[i].pingyi,&a[i].ganbu,&a[i].xibu,&a[i].lunwen);
a[i].sum=0;
if(a[i].qimo>80&&a[i].lunwen>=1)
a[i].sum+=8000;
if(a[i].qimo>85&&a[i].pingyi>80)
a[i].sum+=4000;
if(a[i].qimo>90)
a[i].sum+=2000;
if(a[i].qimo>85&&a[i].xibu=='Y')
a[i].sum+=1000;
if(a[i].pingyi>80&&a[i].ganbu=='Y')
a[i].sum+=850;
tot+=a[i].sum;
if(a[i].sum>max)
{
max=a[i].sum;
b=a[i];
}
}
printf("%s\n%d\n%d",b.name,max,tot);
return 0;
} | 39 |
19,317 | int main()
{
int g[101],c[101],e[101],i,m,n,mon[101],max=0,sum=0,j;
char name[101][20],west[101],leader[101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;;j++)
{scanf("%c",&name[i][j]);
if(name[i][j]==' ') break;}
scanf(" %d%d",&g[i],&c[i]);
scanf(" %c %c ",&leader[i],&west[i]);
scanf("%d\n",&e[i]);
mon[i]=0;
if(g[i]>80 && e[i]>=1) mon[i]=mon[i]+8000;
if(g[i]>85 && c[i]>80) mon[i]=mon[i]+4000;
if(g[i]>90) mon[i]=mon[i]+2000;
if(g[i]>85 && west[i]=='Y') mon[i]=mon[i]+1000;
if(c[i]>80 && leader[i]=='Y') mon[i]=mon[i]+850;
}
for(i=0;i<n;i++)
{
if(mon[i]>max) {max=mon[i];m=i;}
sum=sum+mon[i];
}
for(j=0;;j++)
{ if(name[m][j]!=' ')
printf("%c",name[m][j]);
else {printf("\n");break;}
}
printf("%d\n%d",mon[m],sum);
return 0;
}
| 39 |
19,318 | 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 |
19,319 |
struct SCL
{
char stu[20];
int avg;
int rev;
char ldr;
char wst;
int ppr;
int sum;
}SCL[100];
int main()
{
int n, max=0, sum=0;
char *name;
struct SCL *p;
scanf("%d", &n);
for(p=SCL; p<SCL+n; p++)
{
scanf("%s %d %d %c %c %d", p->stu, &p->avg, &p->rev, &p->ldr, &p->wst, &p->ppr);
p->sum=0;
if(p->avg>80 && p->ppr>0)
p->sum+=8000;
if(p->avg>85 && p->rev>80)
p->sum+=4000;
if(p->avg>90)
p->sum+=2000;
if(p->avg>85 && p->wst=='Y')
p->sum+=1000;
if(p->rev>80 && p->ldr=='Y')
p->sum+=850;
}
for(p=SCL; p<SCL+n; p++)
{
if(p->sum>max)
{
max=p->sum;
name=p->stu;
}
sum+=p->sum;
}
printf("%s\n%d\n%d\n", name, max, sum);
return 0;
} | 39 |
19,320 | void main()
{
struct stu
{char nam[20];
int sco1;
int sco2;
char a[2];
char b[2];
int num;
}stu[101];
int n,max,i;
int s;
int sum[101];
char maxn[30];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s",stu[i].nam);
scanf("%d",&stu[i].sco1);
scanf("%d",&stu[i].sco2);
scanf("%s",stu[i].a);
scanf("%s",stu[i].b);
scanf("%d",&stu[i].num);
sum[i]=0;
if(stu[i].sco1>80&&stu[i].num>=1)
sum[i]=sum[i]+8000;
if(stu[i].sco1>85&&stu[i].sco2>80)
sum[i]=sum[i]+4000;
if(stu[i].sco1>90)
sum[i]=sum[i]+2000;
if(stu[i].sco1>85&&stu[i].b[0]=='Y')
sum[i]=sum[i]+1000;
if(stu[i].sco2>80&&stu[i].a[0]=='Y')
sum[i]=sum[i]+850;
}
max=sum[0];
strcpy(maxn,stu[0].nam);
s=sum[0];
for(i=1;i<n;i++)
{if(sum[i]>max)
{max=sum[i];
strcpy(maxn,stu[i].nam);}
s=s+sum[i];
}
printf("%s\n",maxn);
printf("%d\n",max);
printf("%d\n",s);
} | 39 |
19,321 | struct stu{
char name[20];
int qc;
int bc;
char gb;
char xb;
int lw;
int m;
};
int main(){
struct stu s[100];
int n,i,k=0,u=0;
scanf("%d",&n);
for(i=0;i<n;i++){
s[i].m=0;
scanf("%s%d%d %c %c %d",s[i].name,&s[i].qc,&s[i].bc,&s[i].gb,&s[i].xb,&s[i].lw);
if(s[i].qc>80&&s[i].lw>=1) s[i].m=s[i].m+8000;
if(s[i].qc>85&&s[i].bc>80) s[i].m=s[i].m+4000;
if(s[i].qc>90) s[i].m=s[i].m+2000;
if(s[i].qc>85&&s[i].xb=='Y') s[i].m=s[i].m+1000;
if(s[i].bc>80&&s[i].gb=='Y') s[i].m=s[i].m+850;
u=s[i].m+u;
if(s[i].m>s[k].m) k=i;
}
printf("%s\n%d\n%d",s[k].name,s[k].m,u);
return 0;
} | 39 |
19,322 |
int main ()
{
int n,sum=0,max,i;
struct stus {
char as[21],e,f;
int a,b,c,mon;
}stus[100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stus[i].as,&stus[i].a,&stus[i].b,&stus[i].e,&stus[i].f,&stus[i].c);
}
for(i=0;i<n;i++)
{
stus[i].mon=0;
}
for(i=0;i<n;i++)
{
if(stus[i].a>80 && stus[i].c>=1)
{
stus[i].mon+=8000;
}
if(stus[i].a>85 && stus[i].b>80)
{
stus[i].mon+=4000;
}
if(stus[i].a>90)
{
stus[i].mon+=2000;
}
if(stus[i].a>85 && stus[i].f=='Y')
{
stus[i].mon+=1000;
}
if(stus[i].b>80 && stus[i].e=='Y')
{
stus[i].mon+=850;
}
}
max=0;
for(i=0;i<n;i++)
{
if(max<stus[i].mon)
{
max=stus[i].mon;
}
sum+=stus[i].mon;
}
for(i=0;i<n;i++)
{
if(max==stus[i].mon)
{
printf("%s\n",stus[i].as);
printf("%d\n",max);
printf("%d\n",sum);
break;
}
}
return 0;
} | 39 |
19,323 | int main()
{
struct student
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
};
int i,n,count[100]={0};
scanf("%d",&n);
struct student *pp;
pp=(struct student *)malloc(sizeof(student)*n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",(pp+i)->name,&((pp+i)->qimo),&((pp+i)->banji),&((pp+i)->ganbu),&((pp+i)->xibu),&((pp+i)->lunwen));
}
for(i=0;i<n;i++)
{
if((pp[i].qimo>80)&&(pp[i].lunwen>=1))count[i]+=8000;
if((pp[i].qimo>85)&&(pp[i].banji>80))count[i]+=4000;
if(pp[i].qimo>90)count[i]+=2000;
if((pp[i].qimo>85)&&(pp[i].xibu=='Y'))count[i]+=1000;
if((pp[i].banji>80)&&(pp[i].ganbu=='Y'))count[i]+=850;
}
int max=count[0];
int p=0;
int sum=0;
for(i=0;i<n;i++)
{
sum+=count[i];
if(max<count[i])
{
max=count[i];
p=i;
}
}
printf("%s\n%d\n%d\n",(pp+p)->name,max,sum);
return 0;
}
| 39 |
19,324 | void main()
{
struct
{
char name[20];
int f;
int ping;
char gan;
char xi;
int lun;
int jiang;
}stu[100];
{
int n,i,t,s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&stu[i].f,&stu[i].ping,&stu[i].gan,&stu[i].xi,&stu[i].lun);
stu[i].jiang=0;
if(stu[i].f>80&&stu[i].lun>0)
stu[i].jiang=stu[i].jiang+8000;
if(stu[i].f>85&&stu[i].ping>80)
stu[i].jiang=stu[i].jiang+4000;
if(stu[i].f>90)
stu[i].jiang=stu[i].jiang+2000;
if(stu[i].f>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++)
{
s=s+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\n",stu[i].name,t,s+stu[n-1].jiang);
break;
}
}
} | 39 |
19,325 | 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 |
19,326 |
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 |
19,327 |
struct node
{
char name[20];
int fin;
int bj;
char gb;
char west;
int essay;
}stu[100];
void main(){
int n,sum=0,max=0;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].fin,&stu[i].bj,&stu[i].gb,&stu[i].west,&stu[i].essay);
}
int a[100];
for(i=0;i<n;i++)
{
a[i]=0;
if((stu[i].fin>80)&&(stu[i].essay>=1)) a[i]=a[i]+8000;
if((stu[i].fin>85)&&(stu[i].bj>80)) a[i]=a[i]+4000;
if(stu[i].fin>90) a[i]=a[i]+2000;
if((stu[i].fin>85)&&(stu[i].west=='Y')) a[i]=a[i]+1000;
if((stu[i].gb=='Y')&&(stu[i].bj>80)) a[i]=a[i]+850;
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
for(i=0;i<n;i++)
{
if(a[i]>max) max=a[i];
}
for(i=0;i<n;i++)
{
if(a[i]==max)
{
printf("%s\n%d\n",stu[i].name,a[i]);
break;
}
}
printf("%d",sum);
}
| 39 |
19,328 | struct student
{char name[30];
int score1;
int score2;
char ganbu[1];
char xibu[1];
int lunwen;
int s;
}stu[100];
main()
{
int N,i,max=0,j,sum=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s%d%d%s%s%d",stu[i].name,&stu[i].score1,&stu[i].score2,stu[i].ganbu,stu[i].xibu,&stu[i].lunwen);
}
for(i=0;i<N;i++)
{
stu[i].s=0;
}
for(i=0;i<N;i++)
{
if(stu[i].score1>80&&stu[i].lunwen>0)
stu[i].s=stu[i].s+8000;
if(stu[i].score1>85&&stu[i].score2>80)
stu[i].s=stu[i].s+4000;
if(stu[i].score1>90)
stu[i].s=stu[i].s+2000;
if(stu[i].score1>85&&stu[i].xibu[0]=='Y')
stu[i].s=stu[i].s+1000;
if(stu[i].score2>80&&stu[i].ganbu[0]=='Y')
stu[i].s=stu[i].s+850;
}
for(i=0;i<N;i++)
{
if(stu[i].s>max)
{
max=stu[i].s;
j=i;
}
sum=sum+stu[i].s;
}
printf("%s\n",stu[j].name);
printf("%d\n",max);
printf("%d\n",sum);
}
| 39 |
19,329 | struct student
{
char name[20];
int final;
int classgrade;
char leader;
char west;
int essay;
int total;
};
int main()
{
struct student stu[100];
struct student m;
int n,i,a,b,c,d,e,TOTAL;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].final,&stu[i].classgrade,&stu[i].leader,&stu[i].west,&stu[i].essay);
}
TOTAL=0;
for(i=0;i<n;i++){
a=0;b=0;c=0;d=0;e=0;
if(stu[i].final>80&&stu[i].essay>=1)
a=8000;
if(stu[i].final>85&&stu[i].classgrade>80)
b=4000;
if(stu[i].final>90)
c=2000;
if(stu[i].final>85&&stu[i].west=='Y')
d=1000;
if(stu[i].classgrade>80&&stu[i].leader=='Y')
e=850;
stu[i].total=a+b+c+d+e;
TOTAL=TOTAL+stu[i].total;
}
for(i=n-1;i>=0;i--){
if(stu[i-1].total<stu[i].total)
{
m=stu[i-1];
stu[i-1]=stu[i];
stu[i]=m;
}
}
printf("%s\n%d\n%d",stu[0].name,stu[0].total,TOTAL);
return 0;
} | 39 |
19,330 |
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 |
19,331 | 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 |
19,332 | void main()
{
int n,i,j,k,m=0;
struct student
{
char name[20];
int qm;
int bj;
char xg;
char xb;
int lw;
int jj;
};
struct student stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qm,&stu[i].bj,&stu[i].xg,&stu[i].xb,&stu[i].lw);
}
for(i=0;i<n;i++)
{ stu[i].jj=0;
if(stu[i].qm>80&&stu[i].lw>0)
stu[i].jj=stu[i].jj+8000;
if(stu[i].qm>85&&stu[i].bj>80)
stu[i].jj=stu[i].jj+4000;
if(stu[i].qm>90)
stu[i].jj=stu[i].jj+2000;
if(stu[i].qm>85&&stu[i].xb=='Y')
stu[i].jj=stu[i].jj+1000;
if(stu[i].bj>80&&stu[i].xg=='Y')
stu[i].jj=stu[i].jj+850;
}
for(i=0;i<n;i++)
{ k=0;
for(j=0;j<n;j++)
{
if(stu[i].jj<stu[j].jj)
break;
else
k++;
}
if(k==n)
{printf("%s\n%d\n",stu[i].name,stu[i].jj);
break;}
}
for(i=0;i<n;i++)
m=m+stu[i].jj;
printf("%d\n",m);
}
| 39 |
19,333 |
void main()
{
struct student{
char name[21];
int fin;
int cls;
char off;
char wst;
int pap;
}s[100];
int n,i,m[100]={0},sum=0,max,maxi;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d",s[i].name,&s[i].fin,&s[i].cls,&s[i].off,&s[i].wst,&s[i].pap);
for(i=0;i<n;i++){
if(s[i].fin>80&&s[i].pap>=1)
m[i]+=8000;
if(s[i].fin>85&&s[i].cls>80)
m[i]+=4000;
if(s[i].fin>90)
m[i]+=2000;
if(s[i].fin>85&&s[i].wst=='Y')
m[i]+=1000;
if(s[i].cls>80&&s[i].off=='Y')
m[i]+=850;
sum+=m[i];
if(i==0){
max=m[i];
maxi=i;
}
else if(m[i]>max){
max=m[i];
maxi=i;
}
}
printf("%s\n%d\n%d\n",s[maxi].name,m[maxi],sum);
} | 39 |
19,334 |
struct student{
char name[25];
int q,b,l,money;
char w,x;
};
int main()
{
struct student a[100];
int n,i;
int sum=0,max=0,max_i=0,m[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",a[i].name,&a[i].q,&a[i].b,&a[i].w,&a[i].x,&a[i].l);
if((a[i].q>80)&&(a[i].l>=1))
{m[i]+=8000;}
if((a[i].b>80)&&(a[i].q>85))
{m[i]+=4000;}
if(a[i].q>90)
{m[i]+=2000;}
if((a[i].q>85)&&(a[i].x=='Y'))
{m[i]+=1000;}
if((a[i].b>80)&&(a[i].w=='Y'))
{m[i]+=850;}
a[i].money=m[i];
}
m[0]=max=a[0].money;
max_i=0;
for(i=0;i<n;i++)
{
sum+=m[i];
if(a[i].money>max)
{
max=a[i].money;
max_i=i;
}
}
printf("%s\n",a[max_i].name);
printf("%d\n",m[max_i]);
printf("%d\n",sum);
return 0;
} | 39 |
19,335 | 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 |
19,336 | int main()
{
int n,i,e=0;
struct student
{char name[20];
int scorea;
int scoreb;
char a;
char f;
int b;
int c;
}d[100],s;
s.c=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s%d%d %c %c %d",d[i].name,&d[i].scorea,&d[i].scoreb,&d[i].a,&d[i].f,&d[i].b);
d[i].c=0;
if(d[i].scorea>80&&d[i].b>0)
d[i].c=d[i].c+8000;
if(d[i].scorea>85&&d[i].scoreb>80)
d[i].c=d[i].c+4000;
if(d[i].scorea>90)
d[i].c=d[i].c+2000;
if(d[i].scorea>85&&d[i].f=='Y')
d[i].c=d[i].c+1000;
if(d[i].scoreb>80&&d[i].a=='Y')
d[i].c=d[i].c+850;
e=e+d[i].c;
}
for(i=0;i<n;i++)
{if(d[i].c>s.c)
s=d[i];}
printf("%s\n%d\n%d",s.name,s.c,e);
return 0;
} | 39 |
19,337 | 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 |
19,338 | void main(){
int m,i,k;
float sumz=0,max;
struct student
{char a[20];
int b;
int c;
char d;
char e;
int f;
float sum;
};
struct student num[100];
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%s%d%d %c %c%d",num[i].a,&num[i].b,&num[i].c,
&num[i].d,&num[i].e,&num[i].f);
num[i].sum=0;
}
for(i=0;i<m;i++){
if((num[i].b>80)&&(num[i].f>=1))num[i].sum=num[i].sum+8000;
if((num[i].b>85)&&(num[i].c>80))num[i].sum=num[i].sum+4000;
if((num[i].b>90))num[i].sum=num[i].sum+2000;
if((num[i].b>85)&&(num[i].e=='Y'))num[i].sum=num[i].sum+1000;
if((num[i].c>80)&&(num[i].d=='Y'))num[i].sum=num[i].sum+850;
}
max=num[m-1].sum;k=m-1;
for(i=m-1;i>=0;i--)
if(num[i].sum>=max){
max=num[i].sum;
k=i;
}
for(i=0;i<m;i++)sumz=sumz+num[i].sum;
printf("%s\n%.0f\n%.0f\n",num[k].a,num[k].sum,sumz);
}
| 39 |
19,339 |
int main()
{
int n,i,s,total=0;
struct
{char name[21];
int ave;
int mar;
int es;
char a;
char b;
int sum;
}stu[100];
scanf("%d", &n);
for(i=0;i<n;i++)
scanf("%s %d %d %c %c %d", stu[i].name, &stu[i].ave, &stu[i].mar, &stu[i].a, &stu[i].b, &stu[i].es);
for(i=0;i<n;i++)
{
stu[i].sum=0;
if(stu[i].ave>80&&stu[i].es>0) stu[i].sum+=8000;
if(stu[i].ave>85&&stu[i].mar>80) stu[i].sum+=4000;
if(stu[i].ave>90) stu[i].sum+=2000;
if(stu[i].ave>85&&stu[i].b=='Y') stu[i].sum+=1000;
if(stu[i].mar>80&&stu[i].a=='Y') stu[i].sum+=850;
total+=stu[i].sum;
}
s=stu[0].sum;
for(i=1;i<n;i++)
{
if(stu[i].sum>s) s=stu[i].sum;
}
for(i=0;i<n;i++)
{
if(stu[i].sum==s)
{
printf("%s\n%d\n", stu[i].name, stu[i].sum);
break;}
}
printf("%d", total);
return 0;
}
| 39 |
19,340 | void main()
{
struct student
{
char name[100],g,w;
int s1,s2,p;
long sum;
} stu[100],max;
int n,i,k;
long ssum=0;
scanf("%d\n",&n);
max.sum=0;
for (i=0;i<n;i++)
{
stu[i].sum=0;
/*1) ????????8000??????????80??>80???????????1??1?????????????
2) ????????4000??????????85??>85????????????80??>80?????????
3) ????????2000??????????90??>90?????????
4) ????????1000??????????85??>85?????????????
5) ????????850??????????80??>80???????????
???????????????????????????????????????????
*/
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].g,&stu[i].w,&stu[i].p);
if(stu[i].s1>80&&stu[i].p>0) stu[i].sum+=8000;
if(stu[i].s1>85&&stu[i].s2>80) stu[i].sum+=4000;
if(stu[i].s1>90) stu[i].sum+=2000;
if(stu[i].s1>85&&stu[i].w=='Y') stu[i].sum+=1000;
if(stu[i].s2>80&&stu[i].g=='Y') stu[i].sum+=850;
}
ssum=0;
for (i=0;i<n;i++) { if (stu[i].sum>max.sum) {max.sum=stu[i].sum;strcpy(max.name,stu[i].name);}ssum+=stu[i].sum;}
printf("%s\n%ld\n%d",max.name,max.sum,ssum);
} | 39 |
19,341 | struct student
{
char name[30];
int money;
}stu[999];
void main()
{
int n,i,sum=0,max=0;
int grade_1,grade_2,paper;
char a,b;
char *winner;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",&stu[i].name,&grade_1,&grade_2,&a,&b,&paper);
stu[i].money=0;
if(grade_1>80&&paper>0)
stu[i].money+=8000;
if(grade_1>85&&grade_2>80)
stu[i].money+=4000;
if(grade_1>90)
stu[i].money+=2000;
if(grade_1>85&&b=='Y')
stu[i].money+=1000;
if(grade_2>80&&a=='Y')
stu[i].money+=850;
}
for(i=0;i<n;i++)
{
sum+=stu[i].money;
if(max<stu[i].money)
{
max=stu[i].money;
winner=stu[i].name;
}
}
printf("%s\n%d\n%d",winner,max,sum);
}
| 39 |
19,342 |
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 |
19,343 |
struct student{
char name[20];
int pjcj,pycj;
char ganbu,xibu;
int article;
};
void main()
{
struct student *p;
int n,i;
int sum=0,max=0,maxnum,single=0;
scanf("%d",&n);
p= (struct student *)malloc( n*sizeof(struct student) );
for(i=0 ; i<n ; i++,single=0 ){
scanf("%s", &p[i].name);
scanf("%d%d", &p[i].pjcj, &p[i].pycj);
scanf(" %c %c", &p[i].ganbu, &p[i].xibu);
scanf("%d", &p[i].article);
if( p[i].pjcj>80 && p[i].article )
single+=8000;
if( p[i].pjcj>85 && p[i].pycj>80 )
single+=4000;
if( p[i].pjcj>90 )
single+=2000;
if( p[i].pjcj>85 && p[i].xibu=='Y')
single+=1000;
if( p[i].pycj>80 && p[i].ganbu=='Y')
single+=850;
if( single>max ){
max=single;
maxnum=i;
}
sum+=single;
}
printf("%s\n",p[maxnum].name);
printf("%d\n",max);
printf("%d\n",sum);
}
| 39 |
19,344 | void main()
{
/*1) ????????8000??????????80??>80???????????1??1?????????????
2) ????????4000??????????85??>85????????????80??>80?????????
3) ????????2000??????????90??>90?????????
4) ????????1000??????????85??>85?????????????
5) ????????850??????????80??>80???????????
???????????????????????????????????????????????????*/
char name[1000][100];
int fen[1000];
int ban[1000];
char gan[1000];
char xi[1000];
int lun[1000];
int jiang[1000];
int n,i,max,xue,sum;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d %d %c %c %d",name[i],&fen[i],&ban[i],&gan[i],&xi[i],&lun[i]);
jiang[i]=0;
if(fen[i]>80&&lun[i]>=1) jiang[i]=8000;
if(fen[i]>85&&ban[i]>80) jiang[i]=jiang[i]+4000;
if(fen[i]>90) jiang[i]=jiang[i]+2000;
if(fen[i]>85&&xi[i]=='Y') jiang[i]=jiang[i]+1000;
if(ban[i]>80&&gan[i]=='Y') jiang[i]=jiang[i]+850;
}
max=jiang[0];
xue=0;
for(i=0;i<n;i++)
{
if(jiang[i]>max)
{
max=jiang[i];
xue=i;
}
}
sum=0;
for(i=0;i<n;i++)
{
sum=sum+jiang[i];
}
printf("%s\n",name[xue]);
printf("%d\n",jiang[xue]);
printf("%d\n",sum);
}
| 39 |
19,345 | struct stu
{
char name[25];
int score1;
int score2;
char a;
char b;
int num;
int sum;
};
void main()
{
int i,n,t=0,pos,max;
struct stu *p1;
scanf("%d",&n);
p1=(struct stu*)calloc(n,sizeof(struct stu));
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",p1[i].name,&(p1[i].score1),&(p1[i].score2),&(p1[i].a),&(p1[i].b),&(p1[i].num));
if(p1[i].score1>80&&p1[i].num>=1)
{
p1[i].sum+=8000;
t+=8000;
}
if(p1[i].score1>85&&p1[i].score2>80)
{
p1[i].sum+=4000;
t+=4000;
}
if(p1[i].score1>90)
{
p1[i].sum+=2000;
t+=2000;
}
if(p1[i].score1>85&&p1[i].b=='Y')
{
p1[i].sum+=1000;
t+=1000;
}
if(p1[i].score2>80&&p1[i].a=='Y')
{
p1[i].sum+=850;
t+=850;
}
}
max=p1[0].sum;
for(i=1;i<n;i++)
if(p1[i].sum>max)
{
pos=i;
max=p1[i].sum;
}
printf("%s\n%d\n%d",p1[pos].name,p1[pos].sum,t);
}
| 39 |
19,346 |
struct profile
{
char name[20];
int grade; int approval;
char west; char manager;
int paper; int prize;
};
int prizetoget(int gra,int app,char w,char ma,int pa)
{
int initial=0;
if((pa>=1)&&(gra>80)) initial+=Principal;
if((gra>85)&&(app>80)) initial+=Wusi;
if(gra>90) initial+=Highmark;
if((gra>85)&&(w=='Y')) initial+=Western;
if((app>80)&&(ma=='Y')) initial+=Devotion;
return initial;
}
int main()
{
struct profile student[100];
int n,i,most=0,No,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",student[i].name,&student[i].grade,&student[i].approval,&student[i].manager,&student[i].west,&student[i].paper);
student[i].prize=prizetoget(student[i].grade,student[i].approval,student[i].west,student[i].manager,student[i].paper);
sum+=student[i].prize;
}
for(i=0;i<n;i++){
if(student[i].prize>most)
{
most=student[i].prize;
No=i;
}
}
printf("%s\n%d\n%d",student[No].name,most,sum);
return 0;
}
| 39 |
19,347 |
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 |
19,348 |
int money[100];
int main()
{
int n,a[100],b[100],c[100],i,j,k,z=0;
char name[100][30],ganbu[100],xibu[100],t[30];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d%s%s%d",name[i], &a[i],&b[i],&ganbu[i],&xibu[i],&c[i]);
if(a[i]>80&&c[i]!=0)
money[i]=money[i]+8000;
if(a[i]>85&&b[i]>80)
money[i]=money[i]+4000;
if(a[i]>90)
money[i]=money[i]+2000;
if(a[i]>85&&xibu[i]=='Y')
money[i]=money[i]+1000;
if(b[i]>80&&ganbu[i]=='Y')
money[i]=money[i]+850;
}
for(j=0;j<n;j++)
z=z+money[j];
for(j=n-1;j>0;j--)
{
if(money[j]>money[j-1])
{
k=money[j];
money[j]=money[j-1];
money[j-1]=k;
strcpy(t,name[j]);
strcpy(name[j],name[j-1]);
strcpy(name[j-1],t);
}
}
printf("%s\n%d\n%d\n",name[0],money[0],z);
return 0;
} | 39 |
19,349 |
int main(int argc, char* argv[])
{
struct stu{
char name[20];
int a;//qi mo
int b;//ban ji
char c;//ban gan
char d;//xi bu
int e;//lun wen
}str[101];
int n;
scanf("%d",&n);
int a[101];//qian shu
for(int k=1;k<=n;k++){
a[k]=0;}
int sum=0;//zong qian
for(int i=1;i<=n;i++){
scanf("%s %d %d %c %c %d",&str[i].name,&str[i].a,&str[i].b,&str[i].c,&str[i].d,&str[i].e);}
for(int j=1;j<=n;j++){
if(str[j].a>80&&str[j].e>=1){
a[j]+=8000;}
if(str[j].a>85&&str[j].b>80){
a[j]+=4000;}
if(str[j].a>90){
a[j]+=2000;}
if(str[j].a>85&&str[j].d=='Y'){
a[j]+=1000;}
if(str[j].b>80&&str[j].c=='Y'){
a[j]+=850;}
sum+=a[j];}
int w=a[1],q=1;
for(int t=2;t<=n;t++){
if(a[t]>w){
w=a[t];
q=t;}
}
printf("%s\n",str[q].name);
printf("%d\n",a[q]);
printf("%d\n",sum);
return 0;
}
| 39 |
19,350 | void main()
{
struct student
{
char name[1000];
int s1,s2,gb,west,paper,sum;
struct student *next;
} *p,*head;
int n,i,k,l,max=0;
long ssum=0;
l=sizeof(struct student);
head=(struct student*)malloc(l);
p=head;
p->next=NULL;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",p->name,&p->s1,&p->s2,&p->gb,&p->west,&p->paper);
p->west-='N';p->gb-='N';
if (n-i-1) {p->next=malloc(l);p=p->next;p->next=NULL;}
}
p=head;
do
{
p->sum=0;
if (p->s1>80&&p->paper) p->sum+=8000;
if (p->s1>85&&p->s2>80) p->sum+=4000;
if (p->s1>90) p->sum+=2000;
if (p->s1>85&&p->west) p->sum+=1000;
if (p->s2>80&&p->gb) p->sum+=850;
if (p->sum>max) max=p->sum;
p=p->next;
}
while(p);
p=head;
k=1;
do
{
if (p->sum==max&&k) {printf("%s\n%d\n",p->name,p->sum);k=0;}
ssum+=p->sum;
p=p->next;
}
while (p);
printf("%ld",ssum);
} | 39 |
19,351 | struct stu
{char num[200];
int qimo;
int banji;
char gan;
char sheng;
int lun;
int qian;
struct stu * next;
};
void sort(struct stu * head,struct stu * q)
{
struct stu *pre=head,*p=pre->next,*s;
s=(struct stu *)malloc(sizeof(struct stu));
s->banji=q->banji;strcpy(s->num,q->num);s->qimo=q->qimo;s->qian=q->qian;s->sheng=q->sheng;s->gan=q->gan;
s->next=NULL;
while((p!=NULL)&&(s->qian<=p->qian))
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
void main()
{
int n,k,i,all,tol=0;
float m;
char num[20];
struct stu *head;
struct stu *p,*q;
head=(struct stu *)malloc(sizeof(struct stu));
head->next=NULL;
scanf("%d",&n);
for (i=1;i<=n;i++)
{ all=0;
p=(struct stu *)malloc(sizeof(struct stu));
scanf("%s %d %d %c %c %d",p->num,&p->qimo,&p->banji,&p->gan,&p->sheng,&p->lun);
if((p->qimo>80)&&(p->lun>0)) all=all+8000;
if((p->qimo>85)&&(p->banji>80)) all=all+4000;
if(p->qimo>90) all=all+2000;
if((p->qimo>85)&&(p->sheng=='Y')) all=all+1000;
if((p->banji>80)&&(p->gan=='Y')) all=all+850;
p->qian=all;
tol=tol+all;
sort(head,p);
}
p=head->next;
printf("%s\n",p->num);
printf("%d\n",p->qian);
printf("%d\n",tol);
} | 39 |
19,352 | 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 |
19,353 |
int main()
{
char name[105][20];
int qimo[105];
int banji[105];
int lunwen[105];
char xibu[105];
char ganbu[105];
int money[105]={0};
int i,j,k,l,m,n,max=0;
scanf("%d",&n);
getchar();
for (i=1;i<=n;i++)
{
scanf("%s %d %d %c %c %d",&name[i],&qimo[i],&banji[i],&ganbu[i],&xibu[i],&lunwen[i]);
}
for (i=1;i<=n;i++)
{
if (qimo[i]>80 && lunwen[i]>=1)
{
money[i]=money[i]+8000;
}
if (qimo[i]>85 && banji[i]>80)
{
money[i]=money[i]+4000;
}
if (qimo[i]>90)
{
money[i]=money[i]+2000;
}
if (qimo[i]>85 && xibu[i]=='Y')
{
money[i]=money[i]+1000;
}
if (banji[i]>80 && ganbu[i]=='Y')
{
money[i]=money[i]+850;
}
}
for (i=1;i<=n;i++)
{
if (money[i]>max) max=money[i];
}
for (i=1;i<=n;i++)
{
if (money[i]==max)
{
printf("%s\n",name[i]);
break;
}
}
printf("%d\n",max);
m=0;
for (i=1;i<=n;i++)
{
m=m+money[i];
}
printf("%d\n",m);
return 0;
} | 39 |
19,354 | void main()
{
int n,i,qians[100],sum,t,d;
int jiangj(int a,int b,char d,char e,int c);
struct student
{
char name[20];
int qimo;
int py;
char a;
char b;
int paper;
};
struct student stu[100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].qimo,&stu[i].py,&stu[i].a,&stu[i].b,&stu[i].paper);
qians[i]=jiangj(stu[i].qimo,stu[i].py,stu[i].a,stu[i].b,stu[i].paper);
}
for(i=0,t=0,sum=0;i<n;i++)
{
sum=sum+qians[i];
if(t<qians[i])
{
d=i;
t=qians[i];
}
}
printf("%s\n%d\n%d",stu[d].name,qians[d],sum);
}
int jiangj(int a,int b,char d,char e,int c)
{
int z;
z=0;
if(a>80&&c>0)
z=z+8000;
if(a>85&&b>80)
z=z+4000;
if(a>90)
z=z+2000;
if(a>85&&e=='Y')
z=z+1000;
if(b>80&&d=='Y')
z=z+850;
return(z);
} | 39 |
19,355 | struct student
{
char name[30];
int examgrade;
int appgrade;
char a;
char b;
int thesis;
};
void main()
{
int n,i,temp,sum=0,max=0;
int money[100]={0};
struct student stu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stu[i].name);
scanf("%d%d",&stu[i].examgrade,&stu[i].appgrade);
scanf(" %c %c",&stu[i].a,&stu[i].b);
scanf("%d",&stu[i].thesis);
}
for(i=0;i<n;i++)
{
if(stu[i].examgrade>80)
{
if(stu[i].thesis>=1)
money[i]=money[i]+8000;
if(stu[i].examgrade>85)
{
if(stu[i].appgrade>80)
money[i]=money[i]+4000;
if(stu[i].examgrade>90)
money[i]=money[i]+2000;
if(stu[i].b=='Y')
money[i]=money[i]+1000;
}
}
if(stu[i].a=='Y'&&stu[i].appgrade>80)
money[i]=money[i]+850;
}
for(i=0;i<n;i++)
{
sum=sum+money[i];
if(money[i]>max)
{
max=money[i];
temp=i;
}
}
printf("%s\n",stu[temp].name);
printf("%d\n%d",max,sum);
} | 39 |
19,356 |
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 |
19,357 | struct stu
{
char id[111];
int qm;
int bj;
char ganbu[2];
char xibu[2];
int lun;
float total;
struct stu *next;
};
int n;
struct stu *creat(int h)
{
struct stu *head;
struct stu *p1,*p2;
n=0;
p1=p2=(struct stu *)malloc(L);
scanf("%s %d %d %s %s %d",p1->id,&p1->qm,&p1->bj,&p1->ganbu,&p1->xibu,&p1->lun);
head=NULL;
while(n<h-1)
{
n=n+1;
if(n==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct stu *)malloc(L);
scanf("%s %d %d %s %s %d",p1->id,&p1->qm,&p1->bj,&p1->ganbu,&p1->xibu,&p1->lun);
}
p1->next=NULL;
p2->next=p1;
return(head);
}
void main()
{
int m;
float s,all=0;
struct stu f,*p,*q,*l;
scanf("%d",&m);
p=creat(m);
l=p;
while(p)
{
p->total=0;
if(p->qm>80&&p->lun>=1) p->total=p->total+8000;
if(p->qm>85&&p->bj>80) p->total=p->total+4000;
if(p->qm>90) p->total=p->total+2000;
if(p->qm>85&&strcmp(p->xibu,"Y")==0) p->total=p->total+1000;
if(p->bj>80&&strcmp(p->ganbu,"Y")==0) p->total=p->total+850;
all=all+p->total;
p=p->next;
}
p=l;
f.total=0;
while(p)
{
if(p->total>f.total) f=*p;
p=p->next;
}
s=f.total;
p=l;
while(p)
{
if(p->total==f.total) f.total=f.total+p->total;
p=p->next;
}
printf("%s\n%.0f\n%.0f\n",f.id,s,all);
}
| 39 |
19,358 |
struct stu
{
char name[20];
int mark1;
int mark2;
char gan;
char west;
int paper;
int money;
struct stu *next;
};
void main()
{
int i,n,max=0,sum=0;
struct stu *head,*p1,*p2,*p;
scanf("%d\n",&n);
p1=(struct stu*)malloc(sizeof(struct stu));
p2=p1;
head=p1;
scanf("%s %d %d %c %c %d\n",p1->name,&p1->mark1,&p1->mark2,&p1->gan,&p1->west,&p1->paper);
p1->money=0;
for(i=1;i<n;i++)
{
p1=(struct stu*)malloc(sizeof(struct stu));
p2->next=p1;
p2=p1;
scanf("%s %d %d %c %c %d\n",p1->name,&p1->mark1,&p1->mark2,&p1->gan,&p1->west,&p1->paper);
p1->money=0;
}
p2->next=NULL;
for(p=head;p!=NULL;p=p->next)
{
if((p->mark1>80)&&(p->paper>=1)){p->money+=8000;}
if((p->mark1>85)&&(p->mark2>80)){p->money+=4000;}
if(p->mark1>90){p->money+=2000;}
if((p->mark1>85)&&(p->west=='Y')){p->money+=1000;}
if((p->mark2>80)&&(p->gan=='Y')){p->money+=850;}
}
for(p=head;p!=NULL;p=p->next)
{
sum+=p->money;
if(p->money>max)
{max=p->money;}
}
for(p=head;p!=NULL;p=p->next)
{
if(p->money==max)
{printf("%s\n%d\n%d",p->name,p->money,sum);break;}
}
} | 39 |
19,359 | struct stu
{
char name[20],ganbu,xibu;
int qimo,banji,lunwen,sum;
};
int main()
{
struct stu a[100],t;
int n,i,sum=0,j,k;
char c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i].name);
c=getchar();
scanf("%d %d %c %c %d",&a[i].qimo,&a[i].banji,&a[i].ganbu,&a[i].xibu,&a[i].lunwen);
a[i].sum=0;
if(a[i].qimo>80&&a[i].lunwen>=1)
a[i].sum+=8000;
if(a[i].qimo>85&&a[i].banji>80)
a[i].sum+=4000;
if(a[i].qimo>90)
a[i].sum+=2000;
if(a[i].qimo>85&&a[i].xibu=='Y')
a[i].sum+=1000;
if(a[i].banji>80&&a[i].ganbu=='Y')
a[i].sum+=850;
sum+=a[i].sum;
}
for(j=1;j<=n;j++)
{ for(k=0;k<n-j;k++)
{
if(a[k].sum<a[k+1].sum)
{
t=a[k];
a[k]=a[k+1];
a[k+1]=t;
}
}
}
printf("%s\n%d\n%d\n",a[0].name,a[0].sum,sum);
return 0;
}
| 39 |
19,360 |
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 |
19,361 | struct student
{
char name[20];
int ave;
int cla;
char mon;
char pro;
int essay;
int scholar;
};
struct student st[100];
struct student temp;
int main()
{
int i,N,j,sum=0;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%s %d %d %c %c %d",st[i].name,&st[i].ave,&st[i].cla,&st[i].mon,&st[i].pro,&st[i].essay);
st[i].scholar=0;
if(st[i].ave>80&&st[i].essay!=0)
st[i].scholar=st[i].scholar+8000;
if(st[i].ave>85&&st[i].cla>80)
st[i].scholar=st[i].scholar+4000;
if(st[i].ave>90)
st[i].scholar=st[i].scholar+2000;
if(st[i].ave>85&&st[i].pro=='Y')
st[i].scholar=st[i].scholar+1000;
if(st[i].cla>80&&st[i].mon=='Y')
st[i].scholar=st[i].scholar+850;
sum=sum+st[i].scholar;
}
for(j=0;j<N-1;j++)
{
if(st[j].scholar>=st[j+1].scholar)
{
temp=st[j];st[j]=st[j+1];st[j+1]=temp;
}
}
printf("%s\n%d\n%d\n",st[N-1].name,st[N-1].scholar,sum);
} | 39 |
19,362 | struct student
{
char name[21];
int chengji;
int pingyi;
char ganbu;
char xibu;
int lunwen;
int sum;
};
int main()
{
struct student stu[100],temp;
int n,i,j,r=1,final=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d%d %c %c %d",stu[i].name,&stu[i].chengji,&stu[i].pingyi,&stu[i].ganbu,&stu[i].xibu,&stu[i].lunwen);
stu[i].sum=0;
if(stu[i].chengji>80&&stu[i].lunwen>0)
stu[i].sum+=8000;
if(stu[i].chengji>85&&stu[i].pingyi>80)
stu[i].sum+=4000;
if(stu[i].chengji>90)
stu[i].sum+=2000;
if(stu[i].chengji>85&&stu[i].xibu=='Y')
stu[i].sum+=1000;
if(stu[i].pingyi>80&&stu[i].ganbu=='Y')
stu[i].sum+=850;
}
for(i=0;i<n;i++)
final=final+stu[i].sum;
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
if(stu[j].sum<stu[j+1].sum)
{
temp=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp;
}
for(i=1;i<n;i++)
{
if(stu[i].sum==stu[0].sum)
r++;
else
break;
}
printf("%s\n%d\n%d\n",stu[0].name,stu[0].sum,final);
return 0;
}
| 39 |
19,363 |
struct Student
{char name[30];
int q;
int b;
char s;
char x;
int w;
int money;
};
int main()
{
struct Student stu[100];
struct Student temp;
int n,sum=0,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d %c %c%d",&stu[i].name,&stu[i].q,&stu[i].b,&stu[i].s,&stu[i].x,&stu[i].w);
stu[i].money=0;
if(stu[i].q>80&&stu[i].w>0)
stu[i].money=stu[i].money+8000;
if(stu[i].q>85&&stu[i].b>80)
stu[i].money=stu[i].money+4000;
if(stu[i].q>90)
stu[i].money=stu[i].money+2000;
if(stu[i].q>85&&stu[i].x=='Y')
stu[i].money=stu[i].money+1000;
if(stu[i].b>80&&stu[i].s=='Y')
stu[i].money=stu[i].money+850;
}
for(i=0;i<n;i++){
sum=sum+stu[i].money;
}
for(i=0;i<n;i++){
k=i;
for(j=i+1;j<n;j++)
if(stu[j].money>stu[k].money)
k=j;
temp=stu[k];stu[k]=stu[i];stu[i]=temp;
}
printf("%s\n%d\n%d\n",stu[0].name,stu[0].money,sum);
return 0;
}
| 39 |
19,364 | 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 |
19,365 | 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 |
19,366 | 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 |
19,367 | void main()
{
int n;
scanf("%d",&n);
struct student
{
char name[32];
int sco1;
int sco2;
char l;
char w;
int es;
int scho;
};
struct student stu[n];
int i;
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d",stu[i].name,&stu[i].sco1,&stu[i].sco2,&stu[i].l,&stu[i].w,&stu[i].es);
stu[i].scho=0;
if(stu[i].sco1>80&&stu[i].es>0)stu[i].scho+=8000;
if(stu[i].sco1>85&&stu[i].sco2>80)stu[i].scho+=4000;
if(stu[i].sco1>90)stu[i].scho+=2000;
if(stu[i].sco1>85&&stu[i].w=='Y')stu[i].scho+=1000;
if(stu[i].sco2>80&&stu[i].l=='Y')stu[i].scho+=850;
}
int max=stu[0].scho;
for(i=0;i<n;i++)
if(stu[i].scho>max)max=stu[i].scho;
for(i=0;i<n;i++)
if(stu[i].scho==max)
{
printf("%s\n%d\n",stu[i].name,max);
break;
}
int sum=0;
for(i=0;i<n;i++)sum+=stu[i].scho;
printf("%d\n",sum);
} | 39 |
19,368 | int main()
{
struct student
{
char name[20];
int qim,piny,lunw;
char ganb,xib;
int sum;
};
int i,n,a;
scanf("%d",&n);
struct student *stu=(struct student *)malloc(sizeof(struct student)*n);//////
// struct studen *stu[90];
int max=0,sum=0;
for(i=0;i<n;i++)
{
stu[i].sum=0;
scanf("%s%d%d %c %c %d",stu[i].name,&stu[i].qim,&stu[i].piny,&stu[i].ganb,&stu[i].xib,&stu[i].lunw);
if(stu[i].qim>80 && stu[i].lunw>=1)stu[i].sum+=8000;
if(stu[i].qim>85 && stu[i].piny>80)stu[i].sum+=4000;
if(stu[i].qim>90)stu[i].sum+=2000;
if(stu[i].qim>85 && stu[i].xib=='Y')stu[i].sum+=1000;
if(stu[i].piny>80 && stu[i].ganb=='Y')stu[i].sum+=850;
if(stu[i].sum>max)
{
max=stu[i].sum;
a=i;
}
sum+=stu[i].sum;
}
printf("%s\n%d\n%d\n",stu[a].name,stu[a].sum,sum);
return 0;
} | 39 |
19,369 | 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 |
19,370 | void main()
{
struct student
{char name[21];
int term,cla;
char lead,west;
int dis,sum;
}s,s1;
int n,i,money[5],total;
scanf("%d",&n);
s1.sum=-1;
total=0;
for(i=0;i<n;i++)
{ money[0]=money[1]=money[2]=money[3]=money[4]=0;
scanf("%s %d %d %c %c %d",s.name,&s.term,&s.cla,&s.lead,&s.west,&s.dis);
if(s.term>80&&s.dis>0) money[0]=8000;
if(s.term>85&&s.cla>80) money[1]=4000;
if(s.term>90) money[2]=2000;
if(s.term>85&&s.west=='Y') money[3]=1000;
if(s.cla>80&&s.lead=='Y') money[4]=850;
s.sum=money[0]+money[1]+money[2]+money[3]+money[4];
total+=s.sum;
if(s.sum>s1.sum) s1=s;
}
printf("%s\n%d\n%d\n",s1.name,s1.sum,total);
}
| 39 |
19,371 | struct Student
{
char name[20];
int marks1;
int marks2;
char a;
char b;
int paper;
int total;
}person[100],best={"\0",0,0,'\0','\0',0};
int main()
{
int n,i,total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d %c %c%d",person[i].name,&person[i].marks1,&person[i].marks2,&person[i].a,&person[i].b,&person[i].paper);
person[i].total=0;
if(person[i].marks1>80&&person[i].paper>0){person[i].total=person[i].total+8000;}
if(person[i].marks1>85&&person[i].marks2>80){person[i].total=person[i].total+4000;}
if(person[i].marks1>90){person[i].total=person[i].total+2000;}
if(person[i].marks1>85&&person[i].b=='Y'){person[i].total=person[i].total+1000;}
if(person[i].marks2>80&&person[i].a=='Y'){person[i].total=person[i].total+850;}
if(person[i].total>best.total){best=person[i];}
total=total+person[i].total;
}
printf("%s\n%d\n%d",best.name,best.total,total);
}
| 39 |
19,372 |
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 |
19,373 | int main()
{
struct jiangxuejin
{
char name[20],s1,s2;
int qimo,banji,lunwen;
}s[100];
int n,i,b,jiangjin[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d %d %c %c %d\n",&s[i].name,&s[i].qimo,&s[i].banji,&s[i].s1,&s[i].s2,&s[i].lunwen);
}
for (i=0;i<n;i++)
{
b=0;
if (s[i].qimo>80&&s[i].lunwen>=1)
{
b+=8000;
}
if (s[i].qimo>85&&s[i].banji>80)
{
b+=4000;
}
if (s[i].qimo>90)
{
b+=2000;
}
if (s[i].qimo>85&&s[i].s2=='Y')
{
b+=1000;
}
if (s[i].banji>80&&s[i].s1=='Y')
{
b+=850;
}
jiangjin[i]=b;
}
int largest=0,sum=0;
for (i=0;i<n;i++)
{
if (jiangjin[i]>=largest)
{
largest=jiangjin[i];
}
sum+=jiangjin[i];
}
for (i=0;i<n;i++)
{
if (jiangjin[i]==largest)
{
printf("%s\n",s[i].name);
printf("%d\n",largest);
printf("%d",sum);
break;
}
}
return 0;
} | 39 |
19,374 | 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 |
19,375 | void main()
{
struct student
{
char name[20];
int mark1;
int mark2;
char ganbu;
char xibu;
int lunwen;
int total;
}student[100],temp,Total;
int n,i,j;
scanf("%d",&n);
Total.total=0;
for(i=0;i<n;i++)
{
student[i].total=0;
scanf("%s %d %d %c %c %d",student[i].name,&student[i].mark1,&student[i].mark2,&student[i].ganbu,&student[i].xibu,&student[i].lunwen);
if(student[i].mark1>80&&student[i].lunwen>0)
student[i].total+=8000;
if(student[i].mark1>85&&student[i].mark2>80)
student[i].total+=4000;
if(student[i].mark1>90)
student[i].total+=2000;
if(student[i].mark1>85&&student[i].xibu=='Y')
student[i].total+=1000;
if(student[i].mark2>80&&student[i].ganbu=='Y')
student[i].total+=850;
Total.total+=student[i].total;
}
for(j=0;j<n-1;j++)
for(i=0;i<n-1-j;i++)
if(student[i].total>=student[i+1].total)
{
temp=student[i];
student[i]=student[i+1];
student[i+1]=temp;
}
printf("%s\n%d\n%d\n",student[n-1].name,student[n-1].total,Total.total);
} | 39 |
19,376 |
struct student
{
int num;
char name[20];
int qimo;
int pingyi;
char ganbu;
char west;
int paper;
};
struct jiangxuejin
{
int num;
int total;
};
int main()
{
int n,i,all=0;
struct student list[100],most;
struct jiangxuejin everyone[100],check;
scanf("%d",&n);
for(i=0;i<n;i++)
{
list[i].num=i;
scanf("%s %d %d %c %c %d",list[i].name,&list[i].qimo,&list[i].pingyi,&list[i].ganbu,&list[i].west,&list[i].paper);
}
for(i=0;i<n;i++)
{
everyone[i].num=i;
everyone[i].total=0;
if(list[i].qimo>80&&list[i].paper>=1){
everyone[i].total+=8000;
}
if(list[i].qimo>85&&list[i].pingyi>80){
everyone[i].total+=4000;
}
if(list[i].qimo>90){
everyone[i].total+=2000;
}
if(list[i].qimo>85&&list[i].west=='Y'){
everyone[i].total+=1000;
}
if(list[i].pingyi>80&&list[i].ganbu=='Y'){
everyone[i].total+=850;
}
}
most=list[0];
check=everyone[0];
for(i=1;i<n;i++)
{
if(everyone[i].total>check.total){
most=list[i];
check=everyone[i];
}
}
for(i=0;i<n;i++)
{
all+=everyone[i].total;
}
printf("%s\n%d\n%d",most.name,check.total,all);
return 0;
}
| 39 |
19,377 | int main()
{
struct money
{
char name[20];
int score1,score2;
char a[2],b[2];
int paper;
int all;
};
struct money * p;
int n,m;int * pp;
scanf("%d",&n);
p=(struct money *)malloc(n*sizeof(struct money));
pp=(int *)malloc(n*sizeof(int));
for(m=0;m<n;m++)
{
pp[m]=0;
scanf("%s",p[m].name);
scanf("%d %d",&p[m].score1,&p[m].score2);
scanf("%s %s",&p[m].a,&p[m].b);
scanf("%d",&p[m].paper);
if(p[m].score1>80&&p[m].paper>0)
pp[m]=pp[m]+8000;
if(p[m].score1>85&&p[m].score2>80)
pp[m]=pp[m]+4000;
if(p[m].score1>90)
pp[m]=pp[m]+2000;
if(p[m].b[0]=='Y'&&p[m].score1>85)
pp[m]=pp[m]+1000;
if(p[m].a[0]=='Y'&&p[m].score2>80)
pp[m]=pp[m]+850;
p[m].all=pp[m];
}
int i,j,k,q=0;
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
if(pp[j]>pp[j+1])
{
k=pp[j];
pp[j]=pp[j+1];
pp[j+1]=k;
}
for(i=0;i<n;i++)
q=q+pp[i];
for(i=0;i<n;i++)
if(p[i].all==pp[n-1])
{
printf("%s\n%d\n%d\n",p[i].name,p[i].all,q);break;
}
free(p);
free(pp);
}
| 39 |
19,378 |
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 |
19,379 | 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 |
19,380 | 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 |
19,381 | //???
//2010?11?15?
//1000012753 ???
int main()
{
int n, i, ac, cc, ri, paper, bonus[200], max, sum = 0;
char str[200][200], student, west;
cin >> n;
for (i = 1; i <= n; i++)
{
bonus[i] = 0;
cin >> str[i] >> ac >> cc >> student >> west >> paper;
if (ac > 80 && paper >= 1)
bonus[i] += 8000;
if (ac > 85 && cc > 80)
bonus[i] += 4000;
if (ac > 90)
bonus[i] += 2000;
if (west == 'Y' && ac > 85)
bonus[i] += 1000;
if (cc > 80 && student == 'Y')
bonus[i] += 850;
sum += bonus[i];
}
max = bonus[1];
for (i = 2; i <= n; i++)
{
if (max < bonus[i])
{
max = bonus[i];
ri = i;
}
}
cout << str[ri] << endl;
cout << max << endl;
cout << sum << endl;
return 0;
} | 39 |
19,382 | 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 |
19,383 | 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 |
19,384 | int main(){
int i,n;
scanf("%d",&n);
struct info{
char name[20];
int s;
};
struct info *p;
p=(struct info *)malloc(sizeof(info)*n);
char r,q;
int f1,f2,f3;
int sum=0;
int t=0;
int max=0;
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d",(p+i)->name,&f1,&f2,&r,&q,&f3);
p[i].s=0;
if(f1>80&&f3>0)p[i].s+=8000;
if(f1>85&&f2>80)p[i].s+=4000;
if(f1>90)p[i].s+=2000;
if(f1>85&&q=='Y')p[i].s+=1000;
if(f2>80&&r=='Y')p[i].s+=850;
sum+=p[i].s;
}
for(i=0;i<n;i++){
if(max<(p[i].s)){
max=p[i].s;
t=i;
}
}
printf("%s\n%d\n%d\n",p[t].name,max,sum);
return 0;
} | 39 |
19,385 | int main()
{
int n,i,max,t;
scanf("%d",&n);
char a[100][20],d[100],e[100];
int b[100],c[100],f[100],sum[100]={0},total=0;
for(i=0;i<n;i++){
scanf("%s %d %d %c %c %d\n",a[i],&b[i],&c[i],&d[i],&e[i],&f[i]);
}
for(i=0;i<n;i++){
if(b[i]>80&&f[i]>0)
sum[i]+=8000;
if(b[i]>85&&c[i]>80)
sum[i]+=4000;
if(b[i]>90)
sum[i]+=2000;
if(b[i]>85&&e[i]=='Y')
sum[i]+=1000;
if(c[i]>80&&d[i]=='Y')
sum[i]+=850;
}
for(i=0;i<n;i++)
total+=sum[i];
max=sum[0];
t=0;
for(i=0;i<n;i++){
if(max<sum[i]){
t=i;
max=sum[i];
}
}
printf("%s\n%d\n%d",a[t],max,total);
return 0;
} | 39 |
19,386 |
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 |
19,387 | 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 |
19,388 | struct student
{char name[20];
int score1;
int score2;
char a;
char b;
int num;
};
struct student stu[100];
int main()
{
int N,i,num;
int a[100]={0};
int sumall=0,summax=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].a,&stu[i].b,&stu[i].num);
for(i=0;i<N;i++)
{if(stu[i].score1>80&&stu[i].num>=1)
a[i]+=8000;
if(stu[i].score1>85&&stu[i].score2>80)
a[i]+=4000;
if(stu[i].score1>90)
a[i]+=2000;
if(stu[i].score1>85&&stu[i].b=='Y')
a[i]+=1000;
if(stu[i].score2>80&&stu[i].a=='Y')
a[i]+=850;
if(summax<a[i])
summax=a[i];
sumall+=a[i];
}
for(i=0;i<N;i++)
{if(a[i]==summax)
{num=i;
break;}
}
printf("%s\n%d\n%d\n",stu[num].name,a[num],sumall);
} | 39 |
19,389 | struct stu
{
char nam[21];
/* int sc1;
int sc2;
char mon;
char wes;
int pap;*/
int sch;
struct stu *next;
};
void main()
{
int len,n,i,sc1,sc2,pap,sum=0;
char mon,wes;
len = sizeof (struct stu);
scanf("%d",&n);
struct stu *head,*p0;
for (i=1;i<=n;i++)
{
p0 = (struct stu*)malloc(len);
if (i==1)
head = p0;
scanf("%s %d %d %c %c %d",&p0->nam,&sc1,&sc2,&mon,&wes,&pap);
p0->sch=0;
if (sc1>80 && pap>0)
p0->sch = p0->sch + 8000;
if (sc1>85 && sc2>80)
p0->sch = p0->sch + 4000;
if (sc1>90)
p0->sch = p0->sch + 2000;
if (sc1>85 && wes=='Y')
p0->sch = p0->sch + 1000;
if (sc2>80 && mon=='Y')
p0->sch = p0->sch + 850;
sum = sum + p0->sch;
if (p0->sch > head->sch)
head = p0;
}
printf("%s\n%d\n%d\n",head->nam,head->sch,sum);
}
| 39 |
19,390 | struct stu{
char str0[20];
int gr1;
int gr2;
char is1;
char is2;
int lun;
int total;};
int num(struct stu s);
int num2(struct stu s);
int num3(struct stu s);
int num4(struct stu s);
int num5(struct stu s);
void main()
{
struct stu st[100];
int n,i,max=0;
int tot=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",st[i].str0);
scanf("%d%d %c %c%d",&st[i].gr1,&st[i].gr2,&st[i].is1,&st[i].is2,&st[i].lun);
st[i].total=0;
if(num(st[i])==1)
st[i].total+=8000;
if(num2(st[i])==1)
st[i].total+=4000;
if(num3(st[i])==1)
st[i].total+=2000;
if(num4(st[i])==1)
st[i].total+=1000;
if(num5(st[i])==1)
st[i].total+=850;
}
for(i=0;i<n;i++)
{ tot+=st[i].total;
if(max<st[i].total)
max=st[i].total;
}
for(i=0;i<n;i++)
{
if(st[i].total==max)
{printf("%s\n%d\n%d",st[i].str0,max,tot);
break;
}
}
}
int num(struct stu s)
{
if(s.gr1>80&&s.lun>=1)
return 1;
else
return 0;
}
int num2(struct stu s)
{
if(s.gr1>85&&s.gr2>80)
return 1;
else
return 0;
}
int num3(struct stu s)
{
if(s.gr1>90)
return 1;
else
return 0;
}
int num4(struct stu s)
{
if(s.gr1>85&&s.is2=='Y')
return 1;
else
return 0;
}
int num5(struct stu s)
{
if(s.gr2>80&&s.is1=='Y')
return 1;
else
return 0;
}
| 39 |
19,391 | 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 |
19,392 |
struct student
{
char name[20];
int qimo;
int banji;
char ganbu;
char xibu;
int lunwen;
long int qian;
}stu[100];
void yunsuan(struct student *a)
{
int sum=0;
if(a->qimo >80&&a->lunwen >=1)
sum+=8000;
if(a->qimo >85&&a->banji >80)
sum+=4000;
if(a->qimo >90)
sum+=2000;
if(a->qimo>85 &&a->xibu =='Y')
sum+=1000;
if(a->ganbu =='Y'&&a->banji >80)
sum+=850;
a->qian =sum;
}
int max(struct student *pt,int n)
{
int max=0,i,hz;
for(i=0;i<n;i++)
{
if(pt->qian >max)
{max=pt->qian ;
hz=i;}
pt++;
}
return hz;
}
int main()
{
int n,i,m,sum=0;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %c %c %ld", stu[i].name ,&stu[i].qimo, &stu[i].banji ,&stu[i].ganbu ,&stu[i].xibu ,&stu[i].lunwen );
yunsuan(&stu[i]);
sum+=stu[i].qian ;
}
m=max(stu,n);
printf("%s\n%d\n%ld\n", stu[m].name ,stu[m].qian, sum);
return 0;
}
| 39 |
19,393 | struct student
{
char name[20];
int mark;
int re;
char work;
char west;
int paper;
int sum;
}stu[100];
void main()
{
int n,i,sum=0,max=0,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %s %s %d",&stu[i].name,&stu[i].mark,&stu[i].re,&stu[i].work,&stu[i].west,&stu[i].paper);
stu[i].sum=0;
if(stu[i].mark>80&&stu[i].paper>0)
stu[i].sum+=8000;
if(stu[i].mark>85&&stu[i].re>80)
stu[i].sum+=4000;
if(stu[i].mark>90)
stu[i].sum+=2000;
if(stu[i].mark>85&&stu[i].west=='Y')
stu[i].sum+=1000;
if(stu[i].re>80&&stu[i].work=='Y')
stu[i].sum+=850;
sum=sum+stu[i].sum;
}
for(i=0;i<n;i++)
if(max<stu[i].sum)
{
max=stu[i].sum;
l=i;
}
printf("%s\n%d\n%d\n",stu[l].name,max,sum);
}
| 39 |
19,394 | 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 |
19,395 | 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 |
19,396 | int sum=0,N;
struct student
{
char name[20];
int qimo;
int zongping;
char ganbu;
char xibu;
int lunwen;
int total;
struct student *next;
};//????????
void main()
{
struct student *head,*pmax;
struct student *p,*p1,*p2;
int n;
int max=0;
scanf("%d",&N);
/*
p1=p2=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",p1->name,&p1->qimo,&p1->zongping,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->total=0;
p1->next=NULL; //???p1->next???
head=p1;
for(n=0;n<N-1;n++)
{
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->qimo,&p1->zongping,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->total=0;
p1->next=NULL;
p2->next=p1;
}
*/
for(n=0;n<N;n++)
{
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%s %d %d %c %c %d",&p1->name,&p1->qimo,&p1->zongping,&p1->ganbu,&p1->xibu,&p1->lunwen);
p1->total=0;
p1->next=NULL;
if(n==0) head=p1;
else p2->next=p1;
}
for(max=0,p=pmax=head;p!=NULL;p=p->next)
{
if(p->qimo>80&&p->lunwen>=1) p->total=p->total+8000;
if(p->qimo>85&&p->zongping>80) p->total=p->total+4000;
if(p->qimo>90) p->total=p->total+2000;
if(p->qimo>85&&p->xibu=='Y') p->total=p->total+1000;
if(p->zongping>80&&p->ganbu=='Y') p->total=p->total+850;
sum=sum+p->total;
if(max<p->total)
{
max=p->total;
pmax=p;
}
}
// head=creat();
//pmax=cal(head);
printf("%s\n%d\n%d\n",pmax->name,pmax->total,sum);
}
| 39 |
19,397 | int main()
{
char name[100][21];
int n;//??
int temp=0;//??????????
int temp_money=0;//?????????????
int temp_name;//??????????????
int all_money=0;//??????????????
int i;
scanf("%d", &n);
// printf("n = %d\n",n);
for(i=0;i<n;i++)
{
int qi_mo;
int ping_yi;
char gan_bu;
char xi_bu;
int lun_wen;
// printf("%d\n", i);
scanf("%s", name[i]);
// printf("%s\n",name[i]);
scanf("%d", &qi_mo);
scanf("%d", &ping_yi);
scanf(" %c %c", &gan_bu, &xi_bu);
scanf("%d", &lun_wen);
if((qi_mo>80)&&(lun_wen>=1))
temp += 8000;
if((qi_mo>85)&&(ping_yi>80))
temp += 4000;
if(qi_mo>90)
temp += 2000;
if((qi_mo>85)&&(xi_bu=='Y'))
temp += 1000;
if((ping_yi>80)&&(gan_bu=='Y'))
temp += 850;
if(temp>temp_money)
{
temp_money=temp;
temp_name=i;
}
all_money += temp;
temp = 0;
}
printf("%s\n",name[temp_name]);
printf("%d\n",temp_money);
printf("%d\n",all_money);
} | 39 |
19,398 | 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 |
19,399 |
int main()
{
int n;
int i;
int total = 0;
int max_n(int amount[], int n);
int max_num;
struct data
{
char name[21];
int grade;
int assessment;
char leader;
char west;
int paper;
};
scanf("%d", &n);
struct data *input = (struct data*) malloc(sizeof(struct data) * n);
int *amount = (int*) malloc(sizeof(int) * n);
for(i = 0; i <= n - 1; i++)
{
scanf("%s %d %d %c %c %d", input[i].name, &input[i].grade, &input[i].assessment, &input[i].leader, &input[i].west, &input[i].paper);
amount[i] = 8000 * (input[i].grade > 80 && input[i].paper > 0) + 4000 * (input[i].grade > 85 && input[i].assessment > 80) + 2000 * (input[i].grade > 90) + 1000 * (input[i].grade > 85 && input[i].west == 'Y') + 850 * (input[i].assessment > 80 && input[i].leader == 'Y');
total = total + amount[i];
}
max_num = max_n(amount, n);
printf("%s\n%d\n%d", input[max_num].name, amount[max_num], total);
free(input);
free(amount);
return 0;
}
int max_n(int amount[], int n)
{
int max_num;
int max = 0;
int i;
for(i = 0; i <= n - 1; i++)
{
if(amount[i] > max)
{
max = amount[i];
max_num = i;
}
}
return max_num;
}
| 39 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.