label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
9 | 4300 | void main()
{
struct people
{
char id[30];
int age;
}x[100],y[100],z;
int a,b,c,e,i,j=0,k=0,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",x[k].id,&x[k].age);
if(x[k].age>=60)
{
y[j].age=x[k].age;
strcpy(y[j].id,x[k].id);
j=j+1;
k=k-1;
}
k=k+1;
}
for(i=0;i<j;i++)
for(k=0;k<j-i-1;k++)
if(y[k].age<y[k+1].age)
{z=y[k+1];
y[k+1]=y[k];
y[k]=z;
}
for(i=0;i<j;i++)
printf("%s\n",y[i].id);
for(i=0;i<n-j;i++)
printf("%s\n",x[i].id);
} |
9 | 4301 |
int main(){
struct patient{
char id[11];
int age;
} patients[100],old[100],young[100],jh;
int n,i,j,d,k;
j=-1;
d=-1;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",patients[i].id,&patients[i].age);
}
for(i=0;i<n;i++){
if(patients[i].age>=60){
d++;
old[d]=patients[i];
}else{
j++;
young[j]=patients[i];
}
}
for(k=1;k<=d+1;k++){
for(i=0;i<d;i++){
if(old[i].age<old[i+1].age){
jh=old[i];
old[i]=old[i+1];
old[i+1]=jh;
}
}
}
for(i=0;i<=d;i++){
printf("%s\n",old[i].id);
}
for(i=0;i<=j;i++){
printf("%s\n",young[i].id);
}
return 0;
}
|
9 | 4302 | struct patient
{
char ID[10];
int age;
struct patient *next;
};
struct patient * insert(struct patient *head,struct patient *another)
{
struct patient *p0,*p1,*p2;
p1=head;
p0=another;
if(p0->age<60)
{
while(p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
p1->next=p0;
p0->next=NULL;
}
else
{
while(p1->age>=p0->age&&p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
if(p1->age>=p0->age)
{
p1->next=p0;
p0->next=NULL;
}
else
{
if(p1==head)
{
head=p0;
p0->next=p1;
}
else
{
p2->next=p0;
p0->next=p1;
}
}
}
return head;
}
void print(struct patient *head)
{
struct patient *p;
p=head;
while(p!=NULL)
{
printf("%s\n",p->ID);
p=p->next;
}
}
void main()
{
int n,i;
struct patient *head,*p;
scanf("%d",&n);
head=p=(struct patient *)malloc(len);
scanf("%s %d",p->ID,&p->age);
head->next=NULL;
for(i=1;i<n;i++)
{
p=(struct patient *)malloc(len);
scanf("%s %d",p->ID,&p->age);
head=insert(head,p);
}
print(head);
} |
9 | 4303 |
struct patient
{
char id[11];
int age;
struct patient *next;
};
int main()
{
struct patient *head;
struct patient *create(int n);
void sort(struct patient *head);
int n;
scanf("%d",&n);
head=create(n);
sort(head);
return 0;
}
struct patient *create(int n)
{
int i;
struct patient *head,*p1,*p2;
p1=(struct patient *)malloc(len);
head=p1;
p2=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;
if(i==(n-1))
(p1->next)=NULL;
}
return head;
}
void sort(struct patient *head)
{
int m;
struct patient *p1,*p2;
for(;;)
{
p1=head;
p2=head;
m=0;
for(;;)
{
if((p1->age)>m) m=(p1->age);
if((p1->next)==NULL) break;
else p1=(p1->next);
}
if(m<60) break;
p1=head;
for(;;)
{
if((p1->age)==m)
{
printf("%s\n",p1->id);
if(p1==head) head=(p1->next);
else
{
(p2->next)=(p1->next);
}
break;
}
else
{
if(p1!=p2)
{
p2=p1;
p1=(p1->next);
}
else p1=(p1->next);
}
}
}
p1=head;
for(;;)
{
printf("%s\n",p1->id);
if((p1->next)==NULL) break;
else p1=(p1->next);
}
} |
9 | 4304 |
struct bingren{
char id[20];
int age;
}bing[100]={'\0', 0};
struct laoren{
char oid[20];
int oage;
}lao[100]={'\0', 0};
void main()
{
int n, i, j=0, l;
struct laoren temp;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%s", bing[i].id);
scanf("%d", &bing[i].age);
}
for(i=0;i<n;i++)
{
if(bing[i].age>=60)
{
strcpy(lao[j].oid,bing[i].id);
lao[j].oage=bing[i].age;
bing[i].age=-1;
j++;
}
else
continue;
}
for(l=0;l<j;l++)
{
for(i=0;i<j-l;i++)
{
if(lao[i].oage<lao[i+1].oage)
{
temp=lao[i];
lao[i]=lao[i+1];
lao[i+1]=temp;
}
}
}
for(i=0;i<j+1;i++)
{
printf("%s\n", lao[i].oid);
}
for(i=0;i<n;i++)
{
if(bing[i].age>=0)
{
printf("%s\n", bing[i].id);
}
else
continue;
}
}
|
9 | 4305 |
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 | 4306 | struct ill
{
char num[20];
int age;
int turn;
struct ill *next;
};
void run(struct ill *head,int age,int turn,char *num)
{
struct ill *pre,*p,*s;
s=(struct ill *)malloc(sizeof(struct ill));
pre=head;
p=pre->next;
strcpy(s->num,num);
s->turn=turn;
s->age=age;
//s->next=NULL;
for(;p!=NULL;)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
int main()
{
int i,j,k,age,turn,m,n;
char *num;
void run(struct ill *head,int age,int turn,char *num);
num=(char *)malloc(20*sizeof(char));
struct ill *head,*p,*s,*pre;
head=(struct ill *)malloc(sizeof(struct ill));
head->next=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",num,&age);
turn=i;
run(head,age,turn,num);
}
k=0;
for(p=head->next;p!=NULL;p=p->next)
{
if(p->age>=60)
{
k++;
}
}
//printf("%d\n",k);
p=head->next;
m=100;
if(k==0)
{
for(i=0;i<n;i++)
{
p=head->next;
for(;p!=NULL;)
{
if(p->turn==i)
{
puts(p->num);
//printf("%s %d %d\n",p->num,p->age,p->turn);
break;
}
}
}
}
else if(k==n)
{
for(i=0;i<n;i++)
{
p=head->next;
m=0;j=100;
for(;p!=NULL;)
{
if(p->age>m)
{
m=p->age;
j=p->turn;
}
else if(p->age==m)
{
if(p->turn<j)
{
m=p->age;
j=p->turn;
}
}
p=p->next;
}
pre=head;
p=head->next;
for(;p!=NULL;)
{
if((p->age==m)&&(p->turn==j))
{
puts(p->num);
//printf("%s %d %d\n",p->num,p->age,p->turn);
pre->next=p->next;
break;
}
else
{
pre=p;
p=p->next;
}
}
}
}
else
{
for(i=0;i<k;i++)
{
p=head->next;
m=0;j=100;
for(;p!=NULL;)
{
if(p->age>m)
{
m=p->age;
j=p->turn;
}
else if(p->age==m)
{
if(p->turn<j)
{
m=p->age;
j=p->turn;
}
}
p=p->next;
}
pre=head;
p=head->next;
for(;p!=NULL;)
{
if((p->age==m)&&(p->turn==j))
{
puts(p->num);
//printf("%s %d %d\n",p->num,p->age,p->turn);
pre->next=p->next;
break;
}
else
{
pre=p;
p=p->next;
}
}
}
for(i=0;i<n-k;i++)
{
m=100;
p=head->next;
for(;p!=NULL;)
{
if(p->turn<m)
{
m=p->turn;
}
p=p->next;
}
p=head->next;
for(;p!=NULL;)
{
if(p->turn==m)
{
puts(p->num);
//printf("%s %d %d\n",p->num,p->age,p->turn);
p->turn=100;
break;
}
else
{
p=p->next;
}
}
}
}
return 0;
} |
9 | 4307 | int main()
{
int n,a,i,j,sgh,sgh60;
sgh=0;
sgh60=0;
char d[10];
struct guahao
{
char ID[10];
int age;
}
gh[100],gh60[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",d,&a);
if(a>=60)
{
strcpy(gh60[sgh60].ID,d);
gh60[sgh60].age=a;
sgh60=sgh60+1;
}else
{
strcpy(gh[sgh].ID,d);
gh[sgh].age=a;
sgh=sgh+1;
}
}
for(i=1;i<=sgh60;i++)
{
for(j=sgh60-1;j>0;j--)
{
if(gh60[j].age>gh60[j-1].age)
{
a=gh60[j].age;
gh60[j].age=gh60[j-1].age;
gh60[j-1].age=a;
strcpy(d,gh60[j].ID);
strcpy(gh60[j].ID,gh60[j-1].ID);
strcpy(gh60[j-1].ID,d);
}
}
}
for(i=0;i<sgh60;i++)
{
printf("%s\n",gh60[i].ID);
}
for(i=0;i<sgh;i++)
{
printf("%s\n",gh[i].ID);
}
return 0;
} |
9 | 4308 | main()
{
char senior[100][10];
char junior[100][10];
char temp[10];
int list[100]={0};
int se[100];
int ju[100];
int n,i,j,k,nums,numj,year;
scanf("%d",&n);
nums=-1; numj=-1;
for (i=1;i<=n;i++)
{
scanf("%s",temp);
scanf("%d",&year);
if (year>=60)
{
nums++;
strcpy(senior[nums],temp);
se[nums]=year;
list[nums]=nums;
}
else
{
numj++;
strcpy(junior[numj],temp);
ju[numj]=year;
}
}
for (i=0;i<nums;i++)
for (j=i+1;j<=nums;j++)
if ((se[i]<se[j]) ||
(se[i]==se[j] && list[i]>list[j]))
{
year=se[i]; se[i]=se[j]; se[j]=year;
year=list[i]; list[i]=list[j]; list[j]=year;
strcpy(temp,senior[i]);
strcpy(senior[i],senior[j]);
strcpy(senior[j],temp);
}
for (i=0;i<=nums;i++)
{
puts(senior[i]);
}
for (i=0;i<=numj;i++)
puts(junior[i]);
return 0;
}
|
9 | 4309 | int main()
{
int n,i,j,k,m,t,b[100],e[100];
char a[100][20],c[100][20],d[100][20],str[20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",a[i],&b[i]);
for(i=0,j=0,k=0;i<n;i++)
{
if(b[i]>=60)
{
strcpy(c[j],a[i]);
e[j]=b[i];
j++;
}
else
{
strcpy(d[k],a[i]);
k++;
}
}
for(i=0;i<j-1;i++)
{
for(m=0;m<j-1-i;m++)
{
if(e[m]<e[m+1])
{
t=e[m];e[m]=e[m+1];e[m+1]=t;
strcpy(str,c[m]);strcpy(c[m],c[m+1]);strcpy(c[m+1],str);
}
}
}
for(i=0;i<j;i++)
printf("%s\n",c[i]);
for(i=0;i<k;i++)
printf("%s\n",d[i]);
getchar();
getchar();
} |
9 | 4310 |
struct pat
{
char id[30];
int age;
int num;
int flag;
struct pat *next;
struct pat *ns;
};
int n;
void sort(struct pat *head)
{
int i,j;
struct pat *q,*p,*max;
q=head;
for(i=0;i<n;i++)
{
p=head->next;
while(1)
{
if(p->flag)
break;
p=p->next;
}
max=p;
while(1)
{
if((p->num)>(max->num)&&p->flag)
max=p;
p=p->next;
if(p==NULL)
break;
}
max->flag=0;
q->ns=max;
q=q->ns;
}
q->ns=NULL;
}
void main()
{
int i;
struct pat *head,*p1,*p2,*p;
scanf("%d",&n);
head=(struct pat*)malloc(LEN);
for(i=0;i<n;i++)
{
p1=(struct pat*)malloc(LEN);
scanf("%s %d",p1->id,&p1->age);
p1->flag=1;
if(p1->age>=60)
p1->num=10000*p1->age+n-i;
else
p1->num=n-i;
if(i==0)
{
head->next=p1;
p2=p1;
}
else
p2->next=p1;
p2=p1;
}
p2->next=NULL;
sort(head);
p=head->ns;
for(i=0;i<n;i++)
{
printf("%s\n",p->id);
p=p->ns;
}
} |
9 | 4311 | void main()
{
struct patient
{
char ID[10];
int age;
};
struct patient pat[100];
int n,i,j,huan;
char string[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pat[i].ID,&pat[i].age);
}
for(i=0;i<n;i++)
{
if(pat[i].age>=60)
{
for(j=i;j>0;j--)
{
if(pat[j].age>pat[j-1].age)
{
huan=pat[j].age;
pat[j].age=pat[j-1].age;
pat[j-1].age=huan;
strcpy(string,pat[j].ID);
strcpy(pat[j].ID,pat[j-1].ID);
strcpy(pat[j-1].ID,string);
}
}
}
}
for(i=0;i<n;i++)
printf("%s\n",pat[i].ID);
}
|
9 | 4312 | void main()
{
char ID[100][10]={'\0'},young[100][10]={'\0'},old[100][10]={'\0'},wae[100]={'\0'};
int age[100]={0},y[100]={0},o[100]={0};
int i,n;
int m=0,k=0,temp=0;
int a,b;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",ID[i],&age[i]);
for(i=0;i<n;i++)
{
if(age[i]<60)
{
strcpy(young[m],ID[i]);
y[m]=age[i];
m++;
}
else
{
strcpy(old[k],ID[i]);
o[k]=age[i];
k++;
}
}
for(a=0;a<k-1;a++)
{
for(b=0;b<k-a-1;b++)
{
if(o[b]<o[b+1])
{
temp=o[b];
o[b]=o[b+1];
o[b+1]=temp;
strcpy(wae,old[b]);
strcpy(old[b],old[b+1]);
strcpy(old[b+1],wae);
}
}
}
for(a=0;a<k;a++)
printf("%s\n",old[a]);
for(b=0;b<m;b++)
printf("%s\n",young[b]);
}
|
9 | 4313 | int m=0;
struct patient
{
char id[32];
int age;
struct patient *next;
};
struct patient *find(struct patient *head)
{
struct patient *p,*ppre;
p=head;
while (p&&p->age>=60)
{
ppre=p;
p = p->next;
}
return ppre;
}
struct patient *create(int n)
{
struct patient *head=NULL,*p1,*p2,*p0,*q;
int i;
p1=p2=p0=(struct patient*)malloc(Len);
scanf("%s %d",p1->id,&p1->age);
if(p1->age>=60) m++;
p1->next=NULL;
head=p1=p0;
p2=p1;
for(i=1;i<n;i++)
{
p1=(struct patient*)malloc(Len);
scanf("%s %d",p1->id,&p1->age);
if(p1->age<60)
{
p1->next=NULL;
p2->next=p1;
p2=p1;
}
else if(p1->age>=60)
{
m++;
if(head->age<60)
{
head=p1;
p1->next=p0;
}
if(head->age>=60)
{
p0=find(head);
q=p0->next;
p0->next=p1;
p1->next=q;
}
if((p0=find(head))->next==NULL)
{
p1->next=NULL;
p2->next=p1;
p2=p1;
}
}
}
return head;
}
struct patient *arrange(struct patient *head)
{
struct patient *p1,*p2;
int t1,i,j;
char t2[32];
for(j=0;j<m;j++)
{
p1=head;
for(i=1;i<m-j;i++)
{
p2=p1;
p1=p1->next;
if(p2->age<p1->age)
{
t1=p1->age;
strcpy(t2,p1->id);
p1->age=p2->age;
strcpy(p1->id,p2->id);
p2->age=t1;
strcpy(p2->id,t2);
}
}
}
}
void print(struct patient *head)
{
struct patient *p;
p = head;
while (p)
{
printf("%s\n",p->id);
p = p->next;
}
}
int main()
{
struct patient *head,*p,*q,*p0;
int n,m=0,age;
char id[32];
scanf("%d",&n);
head=create(n);
arrange(head);
print(head);
}
|
9 | 4314 | void main(){
struct br{
char id[10];
int age;
}br[100], lr[100], temp;
int i, n, m, j;
scanf("%d", &n);
for(i=0, j=0; i<n;i++){
scanf("%s %d", br[i].id, &br[i].age);
if(br[i].age>=60){
lr[j]=br[i];
j++;
}
}
m=j;
for(i=1;i<m;i++){
for(j=1;j<=m-i;j++){
if(lr[j].age>lr[j-1].age){
temp=lr[j-1];
lr[j-1]=lr[j];
lr[j]=temp;
}
}
}
for(i=0;i<m;i++)
printf("%s\n",lr[i].id);
for(i=0;i<n;i++)
if(br[i].age<60)
printf("%s\n",br[i].id);
} |
9 | 4315 | int main()
{
int n,i,j=0,m=0;
scanf("%d",&n);
char s1[100][10],s2[100][10],p1[100][10],p2[100][10],z1[100][10],z2[100][10],t[10];
for(i=0;i<n;i++)
{
scanf("%s",s1[i]);
scanf("%s",s2[i]);
}
for(i=0;i<n;i++)
{
if(s2[i][1]!='\0'&&strcmp(s2[i],"60")>=0)
{
strcpy(p1[j],s1[i]);
strcpy(p2[j],s2[i]);
j++;
}
if(s2[i][2]>='0'&&s2[i][2]<='9'&&s2[i][3]=='\0')
{
strcpy(z1[m],s1[i]);
strcpy(z2[m],s2[i]);
m++;
}
}
int k=j;
for(i=k-1;i>=0;i--)
{
for(j=0;j<i;j++)
{
if(strcmp(p2[j],p2[j+1])<0)
{
strcpy(t,p2[j]);
strcpy(p2[j],p2[j+1]);
strcpy(p2[j+1],t);
strcpy(t,p1[j]);
strcpy(p1[j],p1[j+1]);
strcpy(p1[j+1],t);
}
}
}
for(i=m-1;i>=0;i--)
{
for(j=0;j<i;j++)
{
if(strcmp(z2[j],z2[j+1])<0)
{
strcpy(t,z2[j]);
strcpy(z2[j],z2[j+1]);
strcpy(z2[j+1],t);
strcpy(t,z1[j]);
strcpy(z1[j],z1[j+1]);
strcpy(z1[j+1],t);
}
}
}
for(j=0;j<m;j++)
{
printf("%s\n",z1[j]);
}
for(j=0;j<k;j++)
{
printf("%s\n",p1[j]);
}
for(i=0;i<n;i++)
{
if(!((s2[i][1]!='\0'&&strcmp(s2[i],"60")>=0)||(s2[i][2]>='0'&&s2[i][2]<='9'&&s2[i][3]=='\0')))
printf("%s\n",s1[i]);
}
return 0;
}
|
9 | 4316 | struct bing
{
char id[10];
int age;
int num;
}bing[100],temp;
int main ()
{
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&bing[i].id,&bing[i].age);
bing[i].num=i+1;
}
for(j=0;j<=n;j++)
{
for(i=0;i<n-1;i++)
{
if(bing[i+1].age>=60&&bing[i].age<bing[i+1].age)
{
temp=bing[i+1];
bing[i+1]=bing[i];
bing[i]=temp;
}
}
}
for(i=0;i<n;i++)
printf("%s\n",bing[i].id);
return 0;
}
|
9 | 4317 | 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 | 4318 | int main()
{
struct student
{ char as[10];
int ag;
};
struct student stu[100];
struct student st[100];
struct student temp;
int n,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",stu[i].as,&stu[i].ag);
j=0;
for(i=0;i<n;i++){
if(stu[i].ag>59){
st[j]=stu[i];
stu[i].ag=0;
j++;
}
}
for(k=1;k<j;k++){
for(i=0;i<j-k;i++){
if(st[i].ag<st[i+1].ag){
temp=st[i];
st[i]=st[i+1];
st[i+1]=temp;
}
}
}
for(i=0;i<j;i++)
printf("\n%s",st[i].as);
for(i=0;i<n;i++)
if(stu[i].ag!=0)
printf("\n%s",stu[i].as);
return 0;
}
|
9 | 4319 | struct person
{
char c[10];
int a;
struct person *next;
};
int main()
{
int i,n;
struct person *head,*p1,*p2,*p,*p0,*p3;
scanf("%d",&n);
i=0;
head=NULL;
while(i<n)
{
p1=(struct person*)malloc(len);
scanf("%s %d",p1->c,&p1->a);
if(i==0) { head=p1;p2=p1;}
else
{
p2->next=p1;
p2=p1;
}
i++;
}
p2->next=NULL;
for(i=0;i<n;i++)
{
p=p0=head;
while(p!=NULL)
{
if(p->a>p0->a) p0=p;
p=p->next;
}
if(p0->a>=60)
{
printf("%s\n",p0->c);
p=head;
while(p->a!=p0->a)
{
p3=p;
p=p->next;
}
if(p==head) head=p->next;
else p3->next=p->next;
}
else
{
printf("%s\n",head->c);
head=head->next;
}
}
}
|
9 | 4320 | struct bingren
{
char id[20];
int nian;
struct bingren *next;
};
int main()
{
int n,i;
struct bingren *p1,*head;
struct bingren temp;
char a[20]={'\0'};
int b=0;
scanf("%d",&n);
head=(struct bingren *)malloc(sizeof(struct bingren));
head->next=NULL;
scanf("%s%d",head->id,&head->nian);
p1=head;
for(i=1;i<n;i++)
{
p1->next=(struct bingren *)malloc(sizeof(struct bingren));
scanf("%s%d",p1->next->id,&p1->next->nian);
p1->next->next=NULL;
p1=p1->next;
}
p1=head;
for(i=1;i<n;i++)
{
for(;p1->next!=NULL;)
{
if(p1->next->nian >= 60 && p1->next->nian > p1->nian )
{
b=p1->nian;
p1->nian=p1->next->nian;
p1->next->nian=b;
strcpy(a,p1->id);
strcpy(p1->id,p1->next->id);
strcpy(p1->next->id,a);
}
p1=p1->next;
}
p1=head;
}
p1=head;
for(;p1!=NULL;)
{
printf("%s\n",p1->id);
p1=p1->next;
}
}
|
9 | 4321 | int main()
{
int n,i,j=0,k,l;
struct patient
{
char num[10];
int age;
}p[100],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
do{scanf("%c",&p[i].num[j]);j++;}
while(p[i].num[j-1]!=' ');
p[i].num[j-1]='\0';
scanf("%d",&p[i].age);
j=0;
}
for(i=0;i<n;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(p[j].age>p[k].age) k=j;
if(k!=i&&p[k].age>=60)
{
temp=p[k];
for(l=k;l>=i+1;l--)
{
p[l]=p[l-1];
}
p[i]=temp;
}
}
for(i=0;i<n;i++)
{
printf("%s",p[i].num);if(i!=n-1) printf("\n");
}
return 0;
} |
9 | 4322 | int main()
{
int n,h,i,j,k,s,t,p;
scanf("%d",&n);
int a[n-1],c[n-1];
char string[n-1][10],b[n-1][10];
for(h=0;h<=n-1;h++)
{
scanf("%s %d",string[h],&a[h]);
}
for(p=0,j=0;p<=n-1;p++)
{
if(a[p]>=60)
{
c[j]=a[p];
strcpy(b[j],string[p]);
j++;
}
}
for(k=1;k<=j;k++)
{
for(s=1;s<=j;s++)
{
for(i=0,t=0;i<j;i++)
{
if(c[s-1]>=c[i])
t++;
}
if(t==j)
{
printf("%s\n",b[s-1]);
c[s-1]=0;
break;
}
}
}
for(i=0;i<n;i++)
{
if(a[i]<60)
printf("%s\n",string[i]);
}
getchar();
getchar();
}
|
9 | 4323 | void main()
{
struct patient
{
char ID[16];
int age;
int index;
};
int n,i,j,t,t1;
char str[16];
scanf("%d",&n);
struct patient pat[n];
for(i=0;i<n;i++)
{scanf("%s %d",pat[i].ID,&pat[i].age);
pat[i].index=i;}
for(i=0;i<n;i++)
{ for(j=i+1;j<n;j++)
{
if(pat[j].age>=60&&pat[j].age>pat[i].age)
{strcpy(str,pat[i].ID);
strcpy(pat[i].ID,pat[j].ID);
strcpy(pat[j].ID,str);
t=pat[i].age;
pat[i].age=pat[j].age;
pat[j].age=t;
t1=pat[i].index;
pat[i].index=pat[j].index;
pat[j].index=t1;}
if(pat[i].age>=60&&pat[i].age==pat[j].age)
{
if(pat[i].index>pat[j].index)
{strcpy(str,pat[i].ID);
strcpy(pat[i].ID,pat[j].ID);
strcpy(pat[j].ID,str);
t=pat[i].age;
pat[i].age=pat[j].age;
pat[j].age=t;
t1=pat[i].index;
pat[i].index=pat[j].index;
pat[j].index=t1;}
}
}
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
if(pat[i].age<60&&pat[i].index>pat[j].index)
{strcpy(str,pat[i].ID);
strcpy(pat[i].ID,pat[j].ID);
strcpy(pat[j].ID,str);
t=pat[i].age;
pat[i].age=pat[j].age;
pat[j].age=t;
t1=pat[i].index;
pat[i].index=pat[j].index;
pat[j].index=t1;}
}
for(i=0;i<n;i++)
puts(pat[i].ID);
}
|
9 | 4324 | int main()
{
int n,i,j,temp,m=0;
int patage[100];
struct patient
{
char num[20];
int age;
};
struct patient pat[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",pat[i].num,&pat[i].age);
for(i=0,j=0;i<n;i++)
if(pat[i].age>=60)
{
patage[j]=pat[i].age;
j++;
m++;
}
for(i=0;i<m;i++)
for(j=0;j<m-i;j++)
{
if(patage[j]<patage[j+1])
{
temp=patage[j];
patage[j]=patage[j+1];
patage[j+1]=temp;
}
}
for(i=0;i<m;i++)
{
if(patage[i]==patage[i-1])
continue;
for(j=0;j<n;j++)
if(pat[j].age==patage[i])
printf("%s\n",pat[j].num);
}
for(i=0;i<n;i++)
{
if(pat[i].age>=60)
continue;
else
printf("%s\n",pat[i].num);
}
return 0;
} |
9 | 4325 | struct Patient
{
char num[10];
int age;
struct Patient *next;
};
int main()
{
void paixu(int n,struct Patient *head);
struct Patient *creat(int n);
int n,i;
struct Patient *head;
scanf("%d",&n);
head=creat(n);
paixu(n,head);
for(i=0;i<n;i++)
{
printf("%s\n",head->num);
head=head->next;
}
}
struct Patient *creat(int n)
{
int i;
struct Patient *head,*thispoint,*nextpoint;
for(i=0;i<n;i++)
{
if(i==0)
{
nextpoint=(struct Patient *)malloc(sizeof(struct Patient));
scanf("%s %d",nextpoint->num,&nextpoint->age);
head=nextpoint;
thispoint=head;
}
else
{
nextpoint=(struct Patient *)malloc(sizeof(struct Patient));
scanf("%s %d",nextpoint->num,&nextpoint->age);
thispoint->next=nextpoint;
thispoint=nextpoint;
}
}
thispoint->next=NULL;
return head;
}
void paixu(int n,struct Patient *head)
{
int i,j,k,count;
struct Patient *p1,*p2,*p3,*p4;
char tempnum[10],tempnum3[10],tempnum4[10];
int tempage,tempage3,tempage4;
p1=head;
for(i=0;i<n-1;i++)
{
if(p1->age<60)
{
p2=p1->next;
for(j=i+1;j<n;j++)
{
if(p2->age>59)
{
strcpy(tempnum,p2->num);tempage=p2->age;
p3=p1;p4=p3->next;
for(k=i;k<j;k++)
{
strcpy(tempnum4,p4->num);tempage4=p4->age;
if(k==i){strcpy(p4->num,p3->num);p4->age=p3->age;}
else {strcpy(p4->num,tempnum3);p4->age=tempage3;}
strcpy(tempnum3,tempnum4);tempage3=tempage4;
p3=p3->next;p4=p4->next;
}
strcpy(p1->num,tempnum);p1->age=tempage;
break;
}
else p2=p2->next;
}
}
p1=p1->next;
}
p1=head;
for(i=0,count=0;i<n;i++)
{
if(p1->age>59){count++;}
p1=p1->next;
}
p1=head;
for(i=1;i<count;i++)
{
p2=p1;
for(j=0;j<count-i;j++)
{
p3=p2->next;
if(p2->age<p3->age)
{
strcpy(tempnum,p2->num);tempage=p2->age;
strcpy(p2->num,p3->num);p2->age=p3->age;
strcpy(p3->num,tempnum);p3->age=tempage;
}
p2=p2->next;
}
}
}
|
9 | 4326 | 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 | 4327 | struct student
{
char num[10];
int age;
}line[100];
void main()
{
int n,i,j,k,temp=0,m,e;
scanf("%d",&n);
int a[100]={0},b[100]={0};
char s[100][10],y[100][10];
char exchange[10];
for(i=0;i<n;i++)
{
scanf("%s%d",line[i].num,&line[i].age);
}
for(i=0;i<n;i++)
{
if(line[i].age>=60)
{
temp++;
}
}
j=0;
for(i=0;i<n;i++)
{
if(line[i].age>=60)
{
strcpy(s[j],line[i].num);
b[j]=line[i].age;
j++;
}
}
for(j=0;j<temp;j++)
{
for(k=0;k<temp-j;k++)
{
if(b[k]<b[k+1])
{
e=b[k];
b[k]=b[k+1];
b[k+1]=e;
strcpy(exchange,s[k]);
strcpy(s[k],s[k+1]);
strcpy(s[k+1],exchange);
}
}
}
for(j=0;j<temp;j++)
{
printf("%s\n",s[j]);
}
m=0;
for(i=0;i<n;i++)
{
if(line[i].age<60)
{
strcpy(y[m],line[i].num);
m++;
}
}
for(j=0;j<n-temp;j++)
{
printf("%s\n",y[j]);
}
} |
9 | 4328 | struct stu
{char num[20];
int score;
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->score=q->score;strcpy(s->num,q->num);
s->next=NULL;
if(s->score>=60){
while((p!=NULL)&&(q->score<=p->score))
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;}
else
{while((p!=NULL))
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;}
}
void print(struct stu *head)
{
struct stu *p;
int i=0;
p=head;
while(p!=NULL)
{
printf("%s\n",p->num);
p=p->next;
}
}
main()
{
int n,k,i;
struct stu *head;
struct stu *p;
head=(struct stu *)malloc(sizeof(struct stu));
head->next=NULL;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
p=(struct stu *)malloc(sizeof(struct stu));
scanf("%s %d",p->num,&p->score);
sort(head,p);
}
print(head->next);
}
|
9 | 4329 | int main()
{
int i,n,f=0,m=0,j;
struct
{
char id[10];
int age;
} bingren[100],t[100],l[100],c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",&bingren[i].id,&bingren[i].age);
}
for(i=0;i<n;i++)
{
if(bingren[i].age>=60)
t[f++]=bingren[i];
else if(bingren[i].age<60)
l[m++]=bingren[i];
}
for(i=1;i<f;i++)
{
for(j=i;j>0;j--)
{
if(t[j].age>t[j-1].age)
{
c=t[j];
t[j]=t[j-1];
t[j-1]=c;
}
}
}
for(i=0;i<f;i++)
{
printf("%s\n",t[i].id);
}
for(i=0;i<m;i++)
{
printf("%s\n",l[i].id);
}
return 0;
}
|
9 | 4330 | 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 | 4331 | int main()
{
int n,i,j,t,m,l;
int b[100],d[100],g[100];
char a[100][10],c[100][10],e[10],f[100][10];
m=0;
l=0;
t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",a[i],&b[i]);
}
for(i=0;i<n;i++)
{
if(b[i]>=60)
{
strcpy(c[m],a[i]);
d[m]=b[i];
m=m+1;
}
else
{
strcpy(f[l],a[i]);
g[l]=b[i];
l=l+1;
}
}
for(i=0;i<m-1;i++)
{
for(j=0;j<m-i-1;j++)
{
if(d[j]<d[j+1])
{
t=d[j];
d[j]=d[j+1];
d[j+1]=t;
strcpy(e,c[j]);
strcpy(c[j],c[j+1]);
strcpy(c[j+1],e);
}
}
}
for(i=0;i<m;i++)
printf("%s\n",c[i]);
for(i=0;i<l;i++)
printf("%s\n",f[i]);
getchar();
getchar();
}
|
9 | 4332 |
int main()
{
struct Patient
{
int flag;
char id[10];
int age;
};
struct Patient p[100],p2[100],temp;
int n,i,t=0,k,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&p[i].id,&p[i].age);
p[i].flag=0;
if(p[i].age>=60)
{
t=t+1;
p[i].flag=1;
}
p2[i]=p[i];
}
/*
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(p[j].age>p[k].age) k=j;
}
if(k!=i)
{
temp=p[i];
p[i]=p[k];
p[k]=temp;
}
}
*/
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
if(p[j].age<p[j+1].age)
{
temp=p[j];
p[j]=p[j+1];
p[j+1]=temp;
}
}
for(i=0;i<t;i++)
{
printf("%s\n",p[i].id);
}
for(i=0;i<n;i++)
{
if(p2[i].flag==0) printf("%s\n",p2[i].id);
}
return 0;
}
/*
int main()
{
struct patient
{
char ID[10];
int age;
}patient1[100];
struct patient patient2[100];
struct patient temp;
int n,i,s=0,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&patient1[i].ID,&patient1[i].age);
}
for(i=0;i<n;i++)
{
if(patient1[i].age>=60)
{
patient2[s]=patient1[i];
s++;
}
}
for(j=0;j<s-1;j++)
{
for(i=0;i<s-1-j;i++)
{
if(patient2[i].age<patient2[i+1].age)
{
temp=patient2[i];
patient2[i]=patient2[i+1];
patient2[i+1]=temp;
}
}
}
for(i=0;i<s;i++)
{
printf("%s\n",patient2[i].ID);
}
for(i=0;i<n;i++)
{
if(patient1[i].age<60)
{
printf("%s\n",patient1[i].ID);
}
}
return 0;
}
*/ |
9 | 4333 | 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 | 4334 | 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 | 4335 | struct patient{
char ID[10];
int age;
};
void paixu(struct patient pat[],int n)
{
struct patient t;
int i;
int k;
for(k=1;k<n;k++){
for(i=0;i<n-k;i++){
if(pat[i].age<pat[i+1].age){
t=pat[i];
pat[i]=pat[i+1];
pat[i+1]=t;
}
}
}
}
int main()
{
struct patient pat;
struct patient oldpat[100];
struct patient youngpat[100];
int n;
int i;
int m=0;
int k=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",pat.ID,&pat.age);
if(pat.age>=60){
oldpat[m]=pat;
m++;
}else{
youngpat[k]=pat;
k++;
}
}
paixu(oldpat,m);
for(i=0;i<m;i++){
printf("%s\n",oldpat[i].ID);
}
for(i=0;i<k;i++){
printf("%s\n",youngpat[i].ID);
}
return 0;
}
|
9 | 4336 |
struct patient
{
char ID[10];
int age;
struct patient *next;
};
struct patient *creat(void)
{
struct patient *head;
struct patient *p1,*p2;
int num;
scanf("%d",&num);
p2=NULL;
p1=(struct patient *)malloc(LEN);
head=p1;
while(num>0)
{
p2=p1;
scanf("%s %d",&p1->ID,&p1->age);
p1=(struct patient *)malloc(LEN);
p2->next=p1;
num--;
}
p2->next=NULL;
return(head);
}
struct patient *sort(struct patient *head)
{
struct patient *first;
struct patient *tail;
struct patient *p_max;
struct patient *max;
struct patient *p;
first = NULL;
while (head != NULL)
{
for(p=head,max=head; p->next!=NULL; p=p->next)
{
if (p->next->age>max->age&&p->next->age>=60)
{
p_max = p;
max = p->next;
}
}
if (first == NULL)
{
first = max;
tail = max;
}
else
{
tail->next = max;
tail = max;
}
if (max == head)
{
head = head->next;
}
else
{
p_max->next = max->next;
}
}
if (first != NULL)
{
tail->next = NULL;
}
head = first;
return head;
}
void print(struct patient *head)
{
struct patient *p;
p=head;
while(p!=NULL)
{
printf("%s\n",p->ID);
p=p->next;
}
}
int main()
{
struct patient *head;
int n,i,j;
head=creat();
head=sort(head);
print(head);
}
/*?????????????????????????????????????a?b,??b??>a????b>=60????????
???????????????????????60+???60-?????????????????......*/
|
9 | 4337 | main()
{
struct p
{char num[100];
int age;
} p[101];
int n,i,j,k,m=0;
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%s %d",&p[i].num,&p[i].age);
struct q
{char num[100];
int age;
} q[101];
for(i=1,j=1;i<=n;i++) {if(p[i].age>=60) {strcpy(q[j].num,p[i].num);q[j].age=p[i].age;j++;m=m+1;}}
for(j=1;j<=m;j++)
{
for(i=1;i<=m-1;i++)
{
if(q[i].age<q[i+1].age)
{
q[101]=q[i];
q[i]=q[i+1];
q[i+1]=q[101];
}
}
}
printf("%s",q[1].num);
for(i=2;i<=m;i++) printf("\n%s",q[i].num);
for(i=1;i<=n;i++) if(p[i].age<60) printf("\n%s",p[i].num);
}
|
9 | 4338 | struct pat
{
char num[10];
int age;
}pat[100],str[100],t;
int main()
{
int n,i,j,a=-1,temp;
int ch[100];
char c[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pat[i].num,&pat[i].age);
if(pat[i].age>=60)
{
a++;
strcpy(str[a].num,pat[i].num);
str[a].age=pat[i].age;
}
}
for(i=a;i>=1;i--)
{
for(j=0;j<i;j++)
{
if(str[j].age<str[j+1].age)
{
t=str[j];
str[j]=str[j+1];
str[j+1]=t;
}
}
}
for(i=0;i<n;i++)
{
if(pat[i].age<60)
{
a++;
str[a]=pat[i];
}
}
for(i=0;i<n;i++)
{
printf("%s\n",str[i].num);
}
}
|
9 | 4339 | int main()
{
char string[100][100];
int age[100];
int age1[100];
int a[100];
int max,n,l,i,j,k,x;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",string[i],&age[i]);
j=0;
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
age1[j]=age[i];
age[i]=0;
a[j]=i;
j++;
}
}
for(i=0;i<j;i++)
{
max=0;
x=0;
for(k=0;k<j;k++)
{
if(max<age1[k])
{
max=age1[k];
x=k;
}
}
printf("%s\n",string[a[x]]);
age1[x]=0;
}
for(i=0;i<n;i++)
if(age[i]!=0)
printf("%s\n",string[i]);
getchar();
getchar();
}
|
9 | 4340 | int main()
{
int a[100],b[100],c[100],n,i,j,lao=0,you=0,t;
char e[100][10],f[100][10],g[100][10],s[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",e[i],&a[i]);
for(i=0;i<n;i++)
{
if(a[i]>=60)
{
b[lao]=a[i];
strcpy(f[lao],e[i]);
lao++;
}
else
{
c[you]=a[i];
strcpy(g[you],e[i]);
you++;
}
}
for(j=0;j<lao-1;j++)
{
for(i=0;i<lao-1;i++)
{
if(b[i]<b[i+1])
{
t=b[i];
b[i]=b[i+1];
b[i+1]=t;
strcpy(s,f[i]);
strcpy(f[i],f[i+1]);
strcpy(f[i+1],s);
}
}
}
for(i=0;i<lao;i++)
printf("%s\n",f[i]);
for(i=0;i<you;i++)
printf("%s\n",g[i]);
return 0;
} |
9 | 4341 | 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 | 4342 | int main()
{
int n,i,j;
scanf("%d",&n);
struct point
{
char id[10];
int age;
}
points[100],news[100],tmp;
for(i=0;i<n;i++)
{
scanf("%s %d",&points[i].id,&points[i].age);
}
for(i=n-1;i>=0;i--)
{
for(j=0;j<i;j++)
{
if(points[j+1].age>=60&&points[j+1].age>points[j].age)
{
tmp=points[j+1];
points[j+1]=points[j];
points[j]=tmp;
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",points[i].id);
}
return 0;
} |
9 | 4343 |
struct data
{
char id[11];
int age;
struct data *next;
};
void main ()
{
int i,n,k=0;
struct data *p1,*p2,*head;
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;
for (i=n;i>n-k;i--)
{
head=sort(head,i);
}
print(head);
}
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;
}
printf("%s\n",code->id);
if (pre==head)
head->next=code->next;
else
pre->next=code->next;
free(code);
return (head);
}
void print(struct data *head)
{
struct data *p;
p=head->next;
do
{
printf ("%s\n",p->id);
p=p->next;
}
while (p!=NULL);
} |
9 | 4344 |
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 | 4345 | struct person
{
char id[20];
int y;
};
void main()
{
int n,i,j,m=0,k=0;
struct person t,*s,o[1000],y[1000];
scanf("%d",&n);
s=(struct person *)malloc(n*sizeof(struct person));
for(i=0;i<n;i++)
scanf("%s %d",s[i].id,&s[i].y);
for(i=0;i<n;i++)
if (s[i].y>=60) {o[k]=s[i];k++;}
else {y[m]=s[i];m++;}
for(i=0;i<k;i++)
{for(j=0;j<k-i;j++)
if (o[j].y<o[j+1].y) {t=o[j];o[j]=o[j+1];o[j+1]=t;}
}
for(i=0;i<k;i++)
printf("%s\n",o[i].id);
for(i=0;i<m;i++)
printf("%s\n",y[i].id);
}
|
9 | 4346 | struct huanzhe
{char id[11];
int age;
}sick[110];
int panduan(int *p1,int *p2,int a,int b);
void paixu(int *p3,int *p4,int c);
int main(int argc, char* argv[])
{
int n,i,pan;
int ji[110]={1};
int zhangzhe[110];
int *pointer1,*pointer2;
pointer1=ji;
pointer2=zhangzhe;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",&sick[i].id,&sick[i].age);
}
for(i=0;i<n;i++){
pan=panduan(pointer1,pointer2,sick[i].age,i);
if(pan){sick[i].age=0;}
}
paixu(pointer1,pointer2,ji[0]);
for(i=1;i<ji[0];i++){
printf("%s\n",&sick[ji[i]].id);
}
for(i=0;i<n;i++){
if(sick[i].age==0){
continue;
}
printf("%s\n",sick[i].id);
}
return 0;
}
int panduan(int *p1,int *p2,int a,int b){
int jieguo=0;
if(a>=60){
*(p1+*p1)=b;
*(p2+*p1)=a;
(*p1)++;
jieguo=1;
}
return(jieguo);
}
void paixu(int *p3,int *p4,int c){
int j,k,temp;
for(j=0;j<c;j++){
for(k=1;k<c-1;k++){
if(*(p4+k)<*(p4+k+1)){
bian(p3);
bian(p4);
}
}
}
} |
9 | 4347 | 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 | 4348 | int main (){
int a[100],e[100],f[100];
char c[100][100],b[100][100],d[100][100],x[100];
int n,p=-1,q=-1,k,z,i;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s %d",c[i],&a[i]);
if(a[i]>=60){
p++;
e[p]=a[i];
strcpy(b[p],c[i]);
}
if(a[i]<60){
q++;
f[q]=a[i];
strcpy(d[q],c[i]);
}
}
for (k=1;k<=p+1;k++){
for (i=0;i<p+1-k;i++){
if(e[i]<e[i+1]){
z=e[i];
e[i]=e[i+1];
e[i+1]=z;
strcpy( x,b[i]);
strcpy( b[i],b[i+1]);
strcpy( b[i+1],x);
}
}
}
for(i=0;i<=p;i++){
puts(b[i]);
}
for(i=0;i<=q;i++){
puts(d[i]);
}
return 0;
}
|
9 | 4349 | int main()
{
int n,i,j=0,k=0,a,e,f,b;
char id[N][11],ido[N][11],idy[N][11],m[11];
int nl[N],nlo[N];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",id[i],&nl[i]);
if(nl[i]<60)
{
strcpy(idy[j],id[i]);
j++;
}
if(nl[i]>=60)
{
nlo[k]=nl[i];
strcpy(ido[k],id[i]) ;
k++;
}
}
for(a=1;a<=k;a++)
{
for(b=0;b<k-a;b++)
{
if(nlo[b]<nlo[b+1])
{
e=nlo[b+1];
nlo[b+1]=nlo[b];
nlo[b]=e;
strcpy(m,ido[b+1]);
strcpy(ido[b+1],ido[b]);
strcpy(ido[b],m);
}
}
}
for(f=0;f<k;f++)
{
puts(ido[f]);
}
for(f=0;f<j;f++)
{
puts(idy[f]);
}
return 0;
} |
9 | 4350 |
struct patient{
char ID[10];
int age;
};
void bubble(struct patient * a[],int n);
void main()
{
int n,i,s=0;
struct patient p[100]={"0",0};
struct patient * pt[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&p[i].ID,&p[i].age);
pt[i]=&p[i];
}
bubble(pt,n);
for(i=0;i<n;i++)
{
if(pt[i]->age>=60)
{
printf("%s\n",pt[i]->ID);
s++;
}
}
for(i=0;i<n;i++)
{
if(p[i].age<60)
{
printf("%s\n",p[i].ID);
}
}
}
void sort2(struct patient * a[],int n)
{
int i,j,k;
struct patient * t;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(a[j]->age > a[k]->age)
{k=j;}
}
t=a[k];a[k]=a[i];a[i]=t;
}
}
void bubble(struct patient * a[],int n)
{
int i,j;
struct patient * t;
for(i=0;i<=n-2;i++)
{
for(j=0;j<=n-i-2;j++)
{
if(a[j]->age < a[j+1]->age)
{
t=a[j];a[j]=a[j+1];a[j+1]=t;
}
}
}
} |
9 | 4351 | int main(){
int i,j,n,k=0,b[100],c=0,eb;
char a[100][10],ea[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",a[i],&b[i]);
for(j=0;j<n;j++){
for(i=n-1;i>j;i--){
if(b[i]>b[i-1]&&b[i]>=60){
eb=b[i];
b[i]=b[i-1];
b[i-1]=eb;
strcpy(ea,a[i]);
strcpy(a[i],a[i-1]);
strcpy(a[i-1],ea);
}
}
}
for(i=0;i<n;i++)
printf("%s\n",a[i]);
return 0;
} |
9 | 4352 | struct p
{
char i[10];
int a;
struct p *next;
};
void main()
{
struct p *p1,*p2,*head,*head2,*q1,*q2;
int n,i,k=0,b=0,x=0;
scanf("%d",&n);
p1=p2=(struct p *)malloc(len);
scanf("%s %d",p1->i,&p1->a);
for(i=0;i<n;i++)
{
k++;
if(k==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct p *)malloc(len);
scanf("%s %d",p1->i,&p1->a);
}
p2->next=NULL;
for(p1=head;p1!=NULL;p1=p1->next)if(p1->a>=60)x++;
k=0;
for(p1=head;p1!=NULL;p1=p1->next)
if(p1->a>=60&&p1->a>b){b=p1->a;p2=p1;}
q1=q2=(struct p *)malloc(len);
strcpy(q1->i,p2->i);q1->a=p2->a;p2->a=0;
for(i=0;i<x-1;i++)
{k++;
if(k==1)head2=q1;
else q2->next=q1;
q2=q1;b=0;
for(p1=head;p1!=NULL;p1=p1->next)
if(p1->a>=60&&p1->a>b){b=p1->a;p2=p1;}
q1=(struct p *)malloc(len);
strcpy(q1->i,p2->i);q1->a=p2->a;p2->a=0;
}
q2->next=q1;q2=q1;
for(p1=head;p1!=NULL;p1=p1->next)
if(p1->a>0){
q1=(struct p *)malloc(len);
strcpy(q1->i,p1->i);q1->a=p1->a;p1->a=0;
q2->next=q1;q2=q1;
}
q2->next=NULL;
for(q1=head2;q1!=NULL;q1=q1->next)
printf("%s\n",q1->i);
}
|
9 | 4353 |
struct Patient
{
char id[10];
int age;
}a[100],e,b[100];
int main()
{
int n,J;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)
{
scanf("%s %d",a[i].id,&a[i].age);
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(a[j].id>a[j+1].id)
{
e=a[j];a[j]=a[j+1];a[j+1]=e;
}
}
}
j=0;
for(i=0;i<n;i++)
{
if(a[i].age>=60)
{
b[j]=a[i];
j++;
}
}
J=j;
for(j=0;j<J;j++)
{
for(i=0;i<J-j;i++)
{
if(b[i].age<b[i+1].age)
{
e=b[i];
b[i]=b[i+1];
b[i+1]=e;
}
}
}
for(j=0;j<J;j++)
{
printf("%s\n",b[j].id);
}
for(i=0;i<n;i++)
{
if(a[i].age<60)
{
printf("%s\n",a[i].id);
}
}
return 0;
} |
9 | 4354 | int main()
{
int num,j,i,n,max,count,a[100];
//int order[100];
char s[100][10];
scanf("%d",&num);
for( i = 0;i < num;i++)
{
scanf("%s %d",s[i],&a[i]);//???s[i][10](?????)??s[i](??????)
}
n = 0;
for(count = 0;count < num;count++)
{
max = 59;
for(i = 0;i<num; i++)
{
if(a[i] > max&&a[i] < 200)//??????
{
max = a[i];
j = i;
}
}
if(max == 59)//??????????????60?????
break;
printf("%s\n", s[j]); //???s[i][10](?????)??s[i](??????) ???????max
a[j] = 300;//??????
}
for( i = 0;i < num; i++)
{
if(a[i] < 60)
printf("%s\n", s[i]); //???s[i][10](?????)??s[i](??????)
}
//getchar();
//getchar();???vc6.0?????
return 0;
} |
9 | 4355 | struct pa{//patient
char id[10];
int age;
int re;//register
}p[100],po[100],temp;
void main()
{
int n,i,j,pj=0,oldj=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",p[pj].id,&p[pj].age);
if(p[pj].age>=60)
{
po[oldj]=p[pj];
po[oldj].re=oldj;
oldj++;
}
else
{
p[pj].re=pj;
pj++;
}
}
for(i=0;i<oldj-1;i++)
{
for(j=i+1;j<oldj;j++)
{
if ( (po[i].age<po[j].age) || (po[i].age==po[j].age && po[i].re>po[j].re) )
{
temp=po[i];
po[i]=po[j];
po[j]=temp;
}
}
printf("%s\n",po[i].id);
}
printf("%s\n",po[i].id);
for(i=0;i<pj;i++)
printf("%s\n",p[i].id);
} |
9 | 4356 | void main()
{
int n,i,b[100],c[100],j=0,k,mid,p,m=0,max;
struct patient
{
char id[20];
int age;
}a[100];
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)
{
b[j++]=i;
}
else c[m++]=i;
}
for (i=0;i<j;i++)
{
max=i;
for (k=i;k<j;k++)
{
if (a[b[k]].age>a[b[max]].age) max=k;
}
mid=b[max];
for (k=max;k>i;k--)
b[k]=b[k-1];
b[i]=mid;
}
for (i=0;i<j;i++)
printf ("%s\n",a[b[i]].id);
for (i=0;i<m;i++)
printf ("%s\n",a[c[i]].id);
} |
9 | 4357 | int main()
{
char s[100][10];
int a[100],b[100],i,n,k,l,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",s[i],&a[i]);
b[i]=a[i];
}
for(k=n-1;k>0;k--)
{
for(i=0;i<k;i++)
{
if(b[i]>b[i+1])
{
l=b[i];
b[i]=b[i+1];
b[i+1]= l;
}
}
}
i=n-1;
while(b[i]>=60)
{
for(j=0;j<n;j++)
{
if(a[j]==b[i])
{
printf("%s\n",s[j]);
}
}
while(b[i-1]==b[i])
{
i--;
}
i--;
}
for(i=0;i<n;i++)
{
if(a[i]<60)
printf("%s\n",s[i]);
}
return 0;
} |
9 | 4358 | 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 | 4359 | int main()
{
int n,j,i;
scanf("%d",&n);
char a[n][10];
int b[n];
for(j=0;j<n;j++)
scanf("%s %d",a[j],&b[j]);
for(i=100;i>=60;i--)
{
for(j=0;j<n;j++)
{if(b[j]==i)
printf("%s\n",a[j]);
}
}
for(j=0;j<n;j++)
{
if(b[j]<60)
printf("%s\n",a[j]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
} |
9 | 4360 | struct information
{
char ID[10];
int age;
}*a;
void main()
{
int n,i,j,max,p,q=0;
scanf("%d",&n);
a=(struct information *)malloc(sizeof(struct information)*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>59) q++;
}
for(i=0;i<q;i++)
{
max=0;
for(j=0;j<n;j++)
{
if(max<a[j].age) {max=a[j].age;p=j;}
}
printf("%s\n",a[p].ID);
a[p].age=0;
}
for(i=0;i<n;i++)
{
if(a[i].age!=0) printf("%s\n",a[i].ID);
}
}
|
9 | 4361 |
char id[101][11];
int main()
{ int n;
int age[101],a[101];
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%s%d",id[i],&age[i]);
int j=i;
if (age[i]>=60)
{
for (;j>1&&age[a[j-1]]<age[i];j--)
a[j]=a[j-1];
}
a[j]=i;
}
for (int i=1;i<=n;i++)
printf("%s\n",id[a[i]]);
getchar();
getchar();
return 0;
}
|
9 | 4362 | int main(){
int age[N], n, i, k;
char id[N][LEN];
scanf("%d", &n);
for(i = 0; i < n; i++){
scanf("%s %d", id[i], &(age[i]));
}
int e; char e_id[10];
for(k = 1 ; k <= n; k++){
for(i = 0; i < n- k; i++){
if((age[i] <60&& age[i+1]>=60)||(age[i]>=60&&age[i+1]>=60&&age[i]<age[i+1])){
e = age[i+1];
strcpy(e_id, id[i+1]);
age[i+1] = age[i];
strcpy(id[i+1], id[i]);
age[i] = e;
strcpy(id[i], e_id);
}
}
}
for(i = 0; i < n; i++){
printf("%s\n", id[i]);
}
return 0;
} |
9 | 4363 | int n;
struct patients
{
char name[11];
int age;
}pat[100];
struct patold
{
char name[11];
int age;
}old[100];
struct patyoung
{
char name[11];
int age;
}young[100];
int y=0,o=0;
char nametemp[11];
int agetemp;
int main()
{
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&pat[i].name);
scanf("%d",&pat[i].age);
}
for(i=0;i<n;i++)
{
if(pat[i].age>=60)
{
strcpy(old[o].name,pat[i].name);
old[o].age=pat[i].age;
o++;
}
else
{
strcpy(young[y].name,pat[i].name);
young[y].age=pat[i].age;
y++;
}
}
for(i=1;i<o;i++)
{
for(j=0;j<o-i;j++)
{
if(old[j].age<old[j+1].age)
{
agetemp=old[j].age;
old[j].age=old[j+1].age;
old[j+1].age=agetemp;
strcpy(nametemp,old[j].name);
strcpy(old[j].name,old[j+1].name);
strcpy(old[j+1].name,nametemp);
}
}
}
for(i=0;i<o;i++)
printf("%s\n",old[i].name);
for(i=0;i<y;i++)
printf("%s\n",young[i].name);
return 0;
} |
9 | 4364 | int main()
{
struct patients
{
char id[10];
int age;
}temp;
struct patients patient[100];
struct patients old[100];
int i,j,n,first;
scanf("%d",&n);
first=0;
for (i=0;i<n;i++){
scanf("%s",patient[i].id);
scanf ("%d",&patient[i].age);
if (patient[i].age>=60){
old[first]=patient[i];
first=first+1;
}
}
for (i=0;i<first;i++){
for (j=0;j<first-i-1;j++){
if (old[j].age<old[j+1].age){
temp=old[j];
old[j]=old[j+1];
old[j+1]=temp;
}
}
}
for (i=0;i<first;i++){
printf("%s\n",old[i].id);
}
for (i=0;i<n;i++){
if (patient[i].age<60){
printf("%s\n",patient[i].id);
}
}
return 0;
}
|
9 | 4365 |
struct st
{
int age,he;
char num[15];
struct st *next;
};
struct st *creat(int n)
{
struct st *head,*p1,*p2;
int i,h=105;
p1=(struct st *)malloc(sizeof(struct st));
p2=p1;
head=p1;
for (i=1;i<=n;i++)
{
p1=(struct st *)malloc(sizeof(struct st));
scanf("%s %d",p1->num,&p1->age);
if (p1->age >= 60)
p1->he=p1->age*1000+h;
else p1->he=h;
p1->next=NULL;
p2->next=p1;
p2=p1;
h--;
}
return(head);
}
void paixu(struct st *head)
{
struct st *max,*p,*p1,*p2,*p3,*p4;
p1=head;
while(p1->next)
{
p2=p1->next;
max=p2;
p4=p2;
p=p2->next;
while(p)
{
if (p->he > max->he)
{
max=p;
p3=p4;
}
p=p->next;
p4=p4->next;
}
if (max>p1->next)
{
p3->next=max->next;
p1->next=max;
max->next=p2;
}
p1=p1->next;
}
}
void main()
{
struct st *creat(int n);
void paixu(struct st *head);
struct st *head,*p;
int n;
scanf("%d",&n);
head=creat(n);
paixu(head);
p=head->next;
while(p)
{
printf("%s\n",p->num);
p=p->next;
}
} |
9 | 4366 |
struct p
{
char id[11];
int age;
};
int main()
{
void sort(int n,struct p a[101]);
int n,i;
struct p a[101];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&a[i].id,&a[i].age);
}
sort(n,a);
return 0;
}
void sort(int n,struct p a[101])
{
int i,k=0;
for(i=0;i<n;i++)
{
if((a[i].age)>k)
k=(a[i].age);
}
for(;k>59;k--)
{
for(i=0;i<n;i++)
{
if((a[i].age)==k)
{
printf("%s\n",a[i].id);
(a[i].age)=0;
}
}
}
for(i=0;i<n;i++)
{
if((a[i].age)!=0)
{
printf("%s\n",a[i].id);
}
}
} |
9 | 4367 | int main()
{
int i,n,t=0,e,num=0,k;
char z[10];
struct point
{
char ID[10];
int age;
}a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&a[i].ID);
scanf("%d",&a[i].age);
}
for(i=0;i<n;i++)
{
if(a[i].age>=60)
{
num=num+1;
}
}
int f=num;
for(i=0;i<n;i++)
{
if(a[i].age>=60)
{
b[t].age=a[i].age;
strcpy(b[t].ID,a[i].ID);
t++;
}
if(a[i].age<60)
{
b[f].age=a[i].age;
strcpy(b[f].ID,a[i].ID);
f++;
}
}
for(i=0;i<num;i++)
{
for(k=0;k<num-i-1;k++)
{
if(b[k].age<b[k+1].age)
{
e=b[k].age;
b[k].age=b[k+1].age;
b[k+1].age=e;
strcpy(z,b[k+1].ID);
strcpy(b[k+1].ID,b[k].ID);
strcpy(b[k].ID,z);
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",b[i].ID);
}
return 0;
} |
9 | 4368 | 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 | 4369 |
int main()
{
int n,i,j;
struct s
{char id[10];
int age;
};
struct s S[100],Si;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",S[i].id,&S[i].age);
}
for(i=0;i<n-1;i++){
for(j=0;j<n-i-1;j++){
if(S[j+1].age>=60){
if(S[j].age<S[j+1].age){
Si=S[j];
S[j]=S[j+1];
S[j+1]=Si;
}
}
}
}
for(i=0;i<n;i++){
printf("%s\n",S[i].id);
}
} |
9 | 4370 |
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 | 4371 | struct person
{char ID[10];
int age;
}person[100];
void main()
{
int i,j=-1,k,n,max;
char s[100][10],a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&person[i].ID,&person[i].age);
for(i=0;i<n;i++)
{a[i]=person[i].age;
if(person[i].age>=60) j++;}
for(k=0;k<=j;k++)
{
max=0;
for(i=0;i<n;i++)
max=(max>=a[i])?max:a[i];
for(i=0;i<n;i++)
if(a[i]==max)
{printf("%s\n",person[i].ID);
a[i]=0;
break;
}
}
for(i=0;i<n;i++)
if(person[i].age<60) printf("%s\n",person[i].ID);
} |
9 | 4372 |
int main()
{
int n,i,t;
int u=0,k=0;
int a[N],b[N];
char s[N][10],h[N][10],j[N][10];
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%s %d", &s[i],&a[i]);
if(a[i]>=60){
b[u]=a[i];
strcpy(h[u],s[i]);
u++;
}
else{
strcpy(j[k],s[i]);
k++;
}
}
for(i=u-1;i>0;i--){
for(t=0;t<i;t++){
if(b[t]<b[t+1]){
int f;
f=b[t];
b[t]=b[t+1];
b[t+1]=f;
char tmp[10];
strcpy(tmp,h[t]);
strcpy(h[t],h[t+1]);
strcpy(h[t+1],tmp);
}
}
}
for(i=0;i<u;i++)
printf("%s\n", h[i]);
for(t=0;t<k;t++)
printf("%s\n", j[t]);
return 0;
} |
9 | 4373 | void main()
{
int n,i,j,a[100],b[100],c[100]={0},t,sum=0;char s[100][10],sb[100][10],st[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",s[i],a+i);if(a[i]>=60)
{
c[i]=1,b[sum]=a[i],strcpy(sb[sum],s[i]),sum++;
}}
for(i=1;i<sum;i++)for(j=0;j<sum-i;j++)if(b[j]<b[j+1])t=b[j],b[j]=b[j+1],b[j+1]=t,strcpy(st,sb[j]),strcpy(sb[j],sb[j+1]),strcpy(sb[j+1],st);
for(i=0;i<sum;i++)printf("%s\n",sb[i]);
for(i=0;i<n;i++)if(c[i]==0)printf("%s\n",s[i]);
}
|
9 | 4374 | struct ren
{
char id[12];
int ye;
struct ren *next;
};
int main()
{
int n;
char c[12];
int y;
int r;
struct ren *p1, *p2,*head;
int i;
scanf("%d", &n);
head = (struct ren *)malloc(sizeof(struct ren));
scanf("%s %d", c, &y);
strcpy(head->id, c);
head->ye = y;
head->next = 0;
for (i = 2; i <= n; i++)
{
scanf("%s %d", c, &y);
p1 = (struct ren *)malloc(sizeof(struct ren));
strcpy(p1->id, c);
p1->ye = y;
p1->next = 0;
if (y < 60)
{
p2 = head;
while (p2->next != 0)
p2 = p2->next;
p2->next = p1;
}
else
{
p2 = head;
if (y>p2->ye)
{
p1->next = head;
head = p1;
}
else
{
r = 0;
while (p2->next != 0)
{
if (p2->ye >= y&&p2->next->ye < y)
{
r = 1;
p1->next = p2->next;
p2->next = p1;
break;
}
p2 = p2->next;
}
if (r == 0)
{
p2->next = p1;
}
}
}
}
p1 = head;
do
{
printf("%s\n", p1->id);
p1 = p1->next;
} while (p1 != 0);
} |
9 | 4375 |
struct patients
{
int num;
char ID[10];
int age;
};
int main()
{
int n,i,j,y,o;
struct patients list[100],young[100],old[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
list[i].num=i;
scanf("%s %d",list[i].ID,&list[i].age);
}
y=0;
o=0;
for(i=0;i<n;i++)
{
if(list[i].age>=60){
old[o]=list[i];
o++;
}else{
young[y]=list[i];
y++;
}
}
for(i=1;i<o;i++)
{
for(j=0;j<o-i;j++)
{
if(old[j].age<old[j+1].age){
struct patients check;
check=old[j];
old[j]=old[j+1];
old[j+1]=check;
}
}
}
for(i=0;i<o;i++)
{
printf("%s\n",old[i].ID);
}
for(i=0;i<y;i++)
{
printf("%s\n",young[i].ID);
}
return 0;
}
|
9 | 4376 | struct node
{
char s[100];
int age,no;
}a[1000],b;
int check(int x,int y)
{
if(a[y].age<60 && a[x].age>=60) return 0;
if(a[y].age>=60 && a[x].age<60) return 1;
if(a[x].age<60 && a[y].age<60 && a[x].no>a[y].no) return 1;
if(a[x].age<60 && a[y].age<60 && a[x].no<a[y].no) return 0;
if(a[x].age>a[y].age) return 0;
if(a[x].age<a[y].age) return 1;
if(a[x].no<a[y].no) return 0;
if(a[x].no>a[y].no) return 1;
return 0;
}
int main()
{
int i,j,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d",&a[i].s,&a[i].age);
a[i].no=i;
}
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(check(i,j)==1){b=a[i];a[i]=a[j];a[j]=b;}
for(i=1;i<=n;i++)
printf("%s\n",a[i].s);
return 0;
} |
9 | 4377 | int main()
{ int n,i,j,k;
scanf("%d",&n);
struct p{
char num[100];
int age;
}pa[100],p[100],t;
for(i=0;i<n;i++)
{scanf("%s%d",&pa[i].num,&pa[i].age);}
i=n-1;
for(j=n-1;j>=0;j--)
{
if(pa[j].age<60)
{p[i]=pa[j];
i--;}
}
k=i+1;
for(j=n-1;j>=0;j--)
{
if(pa[j].age>=60)
{p[i]=pa[j];
i--;}
}
for(j=0;j<k;j++)
{for(i=0;i<k-j-1;i++)
{if(p[i].age<p[i+1].age)
{t=p[i];
p[i]=p[i+1];
p[i+1]=t;}
}
}
for(i=0;i<n;i++)
{printf("%s\n",&p[i].num);}
return 0;
}
|
9 | 4378 | main()
{
int n,i,j,k,temp,s,max;
int is_over_sixty_exist=1;
int age[100]={0},queue[100]={0};
char id[100][10]={'0'};
scanf("%d",&n);
for (i=0;i<n;i++){
queue[i]=i;
scanf("%s%d",id[i],&age[i]);
}
i=0;
while (is_over_sixty_exist){
max=0;
is_over_sixty_exist=0;
temp=queue[i];
for (j=0;j<n;j++){
if (age[j]>=60&&age[j]>max){
is_over_sixty_exist=1;
max=age[j];
queue[i]=j;
}
}
for (s=i+1;s<n;s++)
if (queue[s]==queue[i])
break;
age[queue[i]]=0;
if (is_over_sixty_exist){
if (s!=n){
for (k=s;k>=i+1;k--)
queue[k]=queue[k-1];
queue[i+1]=temp;
}
}
i++;
}
for (i=0;i<n;i++)
printf("%s\n",id[queue[i]]);
}
|
9 | 4379 | 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 | 4380 | main()
{
int a,b,d[100],e,f,g,i,j,x,y,z;
char c[100][100]; //g?60?????
scanf("%d",&a);
for(b=0;b<a;b++)
{
scanf("%s %d",c[b],&d[b]);
}
for(e=0;e<a;e++)
{
if(d[e]>=60)
{i=e;
break;
}
}
for(e=0,g=0;e<a;e++)
{
if (d[e]>=60)
g=g+1;
}
for(x=1;x<=g;x++)
{
for(e=0;e<a;e++)
{
if(d[e]>=60)
{
if(d[i]<d[e])
i=e;
}
}
printf("%s\n",c[i]);
d[i]=0;
}
for(z=0;z<a;z++)
{
if(d[z]!=0)
printf("%s\n",c[z]);
}
getchar();
getchar();
} |
9 | 4381 |
int main(){
int n,i;
scanf("%d",&n);
struct{
char id[10];
int age;
}br [100],*p,old[100],*q;
for(p=br;p<br+n;p++){
scanf("%s%d",&(p->id),&(p->age));
}
q=old;
int js=0;
for(p=br;p<br+n;p++){
if(p->age>=60){
q->age=p->age;
strcpy(q->id,p->id);
q++;
js++;
p->age=0;
}
}
int max=0;
for(i=0;i<js;i++){
for(q=old;q<old+js;q++){
if(q->age>(old+max)->age){
max=q-old;
}
}
printf("%s\n",(old+max)->id);
(old+max)->age=0;
}
for(p=br;p<br+n;p++){
if(p->age!=0){
printf("%s\n",p->id);
}
}
return 0;
}
|
9 | 4382 | 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 | 4383 | 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 | 4384 | int main()
{
int n,i,j,k;
int age[1000],a[1000],t;
char ID[1000][1000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&ID[i],&age[i]);
j=n-1;
k=0;
for(i=n-1;i>=0;i--)
{
if(age[i]<60)
{
a[j]=i;
j--;
}
}
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
a[k]=i;
k++;
}
}
for(i=0;i<k;i++)
{
for(j=k-1;j>i;j--)
{
if(age[a[j]]>age[a[j-1]])
{
t=a[j];
a[j]=a[j-1];
a[j-1]=t;
}
}
}
for(i=0;i<n;i++)
printf("%s\n",ID[a[i]]);
getchar();
getchar();
getchar();
return 0;
}
|
9 | 4385 | main()
{ char temp_0[10],id[100][10];
int i,j,n,max,age[100],num[100],yes[100],ncount=1,temp,num_1;
scanf("%d",&n);
for(i=0;i<n;i++)
{num[i]=i;
scanf("%s %d",id[i],&age[i]);
}
for(j=0;j<n;j++)//????????????
{
for(i=0;i<n-j-1;i++)//??
{ if(age[i]<age[i+1])
{ strcpy(temp_0,id[i]);//??????????????
temp=age[i];
num_1=num[i];
strcpy(id[i],id[i+1]);
age[i]=age[i+1];
num[i]=num[i+1];
age[i+1]=temp;
strcpy(id[i+1],temp_0);
num[i+1]=num_1; }
}}
for(i=0;i<n;i++)//???60?????
{if(age[i]>=60)
printf("%s\n",id[i]);
}
for(j=0;j<n;j++)// ???????
{for(i=0;i<n-j-1;i++)
{if(num[i]>num[i+1])
{ strcpy(temp_0,id[i]);
temp=age[i];
num_1=num[i];
strcpy(id[i],id[i+1]);
age[i]=age[i+1];
num[i]=num[i+1];
age[i+1]=temp;
strcpy(id[i+1],temp_0);
num[i+1]=num_1;
}}
}
for(i=0;i<n;i++)
{if(age[i]<60)//????60?????
printf("%s\n",id[i]);}
}
|
9 | 4386 | 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 | 4387 | 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 | 4388 | 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 | 4389 | void main()
{
int n,i,j,k,m=0,sum=59;
int a[100],b[100];
char c[101][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",c[i],&a[i]);
if(a[i]>=60) m++;
}
for(j=0;j<m;j++)
{
for(i=0;i<n;i++)
{
if(a[i]>sum)
{
sum=a[i];
k=i;
}
else continue;
}
a[k]=-1;
b[j]=k;
sum=59;
}
for(i=0;i<m;i++)
printf("%s\n",c[b[i]]);
for(i=0;i<n;i++)
{
if(a[i]>=0&&a[i]<60)
printf("%s\n",c[i]);
}
} |
9 | 4390 |
int main (){
int i, n,j=0,e,x,a=0,k;
int y[100],year[100];
char id[10],t[100][10],ee[10],p[100][10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",id,&x);
if(x>=60){
y[j]=x;
strcpy(t[j],id);
j++;
}
else {
year[a]=x;
strcpy(p[a],id);
a++;
}
}
for(k=1;k<=j;k++){
for(i=0;i<j-k;i++){
if(y[i]<y[i+1]){
e=y[i+1];
y[i+1]=y[i];
y[i]=e;
strcpy(ee,t[i+1]);
strcpy(t[i+1],t[i]);
strcpy(t[i],ee);
}
}
}
for(i=0;i<j;i++){
printf("%s\n",t[i]);
}
for(k=0;k<a;k++){
printf("%s\n",p[k]);
}
return 0;
} |
9 | 4391 |
int main()
{
struct people{
char num[10];int age;
} peo1[100],peo2[100],peo3[100],e;
int n,i,j,m,k;
scanf("%d",&n);
char s[100][10];
for(i=0;i<n;i++)
{
scanf("%s",peo1[i].num);
scanf("%d",&peo1[i].age);
}
j=0;
m=0;
for(i=0;i<n;i++)
{
if(peo1[i].age>=60)
{
peo2[j]=peo1[i];
j++;
}
else if(peo1[i].age<60)
{
peo3[m]=peo1[i];
m++;
}
}
for(k=1;k<=j;k++)
{
for(i=0;i<j-k;i++)
{
if(peo2[i].age<peo2[i+1].age)
{
e=peo2[i+1];
peo2[i+1]=peo2[i];
peo2[i]=e;
}
}
}
int a,b,c;
for(a=0,i=0;a<j;a++,i++)
{
strcpy(s[a],peo2[i].num);
}
for(a=j,b=0;a<n;a++,b++)
{
strcpy(s[a],peo3[b].num);
}
for(c=0;c<n;c++)
{
printf("%s\n",s[c]);
}
return 0;
}
|
9 | 4392 | int main()
{
struct m{
char id[10];
int year;
}p[100],a[100],tmp;
int n,i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",p[i].id,&p[i].year);
if(p[i].year>=60){
a[k]=p[i];
k++;
p[i].year=0;
}
}
for(i=0;i<k;i++){
for(j=k-1;j>i;j--){
if(a[j].year>a[j-1].year){
tmp=a[j-1];
a[j-1]=a[j];
a[j]=tmp;
}
}
}
for(i=0;i<k;i++){
printf("%s\n",a[i].id);
}
for(i=0;i<n;i++){
if(p[i].year==0)
continue;
printf("%s\n",p[i].id);
}
return 0;
} |
9 | 4393 | struct {
char ID[10];
int nian;
}patient[100],old[100],qita[100],temp;
int main()
{
int n,i,k,e,num,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",patient[i].ID,&patient[i].nian);
}
num=0;
for(i=0;i<n;i++){
if(patient[i].nian>=60){
num=num+1;
}
}
k=0;
for(i=0;i<n;i++){
if(patient[i].nian>=60){
old[k]=patient[i];
k=k+1;
}
}
k=0;
for(i=0;i<n;i++){
if(patient[i].nian<60){
qita[k]=patient[i];
k=k+1;
}
}
for(j=1;j<num;j++){
for(k=0;k<num-j;k++){
if(old[k+1].nian>old[k].nian){
temp=old[k+1];
old[k+1]=old[k];
old[k]=temp;
}
}
}
for(k=0;k<num;k++){
printf("%s\n",old[k].ID);
}
for(k=0;k<n-num;k++){
printf("%s\n",qita[k].ID);
}
return 0;
} |
9 | 4394 | struct person
{
char id[20];
int age;
};
void main()
{
int n,i,j,m=0,k=0,z;
struct person t,*s,*o,*age;
scanf("%d",&n);
s=(struct person *)malloc(n*sizeof(struct person));
o=(struct person *)malloc(n*sizeof(struct person));
age=(struct person *)malloc(n*sizeof(struct person));
for(i=0;i<n;i++)
{scanf("%s %d",(*(s+i)).id,&(*(s+i)).age);
if ((*(s+i)).age>=60) {*(o+k)=*(s+i);k++;}
else {*(age+m)=*(s+i);m++;}
}
for(i=0;i<k;i++)
{for(j=k-1;j>i;j--)
if ((*(o+j)).age>(*(o+j-1)).age) {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",(*(age+i)).id);
} |
9 | 4395 |
struct patient
{
char name[20];
int age;
} line[202], temp;
int main()
{
int n, i, j;
scanf("%d", &n);
for(i=1;i<=n;i++)
{
scanf("%s", &line[i].name);
scanf("%d", &line[i].age);
}
for(i=1;i<=n;i++)
{
for (j=n;j>i;j--)
{
if(line[j].age>=60){
if(line[j].age>line[j-1].age)
{
temp=line[j];
line[j]=line[j-1];
line[j-1]=temp;
}
}
}
}
for(i=1;i<=n;i++)
{
printf("%s\n", line[i].name);
}
return 0;
} |
9 | 4396 | int main()
{
int a[100],i,e,k;
char id[100][10],p[10];
int n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",id[i],&a[i]);
}
for(k=1;k<=n;k++){
for(i=n-1;i>k-1;i--){
if(a[i]>a[i-1]&&a[i]>=60){
e=a[i];
a[i]=a[i-1];
a[i-1]=e;
strcpy(p,id[i]);
strcpy(id[i],id[i-1]);
strcpy(id[i-1],p);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",id[i]);
}
return 0;
}
|
9 | 4397 | 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 | 4398 |
int main()
{
int n,age[100],i,j,k=0,e0,m,a;
int AGE[100];
char id[100][10];
char ID[100][10];
char e[100][10];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%s %d",&id[i],&age[i]);
m=strlen(id[0]);
for(i=0;i<n;i++) id[i][m]='\0';
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
for(a=0;a<=m;a++) ID[k][a]=id[i][a];
AGE[k]=age[i];
k++;
}
}
for(i=1;i<=k;i++) for(j=0;j<k-i;j++) if(AGE[j]<AGE[j+1])
{
e0=AGE[j+1];
AGE[j+1]=AGE[j];
AGE[j]=e0;
for(a=0;a<=m;a++)
{
e[0][a]=ID[j+1][a];
ID[j+1][a]=ID[j][a];
ID[j][a]=e[0][a];
}
}
for(i=0;i<n;i++)
{
if(age[i]<60)
{
for(a=0;a<=m;a++) ID[k][a]=id[i][a];
k++;
}
}
for(i=0;i<n;i++) printf("%s\n",ID[i]);
return 0;
} |
9 | 4399 | int main(){
struct man
{
char a[11];
int y;
}man[100];
int n;
scanf("%d",&n);
char b[11];
int y;
int i,j;
char c[100][11];
int m=0,k=0;
for(i=0;i<n;i++){
scanf("%s%d",b,&y);
if(y>=60){
strcpy(man[k].a,b);
man[k].y=y;
k++;
}
else{
strcpy(c[m],b);
m++;
}
}
for(i=1;i<k;i++){
for(j=0;j<k-i;j++){
int y1,y2;
y1=man[j].y;
y2=man[j+1].y;
if(y1<y2){
y=man[j+1].y;
man[j+1].y=man[j].y;
man[j].y=y;
strcpy(b,man[j+1].a);
strcpy(man[j+1].a,man[j].a);
strcpy(man[j].a,b);
}
}
}
for(i=0;i<k;i++){
strcpy(b,man[i].a);
printf("%s\n",b);
}
for(i=0;i<m;i++){
strcpy(b,c[i]);
printf("%s\n",b);
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.