id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
4,400 |
struct data
{
char id[11];
int age;
struct data *next;
}*p1,*p2,*head,*q1,*q2,*qhead;
void main ()
{
int i,n,k=0;
struct data * sort( struct data *head,int n);
void print(struct data *head);
scanf ("%d",&n);
head=p1=p2=(struct data *)malloc(LEN);
head->next=NULL;
for (i=0;i<n;i++)
{
p1=(struct data *)malloc(LEN);
scanf ("%s %d",p1->id,&p1->age);
if ((p1->age)>=60)
k++;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
qhead=q1=q2=(struct data *)malloc(LEN);
qhead->next=NULL;
for (i=n;i>n-k;i--)
{
head=sort(head,i);
}
q2->next=NULL;
q2->next=head->next;
free(head);
print(qhead);
}
struct data * sort(struct data *head,int n)
{
int max=59,i;
struct data *p1,*p2,*code,*pre;
p2=head;
p1=head->next;
for (i=0;i<n;i++)
{
if ((p1->age)>max)
{
max=p1->age;
code=p1;
pre=p2;
}
p1=p1->next;
p2=p2->next;
}
q1=(struct data *)malloc(LEN);
strcpy(q1->id,code->id);
q1->age=code->age;
q2->next=q1;
q2=q1;
if (pre==head)
head->next=code->next;
else
pre->next=code->next;
free(code);
return (head);
}
void print(struct data *qhead)
{
struct data *q;
q=qhead->next;
do
{
printf ("%s\n",q->id);
q=q->next;
}
while (q!=NULL);
}
| 9 |
4,401 | struct BING
{
char id[10];
int old;
}bing[100],temp;
int main()
{
int i,j,k,n,p,max;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",bing[i].id,&bing[i].old);
}
for(p=0;;p++){max=-1;
for(i=0;i<n;i++){
if(bing[i].old>max&&bing[i].old>=60){max=bing[i].old;k=i;}
}
if(max>=60) {printf("%s\n",bing[k].id);bing[k].old=-1;}
if(max<60) break;}
for(i=0;i<n;i++){
if(bing[i].old<60&&bing[i].old>=0) printf("%s\n",bing[i].id) ;
}
return 0;
}
| 9 |
4,402 | int n;
struct ceshi
{
char hao[20];
int num;
struct ceshi *next;
};
struct ceshi *charu (struct ceshi *head,struct ceshi *p1)
{
struct ceshi *p2,*p;
if (p1->num>=60)
{
if (head==Null)
{head=p1;
p1->next=Null;}
else
{
p2=head;
while ((p1->num<=p2->num)&&(p2->next!=Null))
{
p=p2;
p2=p2->next;
}
if (p1->num>=p2->num)
{
if (p2==head) {head=p1;p1->next=p2;}
else {p->next=p1;p1->next=p2;}
}
else
{
p2->next=p1;
p1->next=Null;
}
}
}
else
{
p=head;
if (head==Null)
{
head=p1;p1->next=Null;
}
else
{while(p->next!=Null)
{
p=p->next;
}
p->next=p1;
p1->next=Null;}
}
return (head);
}
struct ceshi* create()
{
struct ceshi *p1,*head,*p2;
int i=0;
head=Null;
while (i<n)
{
i++;
p1=(struct ceshi*)malloc(len);
scanf("%s %d",p1->hao,&p1->num);
head=charu(head,p1);
}
return(head);
}
void print(struct ceshi *head)
{
struct ceshi *p;
p=head;
while(p!=Null)
{printf("%s\n",p->hao);
p=p->next;}
}
void main()
{
struct ceshi *p;
scanf("%d",&n);
p=create();
print(p);
}
| 9 |
4,403 | struct pat{
char ID[10];
int age;
};
int main()
{
int n,i;
scanf("%d",&n);
struct pat * p[100];
struct pat * old[100];
struct pat * young[100],*temp;
for(i=0;i<n;i++){
p[i]=(struct pat*)malloc(len);
scanf("%s %d",p[i]->ID,&p[i]->age);
}
int k=0,j=0;
for(i=0;i<n;i++){
if(p[i]->age>=60){
old[k]=p[i];
k++;
}
else{
young[j]=p[i];
j++;
}
}
int lenold=k,lenyoung=j;
for(k=1;k<lenold;k++){
for(i=0;i<lenold-k;i++){
if(old[i]->age<old[i+1]->age){
temp=old[i];
old[i]=old[i+1];
old[i+1]=temp;
}
}
}
for(i=0;i<lenold;i++){
printf("%s\n",old[i]->ID);
}
for(i=0;i<lenyoung;i++){
printf("%s\n",young[i]->ID);
}
return 0;
} | 9 |
4,404 | int main(){
int i,j,n,h1[100],h2[100],c1=0,c2=0,t;
char d1[100][10],d2[100][10],d[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",d);
scanf("%d",&t);
if(t>=60){
h1[c1]=t;
strcpy(d1[c1],d);
c1++;
}
else{
h2[c2]=t;
strcpy(d2[c2],d);
c2++;
}
}
for(i=1;i<=c1;i++){
for(j=0;j<c1-i;j++){
if(h1[j]<h1[j+1]){
t=h1[j];
h1[j]=h1[j+1];
h1[j+1]=t;
strcpy(d,d1[j]);
strcpy(d1[j],d1[j+1]);
strcpy(d1[j+1],d);
}
}
}
for(i=0;i<c1;i++){
puts(d1[i]);
}
for(i=0;i<c2;i++){
puts(d2[i]);
}
return 0;
}
| 9 |
4,405 | int main(){
int n,i;
int age[100],a,m=0,tmp1[100],d=0;
char zfc[100][11],tmp2[100][11];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",zfc[i]);
scanf("%d",&age[i]);
}
for(i=0;i<n;i++){
if(age[i]>=60){
strcpy(tmp2[m],zfc[i]);
tmp1[m]=age[i];
m++;
}
}
for(a=m-1;a>0;a--){
for(d=0;d<a;d++){
if(tmp1[d]<tmp1[d+1]){
char s[200];
strcpy(s,tmp2[d]);
strcpy(tmp2[d],tmp2[d+1]);
strcpy(tmp2[d+1],s);
int y;
y=tmp1[d];
tmp1[d]=tmp1[d+1];
tmp1[d+1]=y;
}
}
}
for(a=0;a<m;a++){
printf("%s\n",tmp2[a]);
}
for(i=0;i<n;i++){
if(age[i]<60){
printf("%s\n",zfc[i]);
}
}
return 0;
} | 9 |
4,406 | int main()
{
int n,i,m,j,k=0,a,b,c,winnum=0,win=2,year;
char old[150][100]={0},id[100][100]={0},id0[100]={0},huiche[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",&id0,&year);
if(year>=60)
{
if(old[year][0]==0)
{
strcpy(old[year],id0);
}
else
{
huiche[0]=13;
huiche[1]=0;
strcat(old[year],huiche);
strcat(old[year],id0);
}
}
else
{
strcpy(id[i],id0);
}
}
for(i=149;i>=0;i--)
{
if(old[i][0]!=0)
{
printf("%s\n",old[i]);
}
}
for(i=0;i<n;i++)
{
if(id[i]!=0)
{
printf("%s\n",id[i]);
}
}
return 0;
} | 9 |
4,407 | int main()
{
int n,i,j,s=0,e,z=0;
int a[100],c[100],x[100];
char b[100][10],d[100][10],y[100][10];
char f[100][10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",b[i],&a[i]);
}
for(i=0;i<n;i++){
if(a[i]>=60){
c[s]=a[i];
strcpy(d[s],b[i]);
s++;
}else{
x[z]=a[i];
strcpy(y[z],b[i]);
z++;
}
}
for(i=0;i<s;i++){
for(j=1;j<s-i;j++){
if(c[j-1]<c[j]){
e=c[j];
c[j]=c[j-1];
c[j-1]=e;
strcpy(f[j],d[j]);
strcpy(d[j],d[j-1]);
strcpy(d[j-1],f[j]);
}
}
}
for(i=0;i<s;i++){
printf("%s\n",d[i]);
}
for(i=0;i<z;i++){
printf("%s\n",y[i]);
}
return 0;
} | 9 |
4,408 | int main()
{
char s[100][10];
int n,z[100];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s%d",s[i],&z[i]);
}
for(int j=120;j>=60;j--)
{
for(int t=0;t<n;t++)
{
if(z[t]==j)
{
printf("%s\n",s[t]);
z[t]=0;
}
}
}
for(int m=0;m<n;m++)
{
if(z[m]!=0)
printf("%s\n",s[m]);
}
return 0;
} | 9 |
4,409 | int n;
struct student
{
int a;
char num[20];
struct student *next;
};
struct student *creat()
{
struct student *head,*headtwo,*p1,*p2,*p3,*p4;
p1=(struct student *)malloc(len);
scanf("%s%d",p1->num,&p1->a);
head=(struct student *)malloc(len);
head->next=p1;
p2=head;
p1->next=NULL;
headtwo=(struct student *)malloc(len);
p4=headtwo;
p4->next=NULL;
int i,t=0;
for (i=0;i<n-1;i++)
{
t=0;
p3=(struct student *)malloc(len);
scanf("%s%d",p3->num,&p3->a);
if(p3->a>=60)
{
p2=head;
p1=head->next;
while(p1!=NULL)
{
if(p3->a>p1->a)
{
p3->next=p1;
p2->next=p3;
t=1;
break;
}
p2=p1;
p1=p1->next;
}
if(t==0) {p2->next=p3;p3->next=NULL;}
}
if(p3->a<60)
{
p4->next=p3;
p4=p3;
p4->next=NULL;
}
}
p1=head;
while(p1->next!=NULL)
{
p1=p1->next;
}
p1->next=headtwo->next;
return head;
}
void main()
{
scanf("%d",&n);
struct student *head,*p;
head=creat();
p=head->next;
while (p!=NULL)
{
printf("%s\n",p->num);
p=p->next;
}
}
| 9 |
4,410 |
struct data
{
char id[100];
int age;
};
int main()
{
struct data old[1000];
struct data young[1000];
struct data temp;
int n,i,p=0,q=0,len1,len2,k;
char id[100];
int age;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",id, &age);
if(age>=60){
old[p].age=age;
strcpy(old[p].id,id);
p++;
}else{
young[q].age=age;
strcpy(young[q].id,id);
q++;
}
}
len1=p;
len2=q;
for(k=1;k<len1;k++){
for(i=0;i<len1-k;i++){
if(old[i].age<old[i+1].age){
temp=old[i+1];
old[i+1]=old[i];
old[i]=temp;
}
}
}
for(i=0;i<len1;i++){
printf("%s\n",old[i].id);
}
for(i=0;i<len2;i++){
printf("%s\n",young[i].id);
}
return 0;
}
| 9 |
4,411 | struct patient
{
char id[20];
int age;
struct patient *next;
}*head,*p1,*p2;
struct patient *order(int n)
{
int i,j,t;
char a[20];
for(i=0;i<n-1;i++)
{
p1=head;p2=p1->next;
for(j=0;j<n-1-i;j++)
{
if(p2->age>=60&&p1->age<p2->age)
{
t=p1->age;p1->age=p2->age;p2->age=t;
strcpy(a,p1->id);strcpy(p1->id,p2->id);strcpy(p2->id,a);
}
p1=p1->next;p2=p2->next;
}
}
return head;
}
void main()
{
int n,i;
scanf("%d",&n);
p1=head=(struct patient *)malloc(sizeof(struct patient));
for(i=0;i<n;i++)
{
scanf("%s %d",p1->id,&p1->age);
p2=p1;
p1=(struct patient *)malloc(sizeof(struct patient));
p2->next=p1;
}
p2->next=NULL;
p1=order(n);
while(p1)
{
printf("%s\n",p1->id);
p1=p1->next;
}
} | 9 |
4,412 |
struct patient
{
char id[11];
int age;
};
void main()
{
int n;
scanf("%d\n",&n);
struct patient *p;
p=(struct patient *)malloc(len);
struct patient *a[n],*b[n];
int anum=0,bnum=0;
int i,j;
for(i=0;i<n;i++)
{
scanf("%s %d",p->id,&p->age);
if(p->age>=60)
{
a[anum]=(struct patient *)malloc(len);
strcpy(a[anum]->id,p->id);
a[anum]->age=p->age;
anum++;
}
else
{
b[bnum]=(struct patient *)malloc(len);
strcpy(b[bnum]->id,p->id);
b[bnum]->age=p->age;
bnum++;
}
}
for(i=0;i<anum-1;i++)
{
for(j=0;j<anum-i-1;j++)
if(a[j]->age<a[j+1]->age)
{
p->age=a[j]->age;
a[j]->age=a[j+1]->age;
a[j+1]->age=p->age;
strcpy(p->id,a[j]->id);
strcpy(a[j]->id,a[j+1]->id);
strcpy(a[j+1]->id,p->id);
}
}
for(i=0;i<anum;i++)
printf("%s\n",a[i]->id);
for(i=0;i<bnum;i++)
printf("%s\n",b[i]->id);
} | 9 |
4,413 |
struct a60
{
char ID[10];
int age;
}a60[101];
struct u60
{
char ID[10];
int age;
}u60[100];
void sort(int n)
{
int i;
struct a60 *x;
for(i=1;i<n;i++)
{
for(x=a60; x<a60+n-i; x++)
{
if(x->age < (x+1)->age)
{
a60[100]=*x;
*x=*(x+1);
*(x+1)=a60[100];
}
}
}
}
int main()
{
int a=0, b=0, m, n, q;
char p[10];
struct a60 *x;
struct u60 *y;
x=a60;
y=u60;
scanf("%d", &n);
for(m=0; m<n; m++)
{
scanf("%s %d", p, &q);
if(q>=60)
{
strcpy(x->ID,p);
x->age=q;
x++;
a++;
}else{
strcpy(y->ID,p);
y->age=q;
y++;
b++;
}
}
sort(a);
for(x=a60; x<a60+a; x++)
printf("%s\n", x->ID);
for(y=u60; y<u60+b; y++)
printf("%s\n", y->ID);
return 0;
} | 9 |
4,414 | void main()
{int n,i,j,t;
scanf("%d",&n);
struct patient
{char id[10];
int age;
struct patient *next;
} *p1,*p2,*head,*p[100],*temp;
p1=p2=head=(struct patient *)malloc(sizeof(struct patient));
scanf("%s%d",p1->id,&p1->age);
for(i=2;i<=n;i++)
{p1=(struct patient *)malloc(sizeof(struct patient));
scanf("%s%d",p1->id,&p1->age);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
for(t=0,p1=head;p1!=NULL;p1=p1->next)
if(p1->age>=60)
{ p[t]=p1;
t++;
}
for(j=0;j<t-1;j++)
for(i=0;i<t-j-1;i++)
if(p[i]->age<p[i+1]->age)
{temp=p[i];
p[i]=p[i+1];
p[i+1]=temp;
}
for(i=0;i<=t-1;i++)
printf("%s\n",p[i]->id);
for(p1=head;p1!=NULL;p1=p1->next)
if(p1->age<60)
printf("%s\n",p1->id);
} | 9 |
4,415 | int main()
{
struct patient{
char ID[10];int a;
}p[100],pr;
int np,i,k;
scanf("%d",&np);
for(i=0;i<np;i++){
scanf("%s %d",p[i].ID,&p[i].a);
}
for(i=0;i<np;i++){
for(k=np-1;k>i;k--){
if(p[k].a>p[k-1].a&&p[k].a>=60){
pr=p[k];p[k]=p[k-1];p[k-1]=pr;
}
}
printf("%s\n",p[i].ID);
}
return 0;
} | 9 |
4,416 | int main()
{
int n,a[100],i,num=0,m[100],j;
char c[100][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c[i]);
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]>=60)
{
for(j=0;j<n;j++)
{
if(a[i]>=a[j])
{
num=num+1;
}
}
m[i]=num;
num=0;
}
}
for(j=n;j>0;j--)
{
for(i=0;i<n;i++)
{
if(a[i]>=60)
{
if(m[i]==j)
{
printf("%s\n",c[i]);
}
}
}
}
for(i=0;i<n;i++)
{
if(a[i]<60)
{
printf("%s\n",c[i]);
}
}
return 0;
} | 9 |
4,417 |
int main()
{
int n;
int i,j;
scanf("%d",&n);
char bh[999][999];
int nl[999];
for(i=1;i<=n;i++)
{
scanf("%s %d",bh[i],&nl[i]);
}
int pd[999],k=0;
for(i=1;i<=n;i++)
{
if(nl[i]>=60)
{
k++;
pd[k]=i;
}
}
int e;
for(i=1;i<k;i++)
{
for(j=1;j<=k-i;j++)
{
if (nl[pd[j]]<nl[pd[j+1]])
{
e=pd[j+1];
pd[j+1]=pd[j];
pd[j]=e;
}
}
}
for(i=1;i<=n;i++)
{
if(nl[i]<60)
{
k++;
pd[k]=i;
}
}
for(i=1;i<=k;i++)
{
printf("%s\n",bh[pd[i]]);
}
return 0;
} | 9 |
4,418 | int main(){
int n;
scanf("%d",&n);
char id[100][10];
int age[100];
int oldno=0;
int xu[100];
char shunxu[100][10];
for(int i=0;i<n;i++){
scanf("%s %d",id[i],&age[i]);
}
for(int j=0;j<n;j++){
if(age[j]>=60){
xu[oldno]=age[j];
strcpy(shunxu[oldno],id[j]);
oldno++;
}
}
int num=oldno;
int e;
char tem[10];
for(int k=0;k<n;k++){
if(age[k]<60){
xu[oldno]=age[k];
strcpy(shunxu[oldno],id[k]);
oldno++;
}
}
for(int x=1;x<=num;x++){
for(int y=0;y<num-x;y++){
if(xu[y]<xu[y+1]){
e=xu[y];
xu[y]=xu[y+1];
xu[y+1]=e;
strcpy(tem,shunxu[y]);
strcpy(shunxu[y],shunxu[y+1]);
strcpy(shunxu[y+1],tem);
}
}
}
for(int z=0;z<n;z++){
printf("%s\n",shunxu[z]);
}
return 0;
} | 9 |
4,419 | struct sick
{
char *num;
int age;
struct sick *next;
};
struct sick *range(int N)
{
struct sick *pnew,*ppre,*p,*head,*last;
pnew=(struct sick *)malloc(len);
pnew->num=(char *)malloc(100*sizeof(char));
pnew->next=NULL;
scanf("%s %d",pnew->num,&pnew->age);
head=last=pnew;
int i;
for(i=2;i<=N;i++)
{
pnew=(struct sick *)malloc(len);
pnew->num=(char *)malloc(100*sizeof(char));
pnew->next=NULL;
scanf("%s %d",pnew->num,&pnew->age);
int j;
if (pnew->age<60)
{
last->next=pnew;
last=pnew;
}
else
{
if(pnew->age>head->age)
{
pnew->next=head;
head=pnew;
}
else
{
ppre=head;
p=head->next;
for(j=2;p!=NULL;j++)
{
if(pnew->age>p->age)
{
ppre->next=pnew;
pnew->next=p;
break;
}
else
{
ppre=ppre->next;
p=p->next;
}
}
}
if(pnew->next==NULL)
{
last->next=pnew;
last=pnew;
}
}
}
return(head);
}
void print(struct sick *head,int N)
{
struct sick *p=head;
int i;
for(i=1;i<=N;i++)
{
printf("%s\n",p->num);
p=p->next;
}
}
void main()
{
int N;
scanf("%d",&N);
struct sick *head=range(N);
print(head,N);
}
| 9 |
4,420 | void main()
{
int n,i,j,b[101],b1[101],t,h,k;
char a[101][11]={0},a1[101][11]={0},s1[11];
scanf("%d",&n);
for(i=0,h=0,k=0;i<=n-1;i++)
{
scanf("%s%d",s1,&t);
if(t>=60)
{
b[h]=t;
strcpy(a[h],s1);
h++;
}
else
{
b1[k]=t;
strcpy(a1[k],s1);
k++;
}
}
for(i=0;i<=h-2;i++)
{
for(j=0;j<=h-2-i;j++)
{
if(b[j]<b[j+1])
{
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
strcpy(s1,a[j]);
strcpy(a[j],a[j+1]);
strcpy(a[j+1],s1);
}
}
}
for(i=0;i<=h-1;i++)
{
printf("%s\n",a[i]);
}
for(i=0;i<=k-1;i++)
{
printf("%s\n",a1[i]);
}
}
| 9 |
4,421 | int n,i;
struct man
{
char num[10];
int age;
int nu;
}stu[100];
int f(char *a,int b,int n1,char *c,int d,int n2)
{int sum;
if(b>=60&&d>=60)
{if(b>d)
sum=1;
else if(b<d)
sum=-1;
else
sum=n2-n1;
}
else if(b>=60&&d<60)
sum=1;
else if(b<60&&d>=60)
sum=-1;
else
sum=n2-n1;
return(sum);
}
void main()
{scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",stu[i].num,&stu[i].age);
stu[i].nu=i+1;}
int j,k;
struct man t;
for(i=0;i<n-1;i++)
{k=i;
for(j=i+1;j<n;j++)
if(f(stu[i].num,stu[i].age,stu[i].nu,stu[j].num,stu[j].age,stu[j].nu)<0)
{k=j;
t=stu[i];stu[i]=stu[k];stu[k]=t;}
}
for(i=0;i<n;i++)
printf("%s\n",stu[i].num);
} | 9 |
4,422 | struct bingren{
char id[1000];
int age;
}bin[101];
int main(int argc, char* argv[])
{ int n;
scanf("%d",&n);
int i,j,k=0,l=0,e,a[100];
char xiao[101][1000],da[101][1000],c[1000];
for(i=0;i<n;i++){
scanf("%s %d",&bin[i].id,&bin[i].age);
}
for(i=0;i<n;i++){
if(bin[i].age<60){
strcpy(xiao[k],bin[i].id);
k++;}
else {
strcpy(da[l],bin[i].id);
a[l]=bin[i].age;
l++;}
}
for(i=0;i<l;i++){
for(j=0;j<l-i;j++){
if(a[j]<a[j+1]){
strcpy(c,da[j+1]);
strcpy(da[j+1],da[j]);
strcpy(da[j],c);
e=a[j+1];a[j+1]=a[j];a[j]=e;
}
}
}
for(i=0;i<l;i++){
printf("%s\n",da[i]);
}
for(i=0;i<k;i++){
printf("%s\n",xiao[i]);
}
return 0;
}
| 9 |
4,423 | struct person
{
char id[20];
int y;
};
void main()
{
int n,i,j,m=0,k=0,z;
struct person t,*s,*o,*y;
scanf("%d",&n);
s=(struct person *)malloc(n*sizeof(struct person));
o=(struct person *)malloc(n*sizeof(struct person));
y=(struct person *)malloc(n*sizeof(struct person));
for(i=0;i<n;i++)
{scanf("%s %d",(*(s+i)).id,&(*(s+i)).y);
if ((*(s+i)).y>=60) {*(o+k)=*(s+i);k++;}
else {*(y+m)=*(s+i);m++;}
}
for(i=0;i<k;i++)
{for(j=k-1;j>i;j--)
if (o[j].y>o[j-1].y) {t=o[j];o[j]=o[j-1];o[j-1]=t;}
printf("%s\n",(*(o+i)).id);
}
for(i=0;i<m;i++)
printf("%s\n",(*(y+i)).id);
} | 9 |
4,424 |
struct patient
{
char id[15];
int age;
struct patient *ne;
};
struct patient *lian(int n)
{
int i;
struct patient *head;
struct patient *p;
struct patient *q;
head=(struct patient *)malloc(sizeof(struct patient));
scanf("%s%d",head->id,&head->age);
head->ne=0;
q=head;
for(i=1;i<n;i++)
{
p=(struct patient *)malloc(sizeof(struct patient));
scanf("%s%d",p->id,&p->age);
p->ne=0;
q->ne=p;
q=p;
}
return head;
}
int main()
{
int n,max,i,sign,b=5000;
struct patient *head;
struct patient *p;
scanf("%d",&n);
head=lian(n);
for(;;)
{
for(p=head,max=-1,sign=0;p!=NULL;p=p->ne)
{
if(((p->age)>=60)&&max<(p->age)&&((p->age)<b))
{
max=p->age;
sign=1;
}
}
b=max;
if(sign==0)
break;
for(p=head;p!=NULL;p=p->ne)
{
if((p->age)==max)
{
printf("%s\n",p->id);
}
}
}
for(p=head;p!=NULL;p=p->ne)
{
if((p->age)<60)
printf("%s\n",p->id);
}
return 0;
} | 9 |
4,425 | struct student{
char num[20];
int score;
struct student * next;
};
int n=0;
struct student * creat(int numb);
void print(struct student *head);
struct student *maopao(struct student *head);
int main()
{
int n;
char ch;
struct student *head;
scanf("%d%c",&n,&ch);
head=creat(n);
head=maopao(head);
print(head);
free(head);
}
struct student * creat(int numb) /*?????*/
{
struct student *head; /*?????*/
struct student *p1,*p2; /*??????*/
n=0;
p1=p2=(struct student *)malloc(LEN); /*????????(struct student *)?(void*)??malloc??????
(struct student *)?*/
scanf("%s %d",&p1->num,&p1->score); /*????????*/
head=NULL;
while(n<numb-1) /*??????*/
{
n=n+1; /*?????*/
if(n==1)
{
head=p1; /*?????????p1???head*/
}
else
{
p2->next=p1; /*???p1??p2*/
}
p2=p1; /*p2????*/
p1=(struct student*)malloc(LEN); /*????????*/
scanf("%s %d",&p1->num,&p1->score); /*???????*/
}
p2->next=p1; /*????????next??NULL*/
p1->next=NULL;
return(head); /*?????*/
}
struct student *maopao(struct student *head)
{
struct student *p0,*p1,*p2,*tem;
int temp=0,i,j;
p0=head;
p1=head;
p2=head;
if(head==NULL)
{
return(head);
}
else if(p0->next==NULL)
{
return(head);
}
else if(p0->next!=NULL)
{
for(i=0;i<n;i=i+1)
{
for(j=0;j<n-1;j=j+1)
{
if(p1->score<p1->next->score&&j!=0&&p1->next->score>=60)
{
tem=p1->next;
p2->next=p1->next;
p1->next=tem->next;
tem->next=p1;
p2=p2->next;
}
else if(p1->score<p1->next->score&&j==0&&p1->next->score>=60)
{
tem=p1->next;
p0=tem;
p2=tem;
p1->next=tem->next;
tem->next=p1;
p2=p1;
p1=p1->next;
}
else
{
p2=p1;
p1=p1->next;
}
}
temp=temp+1;
p1=p0;
p2=p0;
}
}
return(p0);
}
void print(struct student *head) /*????*/
{
struct student *p,*tempo; /*??????*/
p=head; /*??head??????*/
if(head!=NULL) /*????????*/
{
do
{
tempo=p->next;
printf("%s\n",p->num);
p=tempo;
}while(p!=NULL); /*?p?????????*/
}
} | 9 |
4,426 |
struct pat
{
char id[11];
int age;
struct pat *next;
};
void find(struct pat *head,struct pat *s)
{
struct pat *pre=head,*p=pre->next;
while(p!=NULL&&s->age<=p->age)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
void sort(struct pat *head,int x,char name[11])
{
struct pat *pre=head,*p=pre->next,*s;
s=(struct pat*)malloc(sizeof(struct pat));
s->age=x;
strcpy(s->id,name);
s->next=NULL;
if(x>=60) find(head,s);
else
{
while(p!=NULL)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
}
int main()
{
struct pat *head,*p;
int n,x,i;
char name[11];
head=(struct pat*)malloc(sizeof(struct pat));
head->next=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",name,&x);
sort(head,x,name);
}
p=head->next;
while(p!=NULL)
{
printf("%s\n",p->id);
p=p->next;
}
return 0;
} | 9 |
4,427 |
int main()
{
struct patient{
char id[10];
int age;
}br[100];
int n,i,j,mid,k;
char s[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",&br[i].id,&br[i].age);
}
for(k=0;k<n;k++){
for(i=0;i<n;i++){
if(br[i].age>=60){
for(j=i+1;j<n;j++){
if(br[j].age>=60){
if(br[j].age>br[i].age){
mid=br[i].age;
br[i].age=br[j].age;
br[j].age=mid;
strcpy(s,br[i].id);
strcpy(br[i].id,br[j].id);
strcpy(br[j].id,s);
}
break;
}
}
}
}
}
for(i=0;i<n;i++){
if(br[i].age>=60){
printf("%s\n",br[i].id);
}
}
for(i=0;i<n;i++){
if(br[i].age<60){
printf("%s\n",br[i].id);
}
}
return 0;
}
| 9 |
4,428 |
struct patient{
char num[11];
int age;
};
int main()
{
int n,i;
scanf("%d",&n);
struct patient pat1[100],pat2[100];
for(i=0;i<n;i++){
scanf("%s %d",pat1[i].num,&pat1[i].age);
strcpy(pat2[i].num,pat1[i].num);
pat2[i].age=pat1[i].age;
}
int j,e;
char e_num[11];
for(j=1;j<n;j++){
for(i=0;i<n-j;i++){
if(pat1[i].age<pat1[i+1].age){
e=pat1[i+1].age;
strcpy(e_num,pat1[i+1].num);
pat1[i+1].age=pat1[i].age;
strcpy(pat1[i+1].num,pat1[i].num);
pat1[i].age=e;
strcpy(pat1[i].num,e_num);
}
}
}
for(i=0;i<n;i++){
if(pat1[i].age>=60){
printf("%s\n",pat1[i].num);
}
}
for(i=0;i<n;i++){
if(pat2[i].age<60){
printf("%s\n",pat2[i].num);
}
}
return 0;
}
| 9 |
4,429 | void main()
{
int n,i,j, b[100]={0},t,m;
scanf("%d\n",&n);
struct patient
{
char num[10];
int age;
}a[100];
for(i=0;i<n;i++) {scanf("%s %d\n",a[i].num,&a[i].age); b[i]=a[i].age;}
for(j=0;j<n-1;j++)
for(i=0;i<n-1-j;i++)
if(b[i]<b[i+1])
{t=b[i];b[i]=b[i+1];b[i+1]=t;}
for(i=0;i<n;i++) if(b[i]<60) {m=i;break;}
for(j=0;j<m;j++)
for(i=0;i<n;i++)
if(a[i].age==b[j] && (j==0 || b[j]!=b[j-1])) printf("%s\n",a[i].num);
for(i=0;i<n;i++) if(a[i].age<60) printf("%s\n",a[i].num);
}
| 9 |
4,430 |
int main(int argc, char* argv[])
{
struct patient{
char ID[10];
int age;
}pat[100],old[100];
int n,i,j,k=0,a;
char b[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",pat[i].ID,&pat[i].age);
if(pat[i].age>=60){
strcpy(old[k].ID,pat[i].ID);
old[k].age=pat[i].age;
k++;
}
}
for(i=0;i<k-1;i++){
for(j=0;j<k-1-i;j++){
if(old[j].age<old[j+1].age){
a=old[j].age;
old[j].age=old[j+1].age;
old[j+1].age=a;
strcpy(b,old[j].ID);
strcpy(old[j].ID,old[j+1].ID);
strcpy(old[j+1].ID,b);
}
}
}
for(i=0;i<k;i++)
printf("%s\n",old[i].ID);
for(i=0;i<n;i++){
if(pat[i].age<60){
printf("%s\n",pat[i].ID);
}
}
return 0;
} | 9 |
4,431 | struct bing
{
char id[20];
int age;
};
int main()
{
struct bing b[100],sixup[100],sixdown[100];
struct bing temp;
int m;
int n,l;
int i,j;
scanf("%d",&m);
for(i=0;i<=m-1;i++)
{
scanf("%s%d",b[i].id,&b[i].age);
}
n=0;l=0;
for(i=0;i<=m-1;i++)
{
if(b[i].age>=60)
{
sixup[n]=b[i];
n++;
}
else
{ sixdown[l]=b[i];
l++;
}
}
for(i=1;i<=n-1;i++)
{
temp=sixup[i];
for(j=i-1;j>=0;j--)
{
if(temp.age>sixup[j].age)
{
sixup[j+1]=sixup[j];
sixup[j]=temp;
}
else
{
break;
}
}
}
for(i=0;i<=n-1;i++)
{
puts(sixup[i].id);
}
for(i=0;i<=l-1;i++)
{
puts(sixdown[i].id);
}
return 0;
}
| 9 |
4,432 | typedef struct {
char id[20];
int age;
} patient;
int main()
{
patient a[100],b[100],c[100],temp;
int n,i,j,k=0,l=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",a[i].id,&a[i].age);
if(a[i].age>=60)
{for(j=0;j<20;j++)
{b[k].id[j]=a[i].id[j];
b[k].age=a[i].age;}k++;}
else {for(j=0;j<20;j++)
{c[l].id[j]=a[i].id[j];}l++;}
}
for(i=k-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(b[j].age<b[j+1].age)
{
temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
}
}
}
for(i=0;i<k;i++)
printf("%s\n",b[i].id);
for(i=0;i<l;i++)
printf("%s\n",c[i].id);
} | 9 |
4,433 |
struct mice
{
int wei;
char color[100];
struct mice *next;
};
struct mice *creat(int c)
{
struct mice *head;
struct mice *p1,*p2;
struct mice *kok;
kok=(struct mice*)malloc(LEN);
kok->wei=0;strcpy(kok->color,"\0");
int t;
t=0;
p1=p2=(struct mice*)malloc(LEN);
scanf("%s %d",p1->color,&p1->wei);
head=NULL;
while(t<c)
{
t=t+1;
if(t==1)
{head=p1;}
else
{
p2->next=p1;
p2=p1;
p1=(struct mice*)malloc(LEN);
scanf("%s %d",p1->color,&p1->wei);
}
}
p2->next=p1;
p2=p1;
p2->next=kok;
return(head);
}
void mun(struct mice *hoih,int io)
{
int i,j,k;
k=0;
struct mice *bt;
bt=hoih;
char str[100];
for(i=0;i<io;i++)
{
for(j=0;j<io-i;j++)
{
if(hoih->wei<(hoih->next)->wei&&(hoih->next)->wei>=60)
{
k=hoih->wei;
hoih->wei=(hoih->next)->wei;
(hoih->next)->wei=k;
strcpy(str,hoih->color);
strcpy(hoih->color,(hoih->next)->color);
strcpy((hoih->next)->color,str);
}
hoih=hoih->next;
}
hoih=bt;
}
return;
}
void main()
{
int n,h;
struct mice *creat(int c);
struct mice *p,*he;
scanf("%d",&n);
p=creat(n);
he=p;
void mun(struct mice *hoih,int io);
mun(p,n);
p=he;
for(h=0;h<n;h++)
{
printf("%s\n",p->color);
p=p->next;
}
}
| 9 |
4,434 | int main (){
char p[200][10],q[200][10]={0},c[10];
int a[200],b[200];
int n,i,j,x,y,t;
scanf ("%d",&n);
for (i=0;i<n;i++){
scanf ("%s",p[i]);
scanf ("%d",&a[i]);
}
j=0;
x=0;
t=0;
y=0;
for (i=0;i<n;i++){
if (a[i]>=60){
b[j]=a[i];
strcpy(q[j],p[i]);
j++;
t++;
}
}
for (j=t-1;j>0;j--){
for (i=0;i<j;i++){
if (b[i]<b[i+1]){
int r;
r=b[i+1];
strcpy(c,q[i+1]);
b[i+1]=b[i];
strcpy(q[i+1],q[i]);
b[i]=r;
strcpy(q[i],c);
}
}
}
for (i=0;i<t;i++){
printf ("%s\n",q[i]);
}
for (i=0;i<n;i++){
if (a[i]<60){
printf ("%s\n",p[i]);}
}
return 0;
}
| 9 |
4,435 | struct ID{
char idnum[100];
int old;
};
int main(){
struct ID ido[100];//???????
struct ID idy[100];//???????
struct ID id[100];//???????
struct ID e;
int n,i,a=0,b=0,j,l,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",id[i].idnum,&(id[i].old));
if(id[i].old>=60){//????60 ????????????????
strcpy(ido[a].idnum, id[i].idnum);
ido[a].old=id[i].old;
a++;
}else {//?????????????????
strcpy(idy[b].idnum, id[i].idnum);
idy[b].old=id[i].old;
b++;
}
}
for(k = 1 ; k <= a ; k++){//?????????
for(i = 0; i < a - k; i++){
if(ido[i].old < ido[i+1].old){
e = ido[i+1];
ido[i+1] = ido[i];
ido[i] = e;
}
}
}
for(j=0;j<a;j++){//????
printf("%s\n",ido[j].idnum);
}
for(l=0;l<b;l++){
printf("%s\n",idy[l].idnum);
}
return 0;
}
| 9 |
4,436 | int main(){
int n, m=0, sz[100], i, j, sz2[100], e;
char zf[100][20], f[20], zf2[100][20];
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%s", zf[i]);
scanf("%d", &sz[i]);
}
for(i=0;i<n;i++){
if(sz[i]>=60){
n--;
strcpy(zf2[m],zf[i]);
sz2[m]=sz[i];
m++;
for(j=i;j<=n;j++){
strcpy(zf[j],zf[j+1]);
sz[j]=sz[j+1];
}
i--;
}
}
for(j=1;j<=m;j++){
for(i=0;i<m-j;i++){
if(sz2[i]<sz2[i+1]){
e=sz2[i];
sz2[i]=sz2[i+1];
sz2[i+1]=e;
strcpy(f,zf2[i]);
strcpy(zf2[i],zf2[i+1]);
strcpy(zf2[i+1],f);
}
}
}
for(i=0;i<m;i++){
printf("%s\n", zf2[i]);
}
for(i=0;i<n;i++){
printf("%s\n", zf[i]);
}
return 0;
} | 9 |
4,437 | void main(){
int n,i,j,mid;
char M[11];
scanf("%d",&n);
struct patient{
char ID[11];
int age;
};
struct patient *per=(struct patient*)malloc(sizeof(struct patient)*n);
for(i=0;i<n;i++)
scanf("%s%d",per[i].ID,&per[i].age);
for(j=0;j<n;j++)
for(i=0;i<n-1;i++){
if(per[i].age<60&&per[i+1].age>=60){
mid=per[i].age;
strcpy(M,per[i].ID);
per[i].age=per[i+1].age;
strcpy(per[i].ID,per[i+1].ID);
per[i+1].age=mid;
strcpy(per[i+1].ID,M);
}
if(per[i].age>=60&&per[i+1].age>=60&&per[i].age<per[i+1].age){
mid=per[i].age;
strcpy(M,per[i].ID);
per[i].age=per[i+1].age;
strcpy(per[i].ID,per[i+1].ID);
per[i+1].age=mid;
strcpy(per[i+1].ID,M);
}
}
for(i=0;i<n;i++)
printf("%s\n",per[i].ID);
free(per);
} | 9 |
4,438 | int main()
{
int n,i,j,k,s,m,t,p,r;
int a[100],b[100];
char str1[100][10],str2[100][10];
char string[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",str1[i],&a[i]);
for(p=0,s=0;p<n;p++)
{
if(a[p]>=60)
{
b[s]=a[p];
strcpy(str2[s],str1[p]);
s=s+1;
}
}
for(k=0;k<(s-1);k++)
{
for(m=0;m<(s-k-1);m++)
{
if(b[m+1]>b[m])
{
t=b[m+1];
b[m+1]=b[m];
b[m]=t;
strcpy(string,str2[m+1]);
strcpy(str2[m+1],str2[m]);
strcpy(str2[m],string);
}
}
}
for(j=0;j<s;j++)
printf("%s\n",str2[j]);
for(r=0;r<n;r++)
{
if(a[r]<60)
printf("%s\n",str1[r]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
} | 9 |
4,439 | struct sick
{
char num[10];
int age;
};
int main()
{
int i,j,n;
int s;
char swap[10];
struct sick all[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&all[i].num);
scanf("%d",&all[i].age);
}
for(i=1;i<n;i++){
for(j=i;j>0;j--){
if(all[j].age>=60&&all[j].age>all[j-1].age){
s=all[j].age;
all[j].age=all[j-1].age;
all[j-1].age=s;
strcpy(swap,all[j].num);
strcpy(all[j].num,all[j-1].num);
strcpy(all[j-1].num,swap);
}
else{
break;
}
}
}
for(i=0;i<n;i++){
puts(all[i].num);
}
return 0;
}
| 9 |
4,440 | int main(){
int i,n,j;
char s[100][11],z[11];
int g[100],c;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",s[i],&g[i]);
}
for(i=0;i<n;i++){
for(j=1;j<n-i;j++){
if(g[j-1]<g[j]&&g[j]>=60){
strcpy(z,s[j-1]);strcpy(s[j-1],s[j]);strcpy(s[j],z);
c=g[j-1];g[j-1]=g[j];g[j]=c;
}
}
}
for(i=0;i<n-1;i++){
printf("%s\n",s[i]);
}
if(i==n-1){
printf("%s",s[i]);
}
return 0;
} | 9 |
4,441 | struct pati
{
char ID[10];
int age;
}p[100];
void main()
{
int i,j,n,p2[100]={0},p3[100]={0},t=0,r=0,tem;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",p[i].ID,&p[i].age);
if(p[i].age>=60)
{
p2[t]=p[i].age;
t++;
}
}
for(i=0;i<t-1;i++)
for(j=0;j<t-1-i;j++)
{
if(p2[j]<p2[j+1])
{
tem=p2[j+1];
p2[j+1]=p2[j];
p2[j]=tem;
}
}
for(i=0;i<t;i++)
{
if(i>0)
{
if(p2[i]!=p2[i-1])
{
p3[r]=p2[i];
r++;
}
}
else
{
p3[r]=p2[i];
r++;
}
}
t=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(p[j].age==p3[t])
{
printf("%s\n",p[j].ID);
}
}
t++;
}
for(i=0;i<n;i++)
if(p[i].age<60)
printf("%s\n",p[i].ID);
} | 9 |
4,442 |
struct man
{
char id[20];
int a;
struct man *next;
}*p,*head,*q;
void main()
{
struct man * insert(struct man *head,struct man *ill);
int n,i;
scanf("%d",&n);
head=NULL;
for(i=0;i<n;i++)
{
p=(struct man*)malloc(LEN);
scanf("%s %d",p->id,&p->a);
head=insert(head,p);
}
q=head;
while(q!=NULL)
{
printf("%s\n",q->id);
q=q->next;
}
}
struct man * insert(struct man *head,struct man *ill)
{
struct man *p0,*p1,*p2;
p1=head;
p0=ill;
if(head==NULL)
{
head=p0;
p0->next=NULL;
}
else
{
if(p0->a<60)
{
while(p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
p1->next=p0;
p0->next=NULL;
}
else if(p0->a>=60)
{
while((p0->a<=p1->a)&&(p1->next!=NULL))
{
p2=p1;
p1=p1->next;
}
if(p0->a>p1->a)
{
if(head==p1)
head=p0;
else
p2->next=p0;
p0->next=p1;}
else
{
p1->next=p0;
p0->next=NULL;
}
}
}
return(head);
}
| 9 |
4,443 |
struct a
{
char id[20];
int age;
struct a * next;
};
struct a * insert(struct a * head,struct a * s)/*??????????????????????*/
{
struct a *p0,*p1,*p2;
p1=head;/*???*/
p0=s;/*??????*/
if(head==NULL)/*?????*/
{head=p0;p0->next=NULL;}
else{
//while((p0->age<p1->age)&&(p1->next!=NULL))
while((p0->age<=p1->age)&&(p1->next!=NULL))
{p2=p1;p1=p1->next;}/*??????*/
if(p0->age>p1->age)/*???*/
{
if(head==p1)head=p0;
else p2->next=p0;
p0->next=p1;
}
else{p1->next=p0;p0->next=NULL;}/*????????*/
}
return(head);
}
struct a *creat(struct a * head, struct a * s)/*???????????????????*/
{
struct a *t;
if(head==NULL)
{head=s;s->next=NULL;}
else
{ for(t=head;t->next!=NULL;t=t->next);/*????*/
t->next=s; /*??*/
s->next=NULL;
}
return(head);
}
void main()
{
struct a *head1,*head2,*s,*p;
int i,n;
scanf("%d",&n);
head1=NULL;
head2=NULL;
for(i=0;i<=n-1;i++)
{ s=LEN;
scanf("%s %d",s->id,&s->age);
s->next=NULL;
if(s->age>=60)
head1=insert(head1,s);/*???????????????*/
if(s->age<60)
head2=creat(head2,s);/*?????????????*/
}
for(p=head1;p!=NULL;p=p->next)
printf("%s\n",p->id);
for(p=head2;p!=NULL;p=p->next)/*????????????????*/
printf("%s\n",p->id);
} | 9 |
4,444 |
int main()
{
int n,t;
char tc[16];
struct per
{
char id[16];
int a;
}a[100];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s %d",a[i].id,&a[i].a);
}
for(int j=n-1;j>0;j--)
{
for(int r=0;r<j;r++)
{
if(a[r].a>59&&a[r+1].a>59&&a[r].a<a[r+1].a)
{
strcpy(tc,a[r+1].id);
strcpy(a[r+1].id,a[r].id);
strcpy(a[r].id,tc);
t=a[r+1].a;
a[r+1].a=a[r].a;
a[r].a=t;
r=0;
}
if(a[r].a<=59&&a[r+1].a>59)
{
strcpy(tc,a[r+1].id);
strcpy(a[r+1].id,a[r].id);
strcpy(a[r].id,tc);
t=a[r+1].a;
a[r+1].a=a[r].a;
a[r].a=t;
r=0;
}
}
}
for(int f=0;f<n;f++)
{
printf("%s\n",a[f].id);
}
return 0;
}
| 9 |
4,445 | struct pa{
char id[10];
int age;
struct pa* next;
}*head,*p,*p2;
int main()
{
int i,j,n,t;
char tid[10];
scanf("%d",&n);
head=(struct pa*)malloc(sizeof(struct pa));
p=(struct pa*)malloc(sizeof(struct pa));
scanf("%s %d",p->id,&p->age);
head->next=p;
p->next=NULL;
p2=p;
for(i=1;i<n;i++)
{
p=(struct pa*)malloc(sizeof(struct pa));
scanf("%s %d",p->id,&p->age);
p2->next=p;
p2=p;
p2->next=NULL;
}
// for(p=head->next;p!=NULL;p=p->next)printf("%s\n",p->id);
for(i=0;i<n;i++) //???????????, ????GE?????
{
for(p=head->next;p->next!=NULL;p=p->next)
{
if(p->next->age>=60 && p->next->age>p->age) //???????..?????????.
{ t=p->age,p->age=p->next->age,p->next->age=t;
strcpy(tid,p->id),strcpy(p->id,p->next->id),strcpy(p->next->id,tid);
}
}
}
p=head->next;
for(i=0;i<n;i++)
{
printf("%s\n",p->id);
p=p->next;
}
return 0;
} | 9 |
4,446 | struct stu{
char n[30];
int y;
};
void sort(struct stu a[],int l, int r)
{
int i=l,j=r,t=a[(l+r)/2].y;
struct stu temp;
while (i<=j)
{
while (a[i].y>t) i++;
while (a[j].y<t) j--;
if (i<=j)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
i++;
j--;
}
}
if (l<j) sort(a,l,j);
if (i<r) sort(a,i,r);
}
int main()
{
int n;
struct stu a[1000],b[1000],c[1000],temp;
int i,j,tot=0,totc=0;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s %d",&a[i].n,&a[i].y);
if (a[i].y>=60)
{
b[++tot]=a[i];
} else
{
c[++totc]=a[i];
}
}
for (i=1;i<tot;i++)
for (j=2;j<=tot-i+1;j++)
if (b[j-1].y<b[j].y)
{
temp=b[j-1];
b[j-1]=b[j];
b[j]=temp;
}
for (i=1;i<=tot;i++) printf("%s\n",b[i].n);
for (i=1;i<=totc;i++) printf("%s\n",c[i].n);
// scanf("%d",&n);
return 0;
}
| 9 |
4,447 | void main()
{
int n, age[100]={0}, i, j, k, old[101]={0}, oldn, youngn;
char id[101][20]={0}, oldid[101][20]={0}, youngid[101][20]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%s%d",id[i],&age[i]);
for(i=1,j=1,k=1;i<=n;i++)
{
if(age[i]>=60)
{
old[j]=age[i];
strcpy(oldid[j],id[i]);
j++;
}
else
{
strcpy(youngid[k],id[i]);
k++;
}
}
oldn=j;
youngn=k;
for(i=1;i<=oldn;i++)
{
for(j=1;j<=oldn-i;j++)
{
if(old[j]<old[j+1])
{
old[100]=old[j];
old[j]=old[j+1];
old[j+1]=old[100];
strcpy(oldid[101],oldid[j]);
strcpy(oldid[j],oldid[j+1]);
strcpy(oldid[j+1],oldid[101]);
}
}
}
for(i=1;i<oldn;i++)
printf("%s\n",oldid[i]);
for(k=1;k<youngn;k++)
printf("%s\n",youngid[k]);
} | 9 |
4,448 | struct bing
{
char a[10];
int age;
};
struct bing bing[1000];
int main()
{
int n,i,j=1,v=1,k,t[1000],m,p[1000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%d",&bing[i].a,&bing[i].age);
if(bing[i].age>=60)
{
t[j]=i;
j++;
}
else
{
p[v]=i;
v++;
}
}
j--;
v--;
if(j!=0)
{
for(i=1;i<j;i++)
for(k=1;k<j-i+1;k++)
if(bing[t[k]].age<bing[t[k+1]].age)
{
m=t[k];
t[k]=t[k+1];
t[k+1]=m;
}
}
for(i=1;i<=j;i++)
printf("%s\n",bing[t[i]].a);
for(i=1;i<=v;i++)
printf("%s\n",bing[p[i]].a);
getchar();
getchar();
getchar();
}
| 9 |
4,449 | struct patient
{
char id[10];
int age;
struct patient *next;
};
void sort(struct patient *head,struct patient *s)
{
struct patient *pre=head,*p=pre->next;
if(s->age>=60)
{
while(p!=NULL&&s->age<=p->age)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
else
{
while(pre->next!=NULL)pre=pre->next;
pre->next=s;
}
}
void main()
{
int n,i;
scanf("%d",&n);
struct patient *head,*p;
head=(struct patient*)malloc(LEN);
head->next=NULL;
for(i=0;i<n;i++)
{
p=(struct patient*)malloc(LEN);
scanf("%s %d",p->id,&p->age);
p->next=NULL;
sort(head,p);
}
p=head->next;
while(p!=NULL)
{
printf("%s\n",&p->id);
p=p->next;
}
} | 9 |
4,450 | int main()
{
int n, i, j, temp, num1 = 0, num2 = 100, age[100], flag[100];
char id[100][10], str[10];
cin >> n;
for (i = 0; i < n; i ++)
{
cin.get();
cin >> id[i] >> age[i];
if (age[i] < 60)
flag[i] = num1 ++;
else
flag[i] = num2 ++;
}
for (i = 0; i < n - 1; i ++)
{
for (j = i + 1; j < n; j ++)
{
if (age[i] < age[j] && age[j] >= 60)
{
temp = flag[i];
flag[i] = flag[j];
flag[j] = temp;
temp = age[i];
age[i] = age[j];
age[j] = temp;
strcpy(str, id[i]);
strcpy(id[i], id[j]);
strcpy(id[j], str);
}
}
}
for (i = 0; i < n - 1; i ++)
{
for (j = i + 1; j < n; j ++)
{
if (age[i] == age[j] && age[i] >= 60 && age[j] >= 60 && flag[i] > flag[j] || age[i] < 60 && age[j] < 60 && flag[i] > flag[j])
{
temp = flag[i];
flag[i] = flag[j];
flag[j] = temp;
temp = age[i];
age[i] = age[j];
age[j] = temp;
strcpy(str, id[i]);
strcpy(id[i], id[j]);
strcpy(id[j], str);
}
}
}
for (i = 0; i < n; i ++)
cout << id[i] << endl;
return 0;
}
| 9 |
4,451 | void main()
{
int a[100],n,i,j,k=0,d[100],p;
char b[100][10],c[10],str[100][10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",str[i],&a[i]);
for(i=0;i<n;i++)
if(a[i]>=60)
{
d[k]=a[i];
strcpy(b[k],str[i]);
k++;
}
for(i=0;i<k;i++)
for(j=0;j<k-i-1;j++)
if(d[j]<d[j+1])
{
p=d[j+1];
d[j+1]=d[j];
d[j]=p;
strcpy(c,b[j+1]);
strcpy(b[j+1],b[j]);
strcpy(b[j],c);
}
for(i=0;i<k;i++)
printf("%s\n",b[i]);
for(i=0;i<n;i++)
if(a[i]<60)
printf("%s\n",str[i]);
} | 9 |
4,452 | struct Student
{
char id[10];
int age;
}ill[100];
int main()
{
int i,j,n,q;
char p[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",&ill[i].id,&ill[i].age);
for(j=0;j<n-1;j++)
for(i=n-1;i>j;i--){
if(ill[i].age>=60&&ill[i].age>ill[i-1].age){
strcpy(p,ill[i].id); q=ill[i].age;
strcpy(ill[i].id,ill[i-1].id); ill[i].age=ill[i-1].age;
strcpy(ill[i-1].id,p); ill[i-1].age=q;
}
}
for(i=0;i<n;i++)
printf("%s\n",ill[i].id);
} | 9 |
4,453 | void main()
{
int i,j=0,s,t,k=0,n;
struct patient{
char ID[10];
int age;
};
struct patient p[100],d[100],c[100],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",p[i].ID,&p[i].age);
}
for(i=0;i<n;i++)
{
if(p[i].age>=60)
d[j++]=p[i];
else c[k++]=p[i];
}
s=j;
t=k;
for(i=1;i<s;i++)
{
for(j=0;j<s-i;j++)
{
if(d[j].age<d[j+1].age)
{
temp=d[j];
d[j]=d[j+1];
d[j+1]=temp;
}
}
}
for(i=0;i<s;i++)
{
printf("%s\n",d[i].ID);
}
for(i=0;i<t;i++)
printf("%s\n",c[i].ID);
}
| 9 |
4,454 | struct patient
{
char num[11];
int age;
}sick[101];
int main()
{
int n,i,j,k,r,s;
s=0;
r=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",sick[i].num);
scanf("%d",&sick[i].age);
}
int old[101]={0};
int young[101]={0};
for(i=0;i<n;i++){
if(sick[i].age>=60){
for(j=0;j<=s;j++){
if(sick[i].age>sick[old[j]].age||j==s){
if(j==s){
old[s]=i;
s=s+1;
break;
}
else{
for(k=s;k>=j;k--){
old[k+1]=old[k];
}
old[j]=i;
s=s+1;
break;
}
}
}
}
else{
young[r]=i;
r=r+1;
}
}
for(i=0;i<s;i++){
printf("%s\n",sick[old[i]].num);
}
for(i=0;i<r;i++){
printf("%s\n",sick[young[i]].num);
}
return 0;
} | 9 |
4,455 |
struct Patient{
char id[10];
int age,arranged;
};
int main()
{
int n,i,t=0,j;
struct Patient pai[100],orderd[100];
cin>>n;
for(i=0;i<n;i++)
{
cin>>pai[i].id>>pai[i].age;
pai[i].arranged=0;
}
for(i=0;i<n;i++)
{
if(pai[i].age>=60)
{
orderd[t]=pai[i];
pai[i].arranged =1;
t++;
}
}
for(i=0;i<t;i++)
{
for(j=0;j<t-1-i;j++)
{
if(orderd[j].age<orderd[j+1].age)
{
struct Patient temp=orderd[j];
orderd[j]=orderd[j+1];
orderd[j+1]=temp;
}
}
}
for(i=0;i<n;i++)
{
if(pai[i].arranged==0)
{
orderd[t]=pai[i];
t++;
}
}
for(i=0;i<n;i++)
{
cout<<orderd[i].id<<endl ;
}
return 0;
} | 9 |
4,456 | struct patient
{
char ID[11]; //?????
int age;
}pa[100]; //?????
int main(int argc, char* argv[])
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pa[i].ID,&pa[i].age);
} //??100?????
struct patient old[100];//????????????60??
int count=0;
for(i=0;i<n;i++)
{
if(pa[i].age>=60)
{
strcpy(old[count].ID,pa[i].ID);
old[count].age=pa[i].age;
count++;
pa[i].age=0;
}
}
int k,j,e;
char ex[11];
for(k=1;k<count;k++)
{
for(j=0;j<count-k;j++)
{
if(old[j].age<old[j+1].age)
{
e=old[j+1].age;
old[j+1].age=old[j].age;
old[j].age=e;
strcpy(ex,old[j].ID);
strcpy(old[j].ID,old[j+1].ID);
strcpy(old[j+1].ID,ex);
}
}
}
for(i=0;i<count;i++)
{
printf("%s\n",old[i].ID);
}
for(i=0;i<n;i++)
{
if(pa[i].age!=0)
{
printf("%s\n",pa[i].ID);
}
}
return 0;
} | 9 |
4,457 | int main(){
int n,i,t,k;
scanf("%d",&n);
char a[100][10],c[11];
int b[100];
for(i=0;i<n;i++){
scanf("%s %d",a[i],&b[i]);
if(b[i]<60){
b[i]=0;
}
}
for(k=1;k<=n;k++){
for(i=0;i<n-k;i++){
if(b[i]<b[i+1]){
t=b[i];
b[i]=b[i+1];
b[i+1]=t;
strcpy(c, a[i]);
strcpy(a[i], a[i+1]);
strcpy(a[i+1], c);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",a[i]);
}
return 0;
}
| 9 |
4,458 | int main()
{
int n,i,a[100],j=0,c[100],z,r;
char s[100][10],b[100][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",s[i],&a[i]);
if(a[i]>=60){
c[j]=a[i];
strcpy(b[j],s[i]);
j++;
}
}
for(z=j-1;z>0;z--)
{
for(r=0;r<z;r++)
{
if(c[r]<c[r+1]){
int tep;
char m[10];
tep=c[r+1];
c[r+1]=c[r];
c[r]=tep;
strcpy(m,b[r]);
strcpy(b[r],b[r+1]);
strcpy(b[r+1],m);
}
}
}
for(i=0;i<j;i++)
{
printf("%s\n",b[i]);
}
for(i=0;i<n;i++)
{
if(a[i]<60){
printf("%s\n",s[i]);
}
}
return 0;
} | 9 |
4,459 | void main()
{
struct people
{
char num[10];
int age;
}peo[100],pai[100],temp;
int i,n;
int j=0;
int k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",peo[i].num,&peo[i].age);
}
for(i=0;i<n;i++)
{
if(peo[i].age>=60)
{
pai[j]=peo[i];
j++;
}
}
for(i=0;i<n;i++)
{
if(peo[i].age<60)
{
pai[j]=peo[i];
j++;
}
}
for(k=0;k<j-1;k++)
{
for(i=0;i<j-1-k;i++)
{
if((pai[i].age<pai[i+1].age)&&(pai[i+1].age>=60))
{
temp=pai[i];
pai[i]=pai[i+1];
pai[i+1]=temp;
}
}
}
for(i=0;i<n;i++)
printf("%s\n",pai[i].num);
}
| 9 |
4,460 | struct patient
{
char num[10];
int age;
}a[100];
void main()
{
int max(int b[],int m);
int n,i,j=0,c[100],g;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%s%d",&a[i].num,&a[i].age);
for(i=0;i<n;i++)
c[i]=a[i].age;
g=max(c,n);
while (g>=60)
{
for(i=0;i<n;i++)
{if (c[i]==g)
{
printf("%s\n",a[i].num);
c[i]=0;
}
}
g=max(c,n);
}
for(i=0;i<n;i++)
{
if (a[i].age<60)
printf("%s\n",a[i].num);
}
}
int max(int b[],int m)
{
int t,s;
s=b[0];
for(t=0;t<m;t++)
{
if (s<b[t])
s=b[t];
}
return(s);
} | 9 |
4,461 | int main()
{
char id[100][10],a[10];
int n,i,j;
int age[100],b;
scanf("%d ",&n);
for(i=0;i<n;i++)
{
scanf(" %s %d",&id[i],&age[i]);
}
for(j=n-1;j>0;j--)
{
for(i=n-1;i>0;i--)
{
if(age[i]>=60&&age[i-1]>=60)
{
if(age[i]>age[i-1])
{
strcpy(a,id[i]);b=age[i];
strcpy(id[i],id[i-1]);age[i]=age[i-1];
strcpy(id[i-1],a);age[i-1]=b;
}
}
if(age[i]>=60&&age[i-1]<60)
{
strcpy(a,id[i]);b=age[i];
strcpy(id[i],id[i-1]);age[i]=age[i-1];
strcpy(id[i-1],a);age[i-1]=b;
}
}
}
for(i=0;i<n;i++)
{
if(i==0) printf("%s",id[i]);
else printf("\n%s",id[i]);
}
return 0;
} | 9 |
4,462 | int main()
{
int n,i,j,k=0,t=0,y[100],x,a[100]={0},b[100];
char s[100][20],temp[20],s1[100][20],s2[100][20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",s[i],&y[i]);
}
for(i=0;i<n;i++)
{
if(y[i]>=60)
{
strcpy(s1[k],s[i]);
a[k]=y[i];
k++;
}
}
// for(i=0;i<k;i++)
// printf("%s %d@@\n",s1[i],a[i]);
for(i=0;i<k-1;i++)
for(j=0;j<k-i-1;j++)
if(a[j]<a[j+1])
{
x=a[j];
a[j]=a[j+1];
a[j+1]=x;
strcpy(temp,s1[j]);
strcpy(s1[j],s1[j+1]);
strcpy(s1[j+1],temp);
}
for(i=0;i<k;i++)
printf("%s\n",s1[i],a[i]);
for(i=0;i<n;i++)
{
if(y[i]<60)
{
strcpy(s2[t],s[i]);
t++;
}
}
for(i=0;i<t;i++)
printf("%s\n",s2[i]);
return 0;
}
| 9 |
4,463 |
struct patient {
int order;
int age;
char id[10];
};
int cmp(const void *a, const void *b) {
const struct patient *pa = (const struct patient *) a;
const struct patient *pb = (const struct patient *) b;
if ((pa->age >= 60) && (pb->age < 60)) {
return -1;
}
else if ((pa->age < 60) && (pb->age >= 60)) {
return 1;
}
else if ((pa->age >= 60) && (pa->age != pb->age)) {
return pb->age - pa->age;
}
else {
return pa->order - pb->order;
}
}
int main() {
int i, num;
struct patient pat[100];
scanf("%d", &num);
for (i = 0; i < num; ++i) {
pat[i].order = i;
scanf("%s %d", pat[i].id, &(pat[i].age));
}
qsort(pat, num, sizeof(struct patient), cmp);
for (i = 0; i < num; ++i) {
printf("%s\n", pat[i].id);
}
}
| 9 |
4,464 | main()
{
int i,n,a[100],j;
struct patient
{
char id[10];
int age;
}
s[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s%d",s[i].id,&s[i].age);
}
while (1)
{
int max=0;
for (i=0;i<n;i++)
{
if (s[i].age>s[max].age)
max=i;
}
if (s[max].age>=60)
{
printf("%s\n",s[max].id);
s[max].age=0;
}
else break;
}
for (i=0;i<n;i++)
if (s[i].age>0)
printf("%s\n",s[i].id);
}
| 9 |
4,465 | struct pa
{
char num[10];
int age;
}p[105],t,a[105];
int main()
{
int i,k,n,c,d;
scanf("%d",&n);
k=0;
for(i=0;i+k<n;)
{
scanf("%s%d",p[i].num,&p[i].age);
if(p[i].age>=60) {a[k]=p[i];k++;}
else i++;
}
for(c=0;c<k-1;c++)
{
for(d=0;d<k-1;d++)
{
if(a[d].age<a[d+1].age){t=a[d];a[d]=a[d+1];a[d+1]=t;}
}
}
if(k>=0){k--;
for(c=0;c<=k;c++) printf("%s\n",a[c].num);}
if(i>=0){i--;
for(d=0;d<=i;d++) printf("%s\n",p[d].num);}
return 0;
}
| 9 |
4,466 | struct patient
{
char id[10];
int age;
struct patient *next;
};
int n;
struct patient *creat(int num) /*????*/
{
struct patient *head,*p1,*p2;
n=0;
p1=p2=(struct patient *)malloc(sizeof(struct patient));
scanf("%s %d",p1->id,&p1->age);
head=NULL;
while(n<(num-1))
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct patient *)malloc(sizeof(struct patient));
scanf("%s %d",p1->id,&p1->age);
}
p2->next=p1;
p1->next=NULL;
return(head);
}
struct patient *old(struct patient *head) /*??????????????old???????????60?????????*/
{
struct patient *old,*p1,*p2,*p;
n=0;
p=head;
p1=p2=(struct patient *)malloc(sizeof(struct patient));
old=NULL;
while(p!=NULL)
{
if((n==0)&&(p->age>=60))
{
strcpy(p1->id,"");
strcpy(p1->id,p->id);
p1->age=p->age;
old=p1;
p2=p1; /*?????????????????*/
n=1; /*?????????????????*/
}
else if(p->age>=60)
{
strcpy(p1->id,"");
strcpy(p1->id,p->id);
p1->age=p->age;
p2->next=p1;
p2=p1; /*?????????????p2=p1???????*/
}
p1=(struct patient *)malloc(sizeof(struct patient));
p=p->next;
}
p2->next=NULL;
return(old);
}
struct patient *sort(struct patient *head) /*?????????????????????????????????????*/
{
struct patient head0,end0;
struct patient *p0,*p1,*p2,*p;
head0.next=head;
p=head;
while(p->next!=NULL)
p=p->next;
p=p->next=&end0;
while(p!=head0.next) /*????????????????p!=head,????p!=head0.next*/
{
p0=&head0;
p1=p0->next;
p2=p1->next;
while(p2!=p)
{
if((p1->age)<(p2->age))
{
p0->next=p2;
p1->next=p2->next;
p2->next=p1;
p0=p2;
p2=p1->next;
}
else
{
p0=p1;
p1=p2;
p2=p2->next;
}
}
p=p1;
}
while(p->next!=&end0)
p=p->next;
p->next=NULL;
return(p1);
}
void print2(struct patient *head) /*??????????????60????id*/
{
struct patient *p;
p=head;
while(p!=NULL)
{
if(p->age<60) printf("%s\n",p->id),p=p->next;
else p=p->next;
}
}
void print1(struct patient *head) /*???????????????????????????id*/
{
struct patient *p;
p=head;
while(p!=NULL)
{
printf("%s\n",p->id);
p=p->next;
}
}
void main()
{
struct patient *creat(int num);
struct patient *old(struct patient *head);
struct patient *sort(struct patient *head);
void print1(struct patient *head);
void print2(struct patient *head);
struct patient *head,*oldp,*sortold; /*???????????????*sortold?????????????????*/
int num;
scanf("%d",&num);
head=creat(num);
oldp=old(head);
sortold=sort(oldp);
print1(sortold);
print2(head);
} | 9 |
4,467 | void main()
{
int n,i,j;
struct
{
char ID[10];
int a;
int p;
} s[100],t;
/* char ID[100][10];
int a[100];
int p[100];*/
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%d",s[i].ID,&s[i].a);
s[i].p=i;
}
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if( ((s[i].a<60)&&(s[j].a>=60)) || ((s[i].a>=60)&&(s[j].a>=60)&&(s[i].a<s[j].a)) || ((s[i].a>=60)&&(s[j].a>=60)&&(s[i].a==s[j].a)&&(s[i].p>s[j].p)) || ((s[i].a<60)&&(s[j].a<60)&&(s[i].p>s[j].p)))
{
t=s[i];
s[i]=s[j];
s[j]=t;
}
for(i=1;i<=n;i++)
printf("%s\n",s[i].ID);
} | 9 |
4,468 | struct patient
{
char id[11];
int age;
}pa[101],que[101],tran;
int main(int argc, char* argv[])
{
int i,n,j,old=0;
scanf("%d",&n);
j=1;
for(i=1;i<=n;i++){
scanf("%s %d",&pa[i].id,&pa[i].age);
if(pa[i].age>=60){
que[j]=pa[i];
old+=1;
j++;
}
}
for(i=1;i<=old-1;i++){
for(j=1;j<=old-i;j++){
if(que[j].age<que[j+1].age){
tran=que[j];
que[j]=que[j+1];
que[j+1]=tran;
}
}
}
j=old+1;
for(i=1;i<=n;i++){
if(pa[i].age<60){
que[j]=pa[i];
j++;
}
}
for(i=1;i<=n;i++){
printf("%s\n",que[i].id);
}
return 0;
}
| 9 |
4,469 | struct pat
{
char id[10];
int age;
}pat[100];
main()
{
int n,a[200],j,i;
scanf("%d",&n);
for(j=0;j<150;j++) a[j]=0;
for( i=0;i<n;i++)
{
scanf("%s %d",pat[i].id,&pat[i].age);
for(j=1;j<150;j++)
{
if(j==pat[i].age) a[j]++;
}
}
for(j=150;j>=60;j--)
{
if(a[j]==0) continue;
for(i=0;i<n;i++)
{
if(j==pat[i].age) printf("%s\n",pat[i].id);
}
}
for(i=0;i<n;i++)
if(pat[i].age<60) printf("%s\n",pat[i].id);
getchar();
getchar();
} | 9 |
4,470 | int main(int argc, char *argv[])
{
struct fy{
char a[12];
int k;
int s;
struct fy *p;
}x[100],*head;
int n,i,j,l,kk,ss;
char aa[12];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",x[i].a,&x[i].k);
x[i].s=x[i].k>=60?1:0;
x[i].p=&x[i+1];
}
head=&x[0];
x[n-1].p=NULL;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(x[i].s==1&&x[j].s==1)
{
if(x[i].k<x[j].k)
{
kk=x[j].k;
ss=x[j].s;
strcpy(aa,x[j].a);
for(l=j;l>i;l--)
{
x[l].k=x[l-1].k;
x[l].s=x[l-1].s;
strcpy(x[l].a,x[l-1].a);
}
x[i].k=kk;
x[i].s=ss;
strcpy(x[i].a,aa);
}
}
}
if(x[i].s==1)
printf("%s\n",x[i].a);
}
while(head!=NULL)
{
if(head->s==0)
printf("%s\n",head->a);
head=head->p;
}
return 0;
}
| 9 |
4,471 |
int main(){
char id[100][10],old[100][10],yog[100][10];
int n,i,m=0,l=0,age[100],oag[100],yag[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",id[i]);
scanf("%d",&(age[i]));
if(age[i]>=60){
oag[m]=age[i];
strcpy(old[m],id[i]);
m++;
}else{
yag[l]=age[i];
strcpy(yog[l],id[i]);
l++;
}
}
char e_id[1][10];
int e_age,k;
for(k=1;k<=m;k++){
for(i=0;i<m-k;i++){
if(oag[i]<oag[i+1]){
strcpy(e_id[0],old[i]);
strcpy(old[i],old[i+1]);
strcpy(old[i+1],e_id[0]);
e_age=oag[i];
oag[i]=oag[i+1];
oag[i+1]=e_age;
}
}
}
for(i=0;i<m;i++){
puts(old[i]);
}
for(i=0;i<l;i++){
puts(yog[i]);
}
return 0;
}
| 9 |
4,472 |
struct queue
{
char ID[11];
int age;
struct number * next;
};
int r=1;
struct queue * AppendNewNode(int n);
void main()
{
int n,i,j,a[100]={0},temp;
char temp_2[11]={""};
struct queue *head, *p,*pf,*temp_1;
scanf("%ld",&n);
head=AppendNewNode(n);
p=head;
while(p!=NULL)
{
scanf("%s %d\n",&p->ID,&p->age);
p=p->next;
}
p=head;
// p=p->next;
// printf("%d\n",p->age);
for(i=0;i<n;i++)
{
a[i]=p->age;
p=p->next;
}
//printf("%d\n",a[1]);
p=head;
pf=head;
for(i=0;i<n;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j+1]>=60&&a[j]<a[j+1]) {
temp=a[j];a[j]=a[j+1];a[j+1]=temp;
pf=p->next;temp=p->age;p->age=pf->age;pf->age=temp;strcpy(temp_2,p->ID);strcpy(p->ID,pf->ID);strcpy(pf->ID,temp_2);p=p->next;
}
else {p=p->next;}
}
p=head;
}
p=head;
// printf("%d\n",p->age);
while(p!=NULL)
{
printf("%s\n",p->ID);
p=p->next;
}
}
struct queue * AppendNewNode(int n)
{
struct queue *head=NULL, *newNode, *thisNode;
do{
newNode=(struct number *) malloc(sizeof(struct queue));
if(r==1)
{
head=newNode;
thisNode=head;
}
else
thisNode->next=newNode;
if(r<=n)
{
thisNode=newNode;
r++;
}
}while(r<=n);
thisNode->next=NULL;
return(head);
} | 9 |
4,473 | struct bin
{
char num[10];
int age;
}t,b[100],c[100],a[100];
void main()
{
int n,i,j=0,k=0,p,q;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",a[i].num,&a[i].age);
if(a[i].age>=60)
{
b[j]=a[i];
j++;
}
p=j;
if(a[i].age<60)
{
c[k]=a[i];
k++;
}
q=k;
}
for(j=1;j<p;j++)
for(i=0;i<p-j;i++)
{
if(b[i].age<b[i+1].age)
{
t=b[i];
b[i]=b[i+1];
b[i+1]=t;
}
}
for(i=0;i<p;i++)
printf("%s\n",b[i].num);
for(i=0;i<q;i++)
printf("%s\n",c[i].num);
} | 9 |
4,474 | long exp(int a)
{
int def1,expo=1;
for(def1=1;def1<=a;def1++)
expo=expo*10;
return expo;
}
main()
{
int n,i,j,comp,idlenth,sw=0,test=0,advnum=0,arradv=1,arrdis,cache;
int bubble,maxage,maxid,maxnum,maxright,print;
scanf("%d",&n);
int age[n+1],adv[n+1],ord[n+1],alrscan[n+1],numord[n+1],right[n+1];
getchar();
long id[n+1];
for(i=1;i<=n;i++)
{
ord[i]=numord[i]=i;
alrscan[i]=0;
right[i]=0;
}
for(i=1;i<=n;i++)
scanf("%d %d",&id[i],&age[i]);
for(i=1;i<=n;i++)
{
if(age[i]>=60)
{
adv[i]=1;
right[i]+=age[i]*1000;
right[i]+=1000000;
advnum++;
}
else
adv[i]=0;
}
for(i=1;i<=n;i++)
{
right[i]+=n-i+1;
alrscan[i]=0;
}
for(i=1;i<=n;i++)
{
maxright=0;
for(j=1;j<=n;j++)
{
if(right[j]>maxright&&alrscan[j]==0)
{maxright=right[j];
maxnum=j;}
}
ord[i]=maxnum;
alrscan[maxnum]=1;
}
for(idlenth=1;test!=n;idlenth++)
{
test=0;
for(j=1;j<=n;j++)
if(id[j]<exp(idlenth-1))
test++;
}
idlenth--;
for(i=1;i<=n;i++)
{
for(j=1;j<=idlenth;j++)
{
if(id[ord[i]]<exp(idlenth-j-1))
printf("0");
}
printf("%d\n",id[ord[i]]);
//printf("%d %d %d\n",id[ord[i]],numord[ord[i]],right[ord[i]]);
}
/*arrdis=advnum+1;
for(i=1;i<=n;i++)
{
if(adv[i]==1)
{
ord[arradv]=i;
arradv++;
}
else
{
ord[arrdis]=i;
arrdis++;
}
}
//printf("adv=%d,dis=%d",arradv,arrdis);
for(bubble=advnum;bubble>=1;bubble--);
{
for(i=1;i<bubble;i++)
{
if(age[ord[i+1]]>age[ord[i]])
{
cache=ord[i+1];
ord[i+1]=ord[i];
ord[i]=cache;
}
}
}
for(bubble=n;bubble>=advnum+1;bubble--);
{
for(i=advnum+1;i<bubble;i++)
{
if(id[ord[i+1]]>id[ord[i]])
{
cache=ord[i+1];
ord[i+1]=ord[i];
ord[i]=cache;
}
}
}
for(idlenth=1;test!=n;idlenth++)
{
test=0;
for(j=1;j<=n;j++)
if(id[j]<exp(idlenth-1))
test++;
}
idlenth--;
for(i=1;i<=n;i++)
{
for(j=1;j<=idlenth;j++)
{
if(id[ord[i]]<exp(idlenth-j-1))
printf("0");
}
printf("%d\n",id[ord[i]]);
}*/
getchar();
getchar();
return 0;
}
| 9 |
4,475 | int main(){
int n;
scanf("%d",&n);
struct xinxi{
char id[10];
int year;
}xinxi[100],b[100],p;
int i,j,k,a=0,c=0;
for(i=0;i<n;i++){
scanf("%s %d",xinxi[i].id,&(xinxi[i].year));
}
for(i=0;i<n;i++){
if((xinxi[i].year)>=60){
b[a]=xinxi[i];
a++;
}
}
for(k=1;k<a;k++){
for(j=0;j<a-k;j++){
if(b[j].year<b[j+1].year){
p=b[j+1];
b[j+1]=b[j];
b[j]=p;
}
}
}
for(j=0;j<a;j++){
printf("%s\n",b[j].id);
}
for(i=0;i<n;i++){
if((xinxi[i].year)<60){
printf("%s\n",xinxi[i].id);
}
}
return 0;
} | 9 |
4,476 |
struct patient
{
char ID[11];
int age;
}p[1000];
int main()
{
int n,i,k,j,l,a=0,b=0,e;
int sz1[1000],sz2[1000];
char zfc1[1000][11],zfc2[1000][11],f[11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&p[i].ID);
scanf(" %d",&p[i].age);
}
for(i=0,j=0,l=0;i<n;i++)
{
if(p[i].age>=60)
{
a++;
sz1[j]=p[i].age;
strcpy(zfc1[j],p[i].ID);
j++;
}
else
{
b++;
sz2[l]=p[i].age;
strcpy(zfc2[l],p[i].ID);
l++;
}
}
for(k=0;k<n;k++)
{
for(j=n-1;j>=k;j--)
{
if(sz1[j+1]>sz1[j])
{
e=sz1[j];
sz1[j]=sz1[j+1];
sz1[j+1]=e;
strcpy(f,zfc1[j]);
strcpy(zfc1[j],zfc1[j+1]);
strcpy(zfc1[j+1],f);
}
}
}
for(j=0;j<a;j++)
{
printf("%s\n",zfc1[j]);
}
for(l=0;l<b;l++)
{
printf("%s\n",zfc2[l]);
}
return 0;
} | 9 |
4,477 |
struct patient
{
char id[10];
int age;
struct patient *next;
};
struct patient *creat(int n)
{
struct patient *head,*p1,*p2;
int i;
p1=(struct patient *)malloc(len);
scanf("%s %d",p1->id,&p1->age);
p1->next=NULL;
head=p1;
p2=p1;i=1;
do
{
p1=(struct patient *)malloc(len);
scanf("%s %d",p1->id,&p1->age);
p1->next=NULL;
i++;
p2->next=p1;
p2=p1;
}while(i<n);
return(head);
}
struct patient *tiao(struct patient *head,int n)
{
struct patient *p1;
int t,i;
char s[10];
p1=head;
for(i=0;i<n;i++)
{
p1=head;
do
{
if(p1->age<(p1->next)->age&&(p1->next)->age>=60)
{
t=p1->age;
p1->age=(p1->next)->age;
(p1->next)->age=t;
strcpy(s,p1->id);
strcpy(p1->id,(p1->next)->id);
strcpy((p1->next)->id,s);
}
p1=p1->next;
}while(p1->next);
}
return(head);
}
void print(struct patient *head)
{
struct patient *p;
p=head;
do
{
printf("%s\n",p->id);
p=p->next;
}while(p);
}
void main()
{
struct patient *head;
int n;
scanf("%d",&n);
head=creat(n);
head=tiao(head,n);
print(head);
}
| 9 |
4,478 | typedef struct Node
{
char ID[11];
int age;
struct Node *next;
}node;
node *creat(int n)
{
node *p1,*p2,*head;
int i;
p1=p2=(node *)malloc(sizeof(node));
head=p1;
for(i=0;i<n;i++)
{
p2=p1;
scanf("%s%d",p1->ID,&p1->age);
p1=(node *)malloc(sizeof(node));
p2->next=p1;
}
p2->next=NULL;
return(head);
}
void sort(int x,char *a,node *head)
{
node *pre=head,*p=pre->next,*s;
s=(node *)malloc(sizeof(node));
s->age=x;
strcpy(s->ID,a);
s->next=NULL;
while(p!=NULL&&x<=p->age)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
void print(node *head)
{
node *p;
p=head;
while(p!=NULL)
{
printf("%s\n",p->ID);
p=p->next;
}
}
void main()
{
int n;
node *head1,*head2,*p;
scanf("%d",&n);
head1=creat(n);
head2=(node *)malloc(sizeof(node));
strcpy(head2->ID," ");
head2->next=NULL;
p=head1;
while(p!=NULL)
{
if(p->age>=60)
sort(p->age,p->ID,head2);
p=p->next;
}
head2=head2->next;
print(head2);
p=head1;
while(p!=NULL)
{
if(p->age<60)
printf("%s\n",p->ID);
p=p->next;
}
}
| 9 |
4,479 | int main(){
int i,n,j,k,e,m;
int a[100];
char b[100][10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",&b[i],&a[i]);
}
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
if(a[j]>=60&&a[j]>a[j-1]){
m=a[j];
a[j]=a[j-1];
a[j-1]=m;
char t[10];
strcpy(t,b[j]);
strcpy(b[j],b[j-1]);
strcpy(b[j-1],t);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",b[i]);
}
return 0;
} | 9 |
4,480 | int main()
{
int n;
int i,j;
char a[100][10];
int x[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",a[i],&x[i]);
for (j=100;j>=60;j--)
{
for(i=0;i<n;i++)
{
if(x[i]==j)
printf("%s\n",a[i]);
}
}
for(i=0;i<n;i++)
{
if(x[i]<60)
printf("%s\n",a[i]);
}
getchar();
getchar();
}
| 9 |
4,481 | void main()
{
struct p
{
char num[11];
int age;
};
struct p c[101];
int n,i,t=0,s,h,l=0;
int a[100],b[100],d[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",c[i].num,&c[i].age);
for(i=0;i<n;i++)
{
if(c[i].age>=60)
{
a[t]=c[i].age;
c[i].age=0;
b[t]=i;
t++;
}
}
if(t>0)
{
leap:
s=a[0];
h=0;
for(i=0;i<t;i++)
{
if(a[i]>s)
{
s=a[i];
h=i;
}
}
printf("%s\n",c[b[h]].num);
l++;
a[h]=0;
if(l<t)
goto leap;
}
for(i=0;i<n;i++)
{
if(c[i].age!=0)
printf("%s\n",c[i].num);
}
} | 9 |
4,482 | int main(){
int n,i,j,k;
scanf("%d",&n);
char id[100][10];
int old[100];
for(i=0;i<n;i++){
scanf("%s",id[i]);
scanf("%d",&old[i]);
}
int e;
char s[100][10];
for( j=1;j<n;j++){
for( k=0;k<n-j;k++){
if(old[k]<old[k+1]&&old[k+1]>=60){
e=old[k+1];
old[k+1]=old[k];
old[k]=e;
strcpy(s[k],id[k+1]);
strcpy(id[k+1],id[k]);
strcpy(id[k],s[k]);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",id[i]);
}
return 0;
}
| 9 |
4,483 | struct student{
char num[20];
int age;
struct student *next;
};
int n,i;
struct student *create()
{
struct student *head;
struct student *p1,*p2;
head=NULL;
scanf("%d",&i);
n=0;
p1=p2=(struct student *)malloc(len);
scanf("%s %d",p1->num,&p1->age);
while(n!=i-1)
{
n++;
if(n==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(len);
scanf("%s %d",p1->num,&p1->age);
}
p2->next=p1;
p1->next=NULL;
return(head);
}
void paixu(struct student *p){
struct student *p1,*p2;
char temp[20];
int temp2;
for(n=1;n<i;n++){
p2=p;
p1=p->next;
while(p1!=NULL){
if(p1->age>=60&&p2->age<60){
strcpy(temp,p1->num);
strcpy(p1->num,p2->num);
strcpy(p2->num,temp);
temp2=p1-> age;
p1->age=p2-> age;
p2->age=temp2;
}
else if(p1->age>p2->age&&p2->age>=60){
strcpy(temp,p1->num);
strcpy(p1->num,p2->num);
strcpy(p2->num,temp);
temp2=p1-> age;
p1->age=p2-> age;
p2->age=temp2;
}
p2=p1;
p1=p1->next;
}
}
}
void print(struct student *p)
{
while(p!=NULL)
{
printf("%s",p->num);
p=p->next;
if(p!=NULL)
printf("\n");
}
}
void main()
{
struct student *p;
p=create();
paixu(p);
print(p);
} | 9 |
4,484 | struct pat
{
char num[11];
int age;
struct pat *next;
};
void main()
{
int n,i;
scanf("%d",&n);
struct pat *head,*p1,*p2,*pre;
p1=(struct pat *)malloc(sizeof(struct pat));
scanf("%s %d",p1->num,&p1->age);
head=p1;
p1->next=NULL;
for(i=1;i<n;i++)
{
p1=(struct pat *)malloc(sizeof(struct pat));
scanf("%s %d",p1->num,&p1->age);
if(p1->age<60)
{
p2=head;
while(p2)
{
if(p2->next==NULL)
{
p2->next=p1;p1->next=NULL;break;
}
p2=p2->next;
}
}
else if(p1->age>=60)
{p2=head;
while(p2)
{
if(p2==head&&p1->age>p2->age)
{
head=p1;p1->next=p2;break;
}
else if(p1->age>p2->age)
{
pre->next=p1;p1->next=p2;break;
}
else if(p2->next==NULL)
{
p2->next=p1;p1->next=NULL;break;
}
else {pre=p2;p2=p2->next;}
}
}
}
p1=head;
while(p1)
{
printf("%s\n",p1->num);
p1=p1->next;
}
}
| 9 |
4,485 | void main(int argc, char* argv[])
{
struct student
{
char ID[10];
int age;
} stu[100],stud[100];
int a[100],b[100],i,c,j,x,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&stu[i].ID);
scanf("%d",&stu[i].age);
}
int k=0;
for(i=0;i<n;i++){
if(stu[i].age>=60){a[k]=stu[i].age;b[k]=i;k++;}
}
for(i=0;i<k;i++){
for(j=0;j<k;j++){
if(a[j]<a[j+1]){x=a[j];a[j]=a[j+1];a[j+1]=x;x=b[j];b[j]=b[j+1];b[j+1]=x;}
}
}
for(i=0;i<k;i++){
c=b[i];
printf("%s\n",stu[c].ID);
}
for(i=0;i<n;i++){
if(stu[i].age<60){printf("%s\n",stu[i].ID);}
}
} | 9 |
4,486 | struct ill
{
char id[100];
int age;
struct ill *next;
};
void main()
{
struct ill *creat(int x);
struct ill *p,*head;
char *w[1000];
char *temp1;
int n,i,j=0,k,temp;
int *q;
scanf("%d",&n);
p=creat(n);
head=p;
q=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
if((*p).age>=60) {*(q+j)=(*p).age;*(w+j)=(*p).id;j++;}
p=(*p).next;
}
k=j;
loop:for(i=0;i<j-1;i++)
{
if(*(q+i)<*(q+i+1))
{
temp=*(q+i);*(q+i)=*(q+i+1);*(q+i+1)=temp;
temp1=*(w+i);*(w+i)=*(w+i+1);*(w+i+1)=temp1;
}
}
for(i=0;i<j-1;i++)
{
if(*(q+i)<*(q+i+1)) goto loop;
}
for(i=0;i<j;i++)
{printf("%s\n",*(w+i));}
p=head;
for(i=0;i<n;i++)
{
if((*p).age>=60) goto lop;
else
{printf("%s\n",(*p).id);}
lop:p=(*p).next;
}
}
struct ill *creat(int x)
{
struct ill *head,*p1,*p2;
int i;
p1=(struct ill *)malloc(sizeof(struct ill));
scanf("%s %d",(*p1).id,&(*p1).age);
p2=p1;
head=p1;
for(i=0;i<x;i++)
{
p1=(struct ill *)malloc(sizeof(struct ill));
scanf("%s %d",(*p1).id,&(*p1).age);
(*p2).next=p1;
p2=p1;
}
(*p2).next=NULL;
return(head);
} | 9 |
4,487 |
struct patient{
char ID[10];
int age;
struct patient *next;
};
struct patient *creat(int n)
{ int i;
struct patient *head;
struct patient *p1,*p2;
p2=p1=(struct patient *)malloc(LEN);
head=p1;
scanf("%s %d",p1->ID,&p1->age);
for(i=1;i<n;i++)
{
p1=(struct patient *)malloc(LEN);
scanf("%s %d",p1->ID,&p1->age);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
int main()
{
int i,j,n;
char a[10];
scanf("%d",&n);
struct patient *h,*q,*p;
h=creat(n);
for(i=0;i<n;i++)
for(q=h;q->next!=NULL;q=q->next)
if(q->next->age>=60&&q->next->age>q->age)
{
strcpy(a,q->ID);strcpy(q->ID,q->next->ID);strcpy(q->next->ID,a);
j=q->age;q->age=q->next->age;q->next->age=j;
}
for(p=h;p!=NULL;p=p->next)
printf("%s\n",p->ID);
}
| 9 |
4,488 | struct patient
{
char ID[15];
int age;
struct patient *next;
};
int n;
struct patient *create()
{
struct patient *head,*p1,*p2;
p1=(struct patient*)malloc(LEN);
scanf("%s %d",p1->ID,&p1->age);
head=p1;
p2=p1;
p1->next=NULL;
int i=1;
do
{
if(i==n)break;
p1=(struct patient*)malloc(LEN);
scanf("%s %d",p1->ID,&p1->age);
p2->next=p1;
p2=p1;
p1->next=NULL;
i++;
}while(1);
return(head);
}
struct patient *findmax(struct patient *head)
{
struct patient *max;
struct patient *p;
max = head;
p=head->next;
while(p)
{
if(p->age>max->age)
max=p;
p=p->next;
}
return(max);
}
struct patient *del(struct patient *head,struct patient *needdel)
{
struct patient *p,*ppre;
printf("%s\n",needdel->ID);
p=head;
while(p&&needdel!=p)
{ppre=p;
p=p->next;}
if(p==head)
{
head=p->next;
free(p);
}
else if (p)
{
ppre->next=p->next;
free(p);
}
return(head);
}
void print(struct patient *head)
{
struct patient *p;
p=head;
while(p)
{
printf("%s\n",p->ID);
p=p->next;
}
}
int main()
{
scanf("%d",&n);
struct patient *head,*p;
head=create();
p = head;
do
{
p = findmax(head);
if(p->age<60)break;
head=del(head,p);
}while(1);
print(head);
}
| 9 |
4,489 | main ()
{
int a,b,c,d,i,j,l,m;
scanf("%d",&a);
int f[a];
int h[a];
int n[a];
int k[a];
int o[a];
char g[a][10];
for (i=0;i<a;i++)
{
scanf("%s %d",g[i],&f[i]);
}
j=0;
for (i=0;i<a;i++)
{
if (f[i]>=60)
{
h[j]=f[i];
k[j]=i;
j++;
}
}
for (i=0;i<j;i++)
{
n[i]=i;
}
for (i=0;i<j;i++)
{
o[i]=i;
}
for (i=0;i<j;i++)
{
for (l=i+1;l<j;l++)
{
if (h[n[i]]<h[n[l]])
{
m=n[i];
n[i]=n[l];
n[l]=m;
}
else if (h[n[i]]==h[n[l]] && o[n[i]]>o[n[l]])
{
m=n[i];
n[i]=n[l];
n[l]=m;
}
}
}
for (i=0;i<j;i++)
{
printf("%s\n",g[k[n[i]]]);
}
for (i=0;i<a;i++)
{
if (f[i]<60)
printf("%s\n",g[i]);
}
getchar ();
getchar ();
}
| 9 |
4,490 |
int main()
{
int n;
struct ren
{
char id[10];
int age;
} p[100];
struct ren t;
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",p[i].id,&p[i].age);
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(p[j].age<p[j+1].age && p[j+1].age>=60)
{
t=p[j];
p[j]=p[j+1];
p[j+1]=t;
}
}
}
for(i=0;i<n;i++)
printf("%s\n",p[i].id);
return 0;
}
| 9 |
4,491 | int main()
{
int num,i,j,l;//num??????
scanf("%d",&num);
struct inf //?????????ID
{
char str[10];
int age;
}infs[101];
struct f
{
char *p1;
int m1;
}old[101];//??????????
for(i=0;i<num;i++)
{
scanf("%s %d",infs[i].str,&infs[i].age);
}
for(i=0,j=0;i<num;i++)//????????????????????????????
if(infs[i].age>=60)
{old[j].m1=infs[i].age;
old[j].p1=infs[i].str;//??????????ID
j++;}
int end=j;
char *k;
for(i=0;i<end-1;i++)//?????????????????????
{
for(j=0;j+1<end-i;j++)
if(old[j].m1<old[j+1].m1)
{
l=old[j].m1;
old[j].m1=old[j+1].m1;
old[j+1].m1=l;
k=old[j].p1;
old[j].p1=old[1+j].p1;
old[1+j].p1=k;
}
}
for(i=0;i<end;i++)//??????
printf("%s\n",old[i].p1);
for(i=0;i<num;i++)
if(infs[i].age<60)//????????
printf("%s\n",infs[i].str);
}
| 9 |
4,492 | main()
{
int i,j,k,l,m,n;
char id[200][200];
int age[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",id[i],&age[i]);
}
for(j=200;j>=60;j--)
{
for(i=0;i<n;i++)
{ if(age[i]==j)
printf("%s\n",id[i]);}
}
for(i=0;i<n;i++)
if(age[i]<60)
printf("%s\n",id[i]);
getchar();
getchar();
}
| 9 |
4,493 | int main()
{
char id[100][10];
int o[100],n,i,j,s[100],b=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",id[i]);
scanf("%d",&o[i]);
}
for(i=0;i<n;i++)
{
if(o[i]>=60)
{
s[b]=o[i];
b++;
}
}
for(i=0;i<b;i++)
{
for(j=b-1;j>i;j--)
{
if(s[j]>s[j-1])
{
t=s[j];
s[j]=s[j-1];
s[j-1]=t;
}
}
}
for(i=0;i<b-1;i++)
{
if(s[i]==s[i+1])
s[i]=-1;
}
for(i=0;i<b;i++)
{
for(j=0;j<n;j++)
{
if(o[j]==s[i])
printf("%s\n",id[j]);
}
}
for(i=0;i<n;i++)
{
if(o[i]<60)
printf("%s\n",id[i]);
}
return 0;
}
| 9 |
4,494 | int main() {
/*------------??------------*/
//?????
int m,n;
// float f,f1;
// double d,d1;
//????
int a[101],b[101];
// int a[101][2000];
//?????
// char c[6000];
char c[101][11],d[101][11];
// int len;
//????
// int r;
// float r;
// double r;
// int r[501];
// int r[200][20];
// char r[5010];
// char r[1010][51];
//????
int i,j,k;
//????
int ni,nj,nk;
// double di,dj,dk;
// float fi,fj,fk;
char ci[11],cj[11],ck[11];
/*
?? - ????
??
????????????????????????????????????
1. ??>=60??????????????
2. ?????????????????????????????????
3. ??????<60??????????????
????
?1????????100?????????????
??????????????????????????
?????????10?????????ID??????ID??????????????????
????
?????????????????ID
????
5
021075 40
004003 15
010158 67
021033 75
102012 30
????
021033
010158
021075
004003
102012
*/
/*------------??/??------------*/
// scanf("% ",& );
// len=strlen(c);
scanf("%d",&n);
for(i=1;i<=n;i++) {
scanf("%s",c[i]);
strcpy(d[i],c[i]);
scanf("%d",&a[i]);
b[i]=a[i];
}
/*------------??------------*/
// for(i=1;i<=n;i++) {
// }
for(i=1;i<=n-1;i++) {
for(j=1;j<=n-i;j++) {
if(a[j]<a[j+1]) {
ni=a[j+1];
a[j+1]=a[j];
a[j]=ni;
strcpy(ci,c[j+1]);
strcpy(c[j+1],c[j]);
strcpy(c[j],ci);
}
}
}
/*------------??------------*/
// printf("% \n", );
// printf(" \n");
for(i=1;i<=n;i++) {
if(a[i]>=60) {
printf("%s\n",c[i]);
}
}
for(i=1;i<=n;i++) {
if(b[i]<60) {
printf("%s\n",d[i]);
}
}
/*------------??------------*/
return 0;
}
| 9 |
4,495 | struct Node;
typedef struct Node *pNode;
struct Node
{
int x;
char id[20];
pNode next;
};
pNode create()/*??head*/
{
pNode p;
p=(pNode)malloc(sizeof(struct Node));
p->next=NULL;
return p;
}
void sort(pNode head,int n)/*head???????n???*/
{
pNode p=NULL,q=NULL,s=NULL;
int i;
for (i=1;i<=n;i++)
{
s=(pNode)malloc(sizeof(struct Node));
s->next=NULL;
scanf("%s %d",&s->id,&s->x);
if (s->x<60)
{
p=head;
while (p->next)
p=p->next;
p->next=s;
}
else
{
q=head;
p=head->next;
while (p)
{
if (p->x<s->x)
break;
q=p;
p=p->next;
}
q->next=s;
s->next=p;
}
}
}
void outputdata(pNode p)/*??head*/
{
p=p->next;
while(p->next)
{
printf("%s\n",p->id);
p=p->next;
}
printf("%s\n",p->id);
}
int main()
{
pNode head;
int n;
head=create();
scanf("%d",&n);
sort(head,n);
outputdata(head);
return 0;
}
| 9 |
4,496 | struct patient
{
char id[10];
int age;
struct patient *next;
struct patient *pre;
};
void main()
{
void f(struct patient **head);
struct patient *head,*p1,*p2;
int n,i;
scanf("%d",&n);
p1=(struct patient *)malloc(sizeof(struct patient));
p2=p1;head=p1;p1->pre=NULL;
scanf("%s %d",p1->id,&p1->age);
for(i=0;i<n-1;i++)
{
p1=(struct patient *)malloc(sizeof(struct patient));
p2->next=p1;p1->pre=p2;p2=p1;
scanf("%s %d",p1->id,&p1->age);
}
p2->next=NULL;
f(&head);
for(p1=head;p1!=NULL;p1=p1->next)printf("%s\n",p1->id);
}
void f(struct patient **head)
{
struct patient *p1,*p2,*p;
for(p1=(*head)->next;p1!=NULL;p1=p1->next)
if(p1->age>=60)
{
p=p1->next;
p1->pre->next=p1->next;
if(p1->next!=NULL)p1->next->pre=p1->pre;
for(p2=*head;p2->next!=NULL;p2=p2->next)
if(p1->age>p2->age)
{
if(p2->pre!=NULL)p2->pre->next=p1;else *head=p1;
p1->pre=p2->pre;p2->pre=p1;p1->next=p2;
break;
}
if(p2->next==NULL)
{
if(p1->age>p2->age)
{
if(p2->pre!=NULL)p2->pre->next=p1;else *head=p1;
p1->pre=p2->pre;p2->pre=p1;p1->next=p2;
}
else {p2->next=p1;p1->pre=p2;p1->next=NULL;}
}
if(p!=NULL) p1=p->pre;
else break;
}
}
| 9 |
4,497 | int main()
{
struct patient
{
char id[10];
int age;
} a[100],m,k;
int i,j,n,num=0;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%s %d",a[i].id,&a[i].age);
for (i=0;i<n;i++)
{
if(a[i].age>=60)
{
num++;
m=a[i];
for (j=i;j>0;j--)
a[j]=a[j-1];
a[0]=m;
}
}
for (i=0;i<num;i++)
{
for (j=i+1;j<num;j++)
{
if (a[i].age<=a[j].age)
{
k=a[i];
a[i]=a[j];
a[j]=k;
}
}
}
for (i=0;i<n;i++)
printf("%s\n",a[i].id);
return 0;
} | 9 |
4,498 | struct st
{
char s[11];
int n;
struct st *next;
};
struct st *creat(int m)
{
struct st *head,*p1,*p2;
int i;
for(i=0;i<m;i++)
{
p1=(struct st *)malloc(len);
if(i==0)head=p1;
else p2->next=p1;
scanf("%s %d",p1->s,&p1->n);
p2=p1;
}
p2->next=NULL;
return(head);
}
void line(struct st *head,int m)
{
struct st *p,*p1,*p2;
p=head;
int i,j,t;
for(i=0;i<m;i++)
{
p1=p;
p2=p1->next;
for(j=1;j<m;j++)
{
char ss[11]={'\0'};
if(p1->n>=60)
{
if(p2->n>p1->n)
{
strcpy(ss,p1->s);
strcpy(p1->s,p2->s);
strcpy(p2->s,ss);
t=p1->n;
p1->n=p2->n;
p2->n=t;
}
}
else
{
if(p2->n>=60)
{
strcpy(ss,p1->s);
strcpy(p1->s,p2->s);
strcpy(p2->s,ss);
t=p1->n;
p1->n=p2->n;
p2->n=t;
}
}
p1=p1->next;
p2=p2->next;
}
}
for(i=0;i<m;i++)
{
printf("%s\n",p->s);
p=p->next;
}
}
void main()
{
struct st *p;
void line(struct st *head,int m);
struct st *creat(int m);
int m,i,j;
scanf("%d",&m);
p=creat(m);
line(p,m);
}
| 9 |
4,499 | struct patient
{
char id[10];
int old;
}pa[100];
void main()
{
int n,i,j=0,k=0,t;
struct patient pao[100],pay[100],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",pa[i].id,&pa[i].old);
for(i=0;i<n;i++)
{
if(pa[i].old>=60)
{
pao[j]=pa[i];
j++;
}
else
{
pay[k]=pa[i];
k++;
}
}
for(i=0;i<j-1;i++)
for(t=0;t<j-1-i;t++)
if(pao[t].old<pao[t+1].old)
{
temp=pao[t];
pao[t]=pao[t+1];
pao[t+1]=temp;
}
printf("%s",pao[0].id );
for(i=1;i<j;i++)
printf("\n%s",pao[i].id);
printf("\n%s",pay[0].id);
for(i=1;i<k;i++)
printf("\n%s",pay[i].id);
} | 9 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.