id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
4,300 | 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 |
4,301 | struct patient
{
char a[100];
int age;
}pat[110],pat1[110];
void bubble(int n)
{
int i,j;
struct patient temp;
for(i=1;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(pat1[j].age<pat1[j+1].age)
{
temp=pat1[j];
pat1[j]=pat1[j+1];
pat1[j+1]=temp;
}
}
}
}
void main()
{
int n,i,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pat[i].a,&pat[i].age);
if(pat[i].age>=60)
pat1[k++]=pat[i];
}
bubble(k);
for(i=0;i<k;i++)
printf("%s\n",pat1[i].a);
for(i=0;i<n;i++)
{
if(pat[i].age<60)
printf("%s\n",pat[i].a);
}
}
| 9 |
4,302 | 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 |
4,303 | struct student
{
char num[1000];
int age;
struct student *next;
};
struct student *creat(int n)
{
struct student *p1,*p2,*head;
int i;
for (i = 0;i < n;i++)
{
p1 = (struct student*)malloc(len);
scanf("%s%d",p1->num,&p1->age);
p1->next = NULL;
if(i == 0)
{
p2 = p1;
head = p1;
}
else
{
p2->next = p1;
p2 = p1;
}
}
return (head);
}
struct student *trans(struct student *head,int n)
{
struct student *p1,*p2,*p3,*p4,*q;
int i,j;
for (i = 0;i<n;i++)
{
p1 = head;
p2 = p1->next;
p3 = p2->next;
p4 = head;
for(j = 0;p1->next != NULL;j++)
{
if(p2->age >=60)
{
if(p1->age < p2->age)
{
if(p1 == head)
{
p2->next = p1;
p1->next = p3;
head = p2;
q = p1;
p1 = p2;
p2 = q;
p4 = head;
}
else if(p2 ->next != NULL)
{
p1->next = p3;
p2->next = p1;
p4->next = p2;
q = p1;
p1 = p2;
p2 = q;
}
else
{
p2->next = p1;
p4 ->next = p2;
p1->next = 0;
q = p1;
p1 = p2;
p2 = q;
}
}
}
if(p1 != head)
p4 = p4->next;
p1 = p1->next;
p2 = p2->next;
if (p3 != NULL)
p3 = p3->next;
}
q = head;
}
return(q);
}
print(struct student *head)
{
struct student *p;
p = head;
for (;p !=NULL;p = p->next)
printf("%s\n",p->num);
}
main()
{
struct student *p;
int n;
scanf("%d",&n);
p = creat(n);
p = trans(p,n);
print(p);
}
| 9 |
4,304 | 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 |
4,305 |
typedef struct
{
char id[11];
int age;
}MAN;
void sort(MAN* array, int nSize)
{
int i,j;
for(i = 0; i < nSize ; i++)
{
for(j = nSize - 1; j > i; j--)
{
if( array[j].age >= 60 && array[j].age > array[j-1].age)
{
MAN temp = array[j];
array[j]= array[j-1];
array[j-1] = temp;
}
}
}
}
int main()
{
int i, n;
MAN * array = 0;
double ava, maxgap = 0;
scanf("%d", &n);
array = (MAN*)malloc(n * sizeof(MAN));
for(i = 0; i < n ; i++)
{
scanf("%s %d", array[i].id, &(array[i].age));
}
sort(array, n);
for(i = 0; i < n; i++)
{
printf("%s\n",array[i].id);
}
free(array);
return 0;
} | 9 |
4,306 | int main()
{
int n,i,m=0,r=0,e,j;
char id[100][10],a[100][10],b[100][10],c[100];
int nl[100],am[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",id[i],&nl[i]);
}
for(i=0;i<n;i++){
if(nl[i]>=60){
strcpy(a[m],id[i]);
am[m]=nl[i];
m++;
}
else{
strcpy(b[r],id[i]);
r++;
}
}
for(i=m-1;i>0;i--){
for(j=0;j<i;j++){
if(am[j]<am[j+1]){
e=am[j+1];
am[j+1]=am[j];
am[j]=e;
strcpy(c,a[j+1]);
strcpy(a[j+1],a[j]);
strcpy(a[j],c);
}
}
}
for(i=0;i<m;i++){
puts(a[i]);
}
for(i=0;i<r;i++){
puts(b[i]);
}
return 0;
} | 9 |
4,307 | int main()
{
int i,j,n,e;
char q[11];
struct point
{
char name[11];
int age;
}
p[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",&p[i].name,&p[i].age);
}
for(j=0;j<n;j++)
{
for(i=0;i<n-1;i++)
{
if((p[i].age>60||p[i].age==60)&&(p[i+1].age>60||p[i+1].age==60)&&p[i].age<p[i+1].age||p[i].age<60&&(p[i+1].age>60||p[i+1].age==60))
{
e=p[i].age;
p[i].age=p[i+1].age;
p[i+1].age=e;
strcpy(q,p[i].name);
strcpy(p[i].name,p[i+1].name);
strcpy(p[i+1].name,q);
}
}
}
for(i=0;i<n;i++)
{
printf("%s",p[i].name);
if(i!=n-1)
{
printf("\n");
}
}
return 0;
}
| 9 |
4,308 | struct xinxi
{
char id[10];
int age;
};
struct xinxi old[100];
void main()
{
int i,n,j;
int maxage=0;
scanf("%d",&n);
for(i=0;i<n;i++) /*???????id???????????????????'\0'????????????????????????????????id,????????????'\0'????????????*/
{
scanf("%s %d",old[i].id,&old[i].age);
}
for(i=0;i<n;i++)
if(maxage<old[i].age)maxage=old[i].age;
for(j=maxage;j>=60;j--)
for(i=0;i<n;i++)
if(old[i].age==j)puts(old[i].id);
for(i=0;i<n;i++)
if(old[i].age<60)puts(old[i].id);
}
| 9 |
4,309 | struct hospital
{
char ID[11];
int age;
}old[100],young[100],all[100],temp;
void sequence(struct hospital matrix[],int n)
{
int i,j;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(matrix[j].age<matrix[j+1].age)
{
temp=matrix[j];
matrix[j]=matrix[j+1];
matrix[j+1]=temp;
}
}
}
}
/*
??????????????????
{
int i,j,k;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(matrix[j].age>matrix[k].age)
{
k=j;
}
}
if(k!=i)
{
temp=matrix[i];
matrix[i]=matrix[k];
matrix[k]=temp;
}
}
}
*/
int main()
{
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s %d",all[i].ID,&all[i].age);
}
int oi=0,yi=0;
for(i=0;i<n;i++)
{
if(all[i].age>=60)
{
old[oi]=all[i];
oi++;
}
else
{
young[yi]=all[i];
yi++;
}
}
sequence(old,oi);
for(i=0;i<oi;i++)
{
printf("%s\n",old[i].ID);
}
for(i=0;i<yi;i++)
{
printf("%s\n",young[i].ID);
}
return 0;
}
| 9 |
4,310 | 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 |
4,311 | int main()
{
int n,i=0,x;
scanf("%d",&n);
int age[100];
char num[100][10];
for(i=0;i<n;i++)
{
scanf("%s %d",num[i],&age[i]);
if (age[i]<60)
age[i]=0;
}
loop:for(i=0;i<n;i++)
{
x=0;
if (age[i]>=60)
{ for(int j=0;j<n;j++)
{
if(age[j]>age[i])
x=x+1;}
if (x==0)
{printf("%s\n",num[i]);
age[i]=1;
goto loop;}
}
}
for(i=0;i<n;i++)
{
if (age[i]==0)
printf("%s\n",num[i]);
}
getchar();
getchar();
} | 9 |
4,312 |
int main()
{
char str[100][100];//ID
int s1[100],sz[100],t[100];
int n,i,p,k;
scanf("%d",&n);//???
int j=0;
for(i=0;i<n;i++)
{
scanf("%s %d",str[i],&sz[i]);//id
if(sz[i]>=60)//panduannianling
{
t[j]=i;//cunrulingyishuzu
s1[j]=sz[i];
j++;
}//gongyou 'j' ren
}
for(k=1;k<=j;k++)//paixu
{
for(p=0;p<j-k;p++)
{
if(s1[p]<s1[p+1])//congdadaoxiao
{
int e,f;
e=s1[p+1];
s1[p+1]=s1[p];
s1[p]=e;
f=t[p+1];
t[p+1]=t[p];
t[p]=f;
}
}
}
for(p=0;p<j;p++)
{
printf("%s\n",str[t[p]]);
}
for(i=0;i<n;i++)
{
if(sz[i]<60)
printf("%s\n",str[i]);
}
return 0;
}
| 9 |
4,313 | struct pa{
char name[10];
int age;
struct pa *next;
};
void sort(struct pa *head,struct pa *s)
{
struct pa *p1,*p2;
p1=head->next;
p2=head;
while(p1&&p1->age>=s->age)
{
p2=p1;
p1=p1->next;
}
p2->next=s;
s->next=p1;
}
void creat(struct pa *head,struct pa *s)
{
struct pa *p2,*p1;
p1=head->next;
p2=head;
while(p1)
{
p2=p1;
p1=p1->next;
}
p2->next=s;
s->next=p1;
}
struct pa * input()
{
int i,n;
struct pa *s,*head1,*head2,*p1,*p2;
head1=(struct pa *)malloc(len);
head2=(struct pa *)malloc(len);
head1->next=NULL;
head2->next=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
s=(struct pa *)malloc(len);
scanf("%s%d",s->name,&s->age);
if(s->age>=60) sort(head1,s);
else creat(head2,s);
}
p1=head1->next;
p2=head1;
while(p1)
{
p2=p1;
p1=p1->next;
}
p2->next=head2->next;
return(head1);
}
void print(struct pa *head)
{
struct pa *p;
p=head->next;
while(p)
{
printf("%s\n",p->name);
p=p->next;
}
}
void main()
{
struct pa *head;
head=input();
print(head);
}
| 9 |
4,314 |
int num,n=0;
struct pa
{
char id[10];
int age;
int o;
}*p;
int operate()
{
struct pa *pi,*pj;
int agem=0,om=0;
for(pi=p;pi<p+num;pi++)
{
if(pi->o==0)
continue;
for(pj=p;pj<p+num;pj++)
{
if(pj->age<pi->age)
pi->o++;
}
if(pi->o>om)
om=pi->o;
}
return om;
}
void print(int om)
{
int k;
struct pa *pi;
for(k=om;k>=0;k--)
for(pi=p;pi<p+num;pi++)
{
if(pi->o==k)
{
if(n==0)
{
printf("%s",pi->id);
n++;
}
else
printf("\n%s",pi->id);
}
}
}
main()
{
scanf("%d",&num);
struct pa *pi;
int om;
p=(struct pa*)malloc(num*sizeof(struct pa));
for(pi=p;pi<p+num;pi++)
{
scanf("%s %d",pi->id,&pi->age);
if(pi->age>=60)
pi->o=1;
else pi->o=0;
}
om=operate();
print(om);
} | 9 |
4,315 | struct myturn
{
char ID[10]; int age;
};
int main()
{
int n,i,j=0,max=0;
struct myturn patient[100];
scanf("%d",&n); // ???????
for(i=0;i<n;i++){
scanf("%s%d",&patient[i].ID,&patient[i].age);
if(patient[i].age>max) max=patient[i].age; // ?????????
}
if(max>=60){ // ??????max??????????
for(max;max>=60;max--){
for(i=0;i<n;i++){
if(patient[i].age==max) {
printf("%s\n",patient[i].ID); //???????????0???flag?
patient[i].age=0; j++;} } } }
for(i=0;i<n;i++){ // ??????ID?
if(patient[i].age!=0){ printf("%s",patient[i].ID);
j++;
if(j<n) printf("\n");}
}
return 0;
} | 9 |
4,316 | struct patient
{
char id[10];
int age;
struct patient * next;
};
int n;
struct patient * creat(int x)
{
struct patient * head;
struct patient *p1,*p2;
n=0;
p1=p2=(struct patient *)malloc(LEN);
scanf("%s %d\n",p1->id,&p1->age);
head=NULL;
while(n!=x)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct patient *)malloc(LEN);
scanf("%s %d\n",p1->id,&p1->age);
}
p2->next=NULL;
return(head);
}
void main()
{
int m,i,j,v,t,*b;
struct patient *head,*p1;
b=(int*)malloc(100*sizeof(int));
scanf("%d\n",&m);
head=creat(m);
p1=head;
for(i=0;i<m;i++) {*(b+i)=p1->age;p1=p1->next;}
for(j=0;j<m-1;j++)
for(i=0;i<m-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<m;i++) if(*(b+i)<60) {v=i;break;}
p1=head;
for(j=0;j<v;j++)
{
p1=head;
while(p1!=NULL)
{
if(p1->age==*(b+j) && (j==0 || *(b+j)!=*(b+j-1))) printf("%s\n",p1->id);
p1=p1->next;
}
}
p1=head;
while(p1 != NULL)
{
if(p1->age<60) printf("%s\n",p1->id);
p1=p1->next;
}
} | 9 |
4,317 | void main()
{
struct patient
{ char ID[10];
int age;
}pa[100];
int n,i,t,j,k;
char m[10],str[100][100];
int a[100],b[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&pa[i].ID,&pa[i].age);
a[i]=pa[i].age;
strcpy(str[i],pa[i].ID);
}
for(i=0,j=0;i<n;i++,j++)
{
if(a[i]>=60)
b[j]=a[i];
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(b[j+1]>b[j])
{
t=b[j];
strcpy(m,pa[j].ID);
b[j]=b[j+1];
strcpy( pa[j].ID,pa[j+1].ID);
b[j+1]=t;
strcpy(pa[j+1].ID,m);
}
}
}
for(i=0;i<n;i++)
{
if(b[i]!=0)
printf("%s\n",pa[i].ID);
}
for(i=0;i<n;i++)
{
if(a[i]<60)
printf("%s\n",str[i]);
}
}
| 9 |
4,318 | struct patient
{
char id[20];
int age;
};
int main()
{
int i,j,tem,n,len;
char id[20];
struct patient a[200];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%s%d",a[i].id,&a[i].age);
for (i=0;i<n;i++)
{
for (j=n-2;j>=i;j--)
if (a[j+1].age>=60&&a[j+1].age>a[j].age)
{
tem=a[j].age;
a[j].age=a[j+1].age;
a[j+1].age=tem;
len=strlen(a[j].id);
strcpy(id,a[j].id);
id[len]='\0';
strcpy(a[j].id,a[j+1].id);
strcpy(a[j+1].id,id);
}
printf("%s\n",a[i].id);
}
return 0;
} | 9 |
4,319 | void main()
{
int n,m,i,j,max,l,sign=0;
scanf("%d",&n);
struct tt
{
char pp[10];
int age;
struct tt *next;
};
struct tt *head,*p1,*p2,*p3;
head=(struct tt * )malloc(LEN);
p1=head; p2=head;
scanf("%s",head->pp);
scanf("%d",&head->age);
for(i=1;i<n;i++)
{
p1=(struct tt * )malloc(LEN);;
p2->next=p1;
scanf("%s",p1->pp);
scanf("%d",&p1->age);
p2=p1;
}
p2->next=NULL;
for(i=1;i<=n;i++)
{
if(sign==1)
{
printf("%s\n",head->pp);
head=head->next;
}
else if(sign==0)
{
max=(-1);
for(p2=NULL,p1=head;p1!=NULL;p1=p1->next)
{
if(p1->age>max) {max=p1->age; p3=p2;}
p2=p1;
}
if(max<60) {sign=1; i--; continue;}
else if(max>=60)
{
if(p3==NULL)
{
printf("%s\n",head->pp);
head=head->next;
}
else
{
p1=p3->next;
printf("%s\n",p1->pp);
p3->next=p1->next;
}
}
}
}
} | 9 |
4,320 | int main()
{ struct peo
{ char num[10];
int old;
struct peo *next;
};
struct peo *p,*p1,*p2,*p3,*head1,*head2,*head3;
int n,i,j,k;
p=p1=p2=p3=head1=head2=head3=(struct peo *)malloc
(sizeof(struct peo));
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{ scanf("%s%d",&p1->num,&p1->old);
if (i==1) head1=p1;
else p2->next=p1;
p2=p1;
p1=(struct peo *)malloc(sizeof(struct peo));
}
for (i=1;i<=n;i++)
{ p1=head1;p2=head1;
for (j=1;j<=(n+1-i);j++)
{if (p1->old>p2->old&&p1->old>=60) {p2=p1;}
p1=p1->next;}
if (i==1) head2=p2;
else p->next=p2;
p=p2;
p1=head1;p3=head1;
for (j=1;j<=(n-i+1);j++)
{if (p1->num==p2->num) {if (j==1) head1=p1->next;
else p3->next=p1->next;}
p3=p1;p1=p1->next;
}
}
p=head2;
for (i=1;i<=n;i++)
{printf("%s\n",p->num);p=p->next;}
}
| 9 |
4,321 | int main()
{
int n,i,j,age[100],e;
char id[100][10],ex[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",id[i],&age[i]);
}
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if((age[j]<age[j+1]&&age[j]>=60)||(age[j]<age[j+1]&&age[j+1]>=60)){
e=age[j];
age[j]=age[j+1];
age[j+1]=e;
strcpy(ex,id[j]);
strcpy(id[j],id[j+1]);
strcpy(id[j+1],ex);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",id[i]);
}
return 0;
}
| 9 |
4,322 | 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 |
4,323 | void main()
{
int n,i,j;
int a[200],t;
char b[200][11],b1[11];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&b[i],&a[i]);
for(i=0;i<n;i++)
for(j=0;j<n-i;j++)
if(a[j+1]>=60&&a[j]<a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
strcpy(b1,b[j]);
strcpy(b[j],b[j+1]);
strcpy(b[j+1],b1);
}
for(i=0;i<n;i++)
printf("%s\n",b[i]);
}
| 9 |
4,324 | struct man
{
char num[10];
int age;
int nu;
struct man *next;
};
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);
}
struct man *insert(struct man *head,struct man *stud,int n)
{struct man *p0,*p1,*p2;
p1=head;
p0=stud;
scanf("%s %d",p0->num,&p0->age);
p0->nu=n+1;
p0->next=NULL;
if(head==NULL)
head=p0;
else
{while((f(p0->num,p0->age,p0->nu,p1->num,p1->age,p1->nu)<0)&&(p1->next!=NULL))
{p2=p1;
p1=p1->next;}
if(f(p0->num,p0->age,p0->nu,p1->num,p1->age,p1->nu)>0)
{if(head==p1)head=p0;
else p2->next=p0;
p0->next=p1;}
else
{p1->next=p0;}
}
return(head);
}
void print(struct man *head,int n)
{struct man *p;
int k;
p=head;
for(k=0;k<n;k++)
{printf("%s\n",p->num);
p=p->next;}
}
void main()
{
int n,k;
struct man *head,*stu;
head=NULL;
scanf("%d",&n);
for(k=0;k<n;k++)
{stu=(struct man *)malloc(LEN);
head=insert(head,stu,k);
}
print(head,n);
} | 9 |
4,325 | void main()
{
int age[100],i,j,k,p=0,n;
char a[100][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&a[i],&age[i]);
if(age[i]>=60)p++;
}
for(j=1;j<=p;j++)
{
k=0;
for(i=0;i<n;i++)
{
if(age[i]>age[k])
k=i;
}
printf("%s\n",a[k]);
age[k]=0;
}
for(i=0;i<n;i++)
{
if(age[i]!=0)
{
printf("%s\n",a[i]);
}
}
} | 9 |
4,326 | int main()
{
int n,i,j,a[100],b[100],c[100];
char d[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",d[i],&a[i]);
for(j=0;j<=n;j++)
if(a[j]>=60)
b[j]=a[j]*1000-j;
else b[j]=1000-j;
for(j=0;j<=n;j++)
c[j]=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(b[j]>=b[i])
c[i]++;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(c[j]==i+1)
printf("%s\n",d[j]);
} | 9 |
4,327 | struct pa
{
char id[11];
int age;
struct pa *next;
};
struct pa *insert(struct pa *head,struct pa * new1)
{
struct pa *p0,*p1,*p2;
p1=head;
p0=new1;
if(head==NULL)
{
head=p0;
p0->next=NULL;
}
else if(p0->age>=60)
{
while((p1->age>=p0->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;
}
}
else
{
p1=head;
while(p1!=NULL)
{
p2=p1;
p1=p1->next;
}
p2->next=p0;
p0->next=NULL;
}
return(head);
}
void main()
{
struct pa *p,*head;
int n,i;
head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p=(struct pa *)malloc(sizeof(struct pa));
scanf("%s%d\n",p->id,&p->age);
head=insert(head,p);
}
p=head;
while(p!=NULL)
{
printf("%s\n",p->id);
p=p->next;
}
} | 9 |
4,328 | 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 |
4,329 | void main()
{
struct patient
{
char a[11];
int b;
}p[100];
int n,i,j=0,m,t;
char c[100][11],string[11];
int d[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",p[i].a,&p[i].b);
for(i=0;i<n;i++)
{
if(p[i].b>=60)
{
strcpy(c[j],p[i].a);
d[j]=p[i].b;
j++;
}
}
m=j;
for(j=0;j<m-1;j++)
for(i=0;i<m-1-j;i++)
if(d[i]<d[i+1])
{
t=d[i];
d[i]=d[i+1];
d[i+1]=t;
strcpy(string,c[i]);
strcpy(c[i],c[i+1]);
strcpy(c[i+1],string);
}
for(i=0;i<m;i++)
printf("%s\n",c[i],d[i]);
for(i=0;i<n;i++)
{
if(p[i].b<60)
printf("%s\n",p[i].a,p[i].b);
}
} | 9 |
4,330 | int main()
{
int n,i,j,t,m,x,k;
char a[100][100],b[100],c[100],d[100][100],e[100],f[100][100],s[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",a[i],&b[i]);
k=0;
for(i=0;i<n;i++)
{
if(b[i]>=60)
{c[k]=b[i];strcpy(d[k],a[i]);k++;}
}
for(i=0;i<k-1;i++)
{
for(j=0;j<k-1-i;j++)
{
if(c[j]<c[j+1]){t=c[j];c[j]=c[j+1];c[j+1]=t;strcpy(s,d[j]);strcpy(d[j],d[j+1]);strcpy(d[j+1],s);}
}
}
for(i=0;i<k;i++)
printf("%s\n",d[i]);
m=0;
for(i=0;i<n;i++)
{
if(b[i]<60){e[m]=b[i];strcpy(f[m],a[i]);m++;}
}
for(i=0;i<m;i++)
printf("%s\n",f[i]);
}
| 9 |
4,331 | struct a
{int year;
char id[10];
struct a *next;
};
struct a *create(int n)
{struct a *p1,*p2,*head;
int i;
p1=(struct a*)malloc(len);
scanf("%s%d",p1->id,&p1->year);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<n;i++)
{p1=(struct a*)malloc(len);
scanf("%s%d",p1->id,&p1->year);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return head;
}
void main()
{
struct a *head,*p,*q,*t[100];
int m,i,j=0,k;
scanf("%d",&m);
head=create(m);
p=head;
for(i=0;i<m;i++)
{if(p->year>=60){t[j]=p;j++;}
p=p->next;
}
for(k=0;k<j-1;k++)
for(i=0;i<j-1-k;i++)
if(t[i]->year<t[i+1]->year)
{p=t[i];
t[i]=t[i+1];
t[i+1]=p;
}
for(i=0;i<j;i++)
printf("%s\n",t[i]->id);
p=head;
j=0;
for(i=0;i<m;i++)
{if(p->year<60){t[j]=p;j++;}
p=p->next;
}
for(i=0;i<j;i++)
printf("%s\n",t[i]->id);
}
| 9 |
4,332 | struct patience
{
int shunxu;
char id[10];
int age;
} pa[100];
int main()
{
int n,i,j,p=60,q=0;
scanf("%d",&n);
int a[n];
int b[n],c[n];
for(i=0;i<n;i++)
{
scanf("%s%d",&pa[i].id,&pa[i].age);
}
for(i=0;i<n;i++){
if(pa[i].age>=60)
{
q++;
}
}
do{
for(i=0;i<n;i++)
{
if(pa[i].age>=p)
{
p=pa[i].age;
}
}
for(i=0;i<n;i++)
{
if(pa[i].age==p){
printf("%s\n",pa[i].id);
pa[i].age=0;
}
}
p=60;
q--;
}
while(q>0);
for(i=0;i<n;i++)
{
if(pa[i].age<60 && pa[i].age>0){
printf("%s\n",pa[i].id);
}
}
return 0;
}
| 9 |
4,333 | main()
{
int n,b[100],d[100],j=0,k,l,t,i;
scanf("%d",&n);
char a[n][10],c[n][10];//??????? ????????????
for(i=0;i<n;i++)
scanf("%s %d",a[i],&b[i]);
k=0;
for (i=0;i<n;i++)
{
if(b[i]>=60)
{
d[k]=b[i];
strcpy(c[k],a[i]);
k++;
}
}
l=k;//k??0?????????????????????????????k?1????????
char r[10];//???????????
for(k=0;k<l-1;k++)//??60???????
{
for(j=0;j<l-1-k;j++)
if(d[j]<d[j+1])//?????????????????????????
{
t=d[j];
d[j]=d[j+1];
d[j+1]=t;
strcpy(r,c[j]);
strcpy(c[j],c[j+1]);
strcpy(c[j+1],r);
}
}
for (j=0;j<l;j++)
{
printf("%s\n",c[j]);//?????????????? ????????
}
for(i=0;i<n;i++)//???????60??????????????ID
{
if(b[i]<60)
printf("%s\n",a[i]);
}
}
| 9 |
4,334 | struct patient
{
char id[10];
int age;
}p[100],old[100],temp;
void main()
{
int i,j,n,count=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",p[i].id);
scanf("%d",&p[i].age);
if(p[i].age>=60)
{
old[count]=p[i];
count++;
}
}
for(i=0;i<count;i++)
{
for(j=0;j<count-i;j++)
{
if(old[j+1].age>old[j].age)
{
temp=old[j];
old[j]=old[j+1];
old[j+1]=temp;
}
}
}
for(i=0;i<count;i++)
{
printf("%s\n",old[i].id);
}
for(i=0;i<n;i++)
{
if(p[i].age<60)
{
printf("%s\n",p[i].id);
}
}
} | 9 |
4,335 | int main()
{
int n,i,j=0,e,v=0,k,m[100],p[100],b[100];
char s[100][11],temp[11],d[100][11],f[100][11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",s[i]);
scanf("%d",&m[i]);
}
for(i=0;i<n;i++)
{
if(m[i]>=60)
{
strcpy(d[j],s[i]);
p[j]=m[i];
j++;
}
else
{
strcpy(f[v],s[i]);
b[v]=m[i];
v++;
}
}
for(k=1;k<j;k++)
{
for(i=0;i<j-k;i++)
{
if(p[i]<p[i+1])
{
e=p[i+1];
p[i+1]=p[i];
p[i]=e;
strcpy(temp,d[i+1]);
strcpy(d[i+1],d[i]);
strcpy(d[i],temp);
}
}
}
for(i=0;i<j;i++){
printf("%s\n",d[i]);
}
for(i=0;i<v;i++){
printf("%s\n",f[i]);
}
return 0;
}
| 9 |
4,336 | struct student
{
char str[10];
int a;
struct student *next;
};
struct student *creat(int n)
{
int i=0;
struct student *head;
struct student *p1,*p2;
p1=p2=(struct student *)malloc(LEN);
scanf("%s %d",&p1->str,&p1->a);
head=NULL;
while(i<n-1)
{
i=i+1;
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%s %d",&p1->str,&p1->a);
}
p2->next=p1;
p2=(struct student *)malloc(LEN);
p2=p1;
p2->next=NULL;
return(head);
}
void main()
{
int n,i,j;
struct student *head,*p1,*p2,*p3,*p4,*p5,*p6;
scanf("%d",&n);
head=creat(n);
char c[10];
int t;
for(i=0;i<n;i++)
{
p1=head;
p2=p1->next;
for(j=0;j<n-1-i;j++)
{
if(p2->a>59 && p2->a>p1->a)
{
strcpy(c,p2->str);
strcpy(p2->str,p1->str);
strcpy(p1->str,c);
t=p1->a;
p1->a=p2->a;
p2->a=t;
}
p1=p1->next;
p2=p2->next;
}
}
p5=head;
for(i=0;i<n;i++)
{
{ printf("%s\n",p5->str);}
p5=p5->next;
}
} | 9 |
4,337 |
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 |
4,338 | struct info
{
int num;
char data[10];
struct info*next;
int tip;
};
struct info*create(int n)
{
struct info *p1,*pre,*p2,*head,*tail;
int i,t;
head=(struct info*)malloc(sizeof(struct info));
p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %d",p1->data,&p1->num);
head->next=p1;
p1->next=NULL;
tail=p1;
i=0;
while(i<n-1)
{
t=0;
p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %d",p1->data,&p1->num);
p1->next=NULL;
if(p1->num>=60)
{
for(pre=head,p2=head->next;p2!=NULL&&p2->num>=60;pre=pre->next,p2=p2->next)
{
if(p2->num<p1->num)
{
pre->next=p1;
p1->next=p2;
t=1;
break;
}
}
if(t==0)
{
pre->next=p1;
p1->next=p2;
if(p2==NULL)
{tail=p1;}
}
}
else
{
tail->next=p1;
tail=p1;
}
i++;
}
return head;
}
void print(struct info *head)
{
struct info *p;
p=head->next;
while(p!=NULL)
{
printf("%s\n",p->data);
p=p->next;
}
}
int main()
{
int n;
struct info *head;
scanf("%d",&n);
head=create(n);
print(head);
}
| 9 |
4,339 |
struct person{
char str[10];
int age;
}per[100],per1[100],per2[100];
int main(int argc, char* argv[])
{
int n,i,j=0,k=0,x=0,t;
char e[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",per[i].str,&per[i].age);
if(per[i].age>=60){
strcpy(per1[j].str,per[i].str);
per1[j].age=per[i].age;
j++;
}
else{
strcpy(per2[k].str,per[i].str);
per2[k].age=per[i].age;
k++;
}
}
for(x=0;x<j;x++){
for(i=0;i<j-x;i++){
if(per1[i].age<per1[i+1].age){
strcpy(e,per1[i].str);
strcpy(per1[i].str,per1[i+1].str);
strcpy(per1[i+1].str,e);
t=per1[i].age;
per1[i].age=per1[i+1].age;
per1[i+1].age=t;
}
}
}
for(i=0;i<j;i++){
printf("%s\n",per1[i].str);
}
for(i=0;i<k;i++){
printf("%s\n",per2[i].str);
}
return 0;
}
| 9 |
4,340 | int main()
{
int n,sz[100];
scanf("%d",&n);
char zf[100][10],id[10];
int i,k,e=0;
for(i=0;i<n;i++){
scanf("%s %d",zf[i],&(sz[i]));
}
for(k=1;k<n;k++){
for(i=0;i<n-k;i++){
if(sz[i+1]>=60&&sz[i+1]>sz[i]){
e=sz[i];
sz[i]=sz[i+1];
sz[i+1]=e;
strcpy(id,zf[i]);
strcpy(zf[i],zf[i+1]);
strcpy(zf[i+1],id);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",zf[i]);
}
return 0;
}
| 9 |
4,341 | int main(){
int n;
int i,j=0;
scanf("%d",&n);
char **id=(char**)malloc(sizeof(char*)*n);
for(i=0;i<n;i++){
id[i]=(char*)malloc(sizeof(char)*10);
}
int p=0;
int *year=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%s %d",id[i],&year[i]);
if(year[i]>=60){
p++;
}
}
char **idolder=(char**)malloc(sizeof(char*)*p);
for(i=0;i<n;i++){
idolder[i]=(char*)malloc(sizeof(char)*10);
}
int *yearolder=(int*)malloc(sizeof(int)*p);
for(i=0;i<n;i++){
if(year[i]>=60){
idolder[j]=id[i];
yearolder[j]=year[i];
j++;
}
}
int e;
char *id1=(char*)malloc(sizeof(char)*10);
for(i=1;i<=p;i++){
for(j=0;j<p-i;j++){
if(yearolder[j+1]>yearolder[j]){
id1=idolder[j];
idolder[j]=idolder[j+1];
idolder[j+1]=id1;
e=yearolder[j];
yearolder[j]=yearolder[j+1];
yearolder[j+1]=e;
}
}
}
for(i=0;i<p;i++){
printf("%s\n",idolder[i]);
}
for(i=0;i<n;i++){
if(year[i]<60){
printf("%s\n",id[i]);
}
}
return 0;
} | 9 |
4,342 |
struct pat
{
char *id;
int a;
int o;
struct pat *next;
};
int n;
int main()
{
struct pat *create(int n);
struct pat *arrange(struct pat *head);
struct pat *head,*p;
scanf("%d",&n);
head=create(n);
head=arrange(head);
p=head;
while(p!=NULL)
{
printf("%s",p->id);
if(p->next!=NULL) printf("\n");
p=p->next;
}
}
struct pat *create(int n)
{
struct pat *head,*p1,*p2;
int i;
p2=head=MLCP;
for(i=1;i<=n;i++)
{
p1=MLCP;
p1->id=MLCI;
scanf("%s %d",p1->id,&p1->a);
p1->o=i;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return head;
}
struct pat *arrange(struct pat *head)
{
void sort(struct pat *hn);
struct pat *p1,*p2,*hn,*n1;
n1=hn=MLCP;
p2=head;p1=head->next;
while(p1!=NULL)
{
if(p1->a >=60)
{
p2->next=p1->next;
n1->next=p1;n1=p1;
p1=p2->next;
}
else {p1=p1->next;p2=p2->next;}
}
n1->next=NULL;
sort(hn);
n1->next=head->next;
head=hn->next;
return head;
}
void sort(struct pat *hn)
{
struct pat *p1,*p2;
char *tid;
int ta,to;
p1=hn->next;
while(p1!=NULL)
{
p2=p1->next;
while(p2!=NULL)
{
if(p2->a > p1->a || (p2->a==p1->a && p2->o < p1->o))
{
tid=p2->id;p2->id=p1->id;p1->id=tid;
ta=p2->a;p2->a=p1->a;p1->a=ta;
to=p2->o;p2->o=p1->o;p1->o=to;
}
p2=p2->next;
}
p1=p1->next;
}
}
| 9 |
4,343 | 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 |
4,344 | main()
{
int n,i;
scanf("%d",&n);
char ID[n][10];
int age[n];
for(i=0;i<=n-1;i++)
{
scanf("%s %d",ID[i],&age[i]);
}
char ID2[n][10];
int b[n];
int j=0,t,k;
for(i=0;i<=n-1;i++)
{
if(age[i]>=60)
{
b[j]=age[i];
strcpy(ID2[j],ID[i]);
j++;
}
}
char c[10];
for(k=0;k<j-1;k++)
{
for(i=0;i<j-1-k;i++)
{
if(b[i]<b[i+1])
{
t=b[i];
b[i]=b[i+1];
b[i+1]=t;
strcpy(c,ID2[i]);
strcpy(ID2[i],ID2[i+1]);
strcpy(ID2[i+1],c);
}
}
}
for(i=0;i<j;i++)
printf("%s\n",ID2[i]);
char ID3[n][10];
int m=0;
for(i=0;i<n;i++)
{
if(age[i]<60)
{
strcpy(ID3[m],ID[i]);
m++;
}
}
for(i=0;i<m;i++)
printf("%s\n",ID3[i]);
getchar();
getchar();
getchar();
}
| 9 |
4,345 |
int old=0;
struct seqs//????
{
char id[11];
int age;
struct seqs *next;
};
struct seqs *build(int l)//?????????l
{
int i;
struct seqs *head,*newnode,*p;
head=(struct seqs *)malloc(len);//???????
scanf("%s %d",head->id,&head->age);//????????
p=head;//???p??????
if(head->age>=60)
old++;
for(i=1;i<l;i++)//???????????????????
{
newnode=(struct seqs *)malloc(len);//?????
scanf("%s %d",newnode->id,&newnode->age);//??????
if(newnode->age<60)
{
p->next=newnode;//??????????
p=newnode;//???p??????
}
else
{
old++;
newnode->next=head;
head=newnode;
}
}
p->next=NULL;//????????
return head;
}
struct seqs *rebuild(struct seqs *headx)//????
{
int i;
struct seqs *head,*newnode,*p,*px;
newnode=(struct seqs *)malloc(len); newnode->next=NULL;//????????
strcpy(newnode->id,headx->id);
newnode->age=headx->age;//????????????
p=newnode;//???p?????????
px=headx->next;
for(i=1;i<old;i++)//???????????????????
{
newnode=(struct seqs *)malloc(len);//?????
strcpy(newnode->id,px->id);
newnode->age=px->age;
newnode->next=p;//??????????
p=newnode;//???p??????
px=px->next;
}
head=p;//??head
return head;
}
void bubble(struct seqs *head,int l)
{
struct seqs *p;
int i,j,temp;
char t[11]={0};
for(i=1;i<l;i++)
for(p=head,j=0;j<l-i;j++,p=p->next)
if(p->age < p->next->age)
{
strcpy(t,p->id);
strcpy(p->id,p->next->id);
strcpy(p->next->id,t);
temp=p->age;
p->age=p->next->age;
p->next->age=temp;
}
}
void main()
{
int n,i,j;
struct seqs *p,*px;
scanf("%d",&n);
p=build(n);
px=rebuild(p);
bubble(px,old);
while(px!=NULL)//????
{
printf("%s\n",px->id);
px=px->next;
}
for(i=0;i<old;i++)
p=p->next;
while(p!=NULL)//????
{
printf("%s\n",p->id);
p=p->next;
}
} | 9 |
4,346 | main()
{
int m=0,n,i,j,t=0;
int num[100];
int a[100];
char string[11];
char stm[100][11];
char str[100][11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stm[i]);
scanf("%d",&num[i]);
}
j=0;
for(i=0;i<n;i++)
{
if(num[i]>=60)
{
a[j]=num[i];
strncpy(str[j],stm[i],10);
j++;
t=j-1;
}
}
for(j=0;j<t;j++)
{
for(i=0;i<t-j;i++)
{
if(a[i]<a[i+1])
{
m=a[i];
a[i]=a[i+1];
a[i+1]=m;
strncpy(string,str[i],10);
strncpy(str[i],str[i+1],10);
strncpy(str[i+1],string,10);
}
}
}
for(i=0;i<=t;i++)
printf("%s\n",str[i]);
for(i=0;i<n;i++)
{
if(num[i]<60)
printf("%s\n",stm[i]);
}
getchar();
getchar();
}
| 9 |
4,347 | main()
{
int n,age[100],a[100],k=0,count=0,c[100],i,j;
char ID[100][100],id[100][100],string[100];
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%s %d",ID[i],&age[i]);
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
a[k]=age[i];
strcpy(id[k],ID[i]);
count++;
c[k]=k;
k++;
}
}
for(k=0;k<count;k++)
{
for(int j=k+1;j<count;j++)
{
if(a[k]<a[j])
{
int t=a[j];
a[j]=a[k];
a[k]=t;
strcpy(string,id[k]);
strcpy(id[k],id[j]);
strcpy(id[j],string);
int p=c[k];
c[k]=c[j];
c[j]=p;
}
}
}
for(k=0;k<count;k++)
{
for(int j=k+1;j<count;j++)
{
if(a[k]==a[j])
{
if(c[k]>c[j])
{
int t=a[j];
a[j]=a[k];
a[k]=t;
strcpy(string,id[k]);
strcpy(id[k],id[j]);
strcpy(id[j],string);
int p=c[k];
c[k]=c[j];
c[j]=p;
}
}
}
}
for(k=0;k<count;k++)
printf("%s\n",id[k]);
for(i=0;i<n;i++)
{
if(age[i]<60)
printf("%s\n",ID[i]);
}
getchar();
getchar();
}
| 9 |
4,348 |
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 |
4,349 |
int main()
{
int renshu,nianling[1000][2],bijiao[1000][2];
char id[1000][1000];
scanf("%d",&renshu);
int i,j,k;
j=0;
k=0;
for(i=0;i<renshu;i++)
{
scanf("%s%d",id[i],&nianling[i][0]);
}
for(i=0;i<renshu;i++)
{
if(nianling[i][0]<60);
else
{
nianling[i][1]=i;
bijiao[k][0]=nianling[i][0];
bijiao[k][1]=i;
k++;
}
}
int zhongjian[2],l;
l=k;
bijiao[l][0]=10000;
for(i=0;i<l;i++)
{
for(j=0;j<l;j++)
{
if(bijiao[j][0]>bijiao[j+1][0])
{
zhongjian[0]=bijiao[j+1][0];
zhongjian[1]=bijiao[j+1][1];
bijiao[j+1][0]=bijiao[j][0];
bijiao[j+1][1]=bijiao[j][1];
bijiao[j][0]=zhongjian[0];
bijiao[j][1]=zhongjian[1];
}
else if(bijiao[j][0]==bijiao[j+1][0]&&bijiao[j][1]<bijiao[j+1][1])
{
zhongjian[0]=bijiao[j+1][0];
zhongjian[1]=bijiao[j+1][1];
bijiao[j+1][0]=bijiao[j][0];
bijiao[j+1][1]=bijiao[j][1];
bijiao[j][0]=zhongjian[0];
bijiao[j][1]=zhongjian[1];
}
else;
}
}
for(i=0;i<l;i++)
{
for(j=0;j<renshu;j++)
{
if(bijiao[l-1-i][0]==nianling[j][0]&&bijiao[l-i-1][1]==nianling[j][1])
printf("%s\n",id[j]);
else;
}
}
for(j=0;j<renshu;j++)
{
if(nianling[j][0]<60)
printf("%s\n",id[j]);
else;
}
getchar();
getchar();
} | 9 |
4,350 | 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 |
4,351 | int main()
{
int n,i,a[150],tmp,j;
char s[150][20],ts[20];
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s",s[i]);
scanf("%d",&a[i]);
}
for (i=1;i<n;i++)
for (j=1;j<=n-i;j++)
if (((a[j+1]>=60)&&(a[j]<60))
||((a[j+1]>a[j])&&(a[j]>=60)))
{
memcpy(ts,s[j],sizeof(ts));
memcpy(s[j],s[j+1],sizeof(ts));
memcpy(s[j+1],ts,sizeof(ts));
tmp=a[j];
a[j]=a[j+1];
a[j+1]=tmp;
}
for (i=1;i<=n;i++)
printf("%s\n",s[i]);
} | 9 |
4,352 | int main(){
char a[100][11],c[100][11];
int i,j,n,b[100],m,e=-1,f=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){
m=0;
for(j=0;j<n;j++){
if(b[i]<b[j]||(b[i]==b[j]&&i>j)){
m++;
}}
if(e<m)
e=m;
strcpy(c[m],a[i]);
}}
e=e+1;
for(i=0;i<n;i++){
if(b[i]<60){
strcpy(c[i-f+e],a[i]);
}else{
f++;
}}
for(i=0;i<n;i++){
printf("%s\n",c[i]);
}
return 0;
}
| 9 |
4,353 | main()
{
int n,oversix=0,undersix=0,osix[100],usix[100],t;
char noosix[100][100]={0},nousix[100][100]={0},a[100][100]={0};
char s[100][100]={0};
scanf("%d",&n);
int b[100];
for(int i=0;i<n;i++)
{
scanf("%s %d",a[i],&b[i]);
}
for(int i=0;i<n;i++)
{
if(b[i]>=60)
{
oversix++;
osix[oversix-1]=b[i];
strcpy(noosix[oversix-1],a[i]);
}
else
{
undersix++;
usix[undersix-1]=b[i];
strcpy(nousix[undersix-1],a[i]);
}
}
for(int j=0;j<oversix-1;j++)
for(int i=0;i<oversix-1-j;i++)
if(osix[i]<osix[i+1])
{
t=osix[i];
strcpy(s[i],noosix[i]);
osix[i]=osix[i+1];
strcpy(noosix[i],noosix[i+1]);
osix[i+1]=t;
strcpy(noosix[i+1],s[i]);
}
for(int i=0;i<oversix;i++)
printf("%s\n",noosix[i]);
for(int i=0;i<undersix;i++)
printf("%s\n",nousix[i]);
getchar();
getchar();
}
| 9 |
4,354 | void main()
{
int n,i,j,k,t;
int a[100]={0},b[100]={0};
char id[100][20],temp[20],s[100][20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",id[i],&a[i]);
for(i=0,j=0;i<n;i++)
if(a[i]>=60)
{
b[j]=a[i];
strcpy(s[j],id[i]);
j=j+1;
}
for(i=0;i<j;i++)
for(k=0;k<j-i;k++)
if(b[k]<b[k+1])
{t=b[k];b[k]=b[k+1];b[k+1]=t;strcpy(temp,s[k]);strcpy(s[k],s[k+1]);strcpy(s[k+1],temp);}
for(k=0;k<j;k++)
printf("%s\n",s[k]);
for(i=0;i<n;i++)
if(a[i]<60)
printf("%s\n",id[i]);
} | 9 |
4,355 |
int main()
{
int n,age[100],i,j;
char id[100][11],str[11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",id[i],&age[i]);
}
for(i=110;i>=60;i--)
{
for(j=0;j<n;j++)
{
if(age[j]==i)
{
printf("%s\n",id[j]);
age[j]=0;
}
}
}
for(i=0;i<n;i++)
{
if(age[i]!=0)
printf("%s\n",id[i]);
}
return 0;
}
| 9 |
4,356 |
int main()
{
int n,i,age[MAX+10],num[MAX+10];
char id[MAX+10][ID_DIGITS+1]={0};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",id[i],&age[i]);
num[i]=i;
}
int flag,tempnum,tempage,j;
char tempid[ID_DIGITS+1];
for(i=0;i<n-1;i++){
for(j=n-1;j>i;j--){
flag=0;
if(age[j]>=60&&age[j-1]<60)flag=1;
else if(age[j]>=60&&age[j-1]>=60){
if(age[j]>age[j-1])flag=1;
else if(age[j]==age[j-1]){
if(num[j]<num[j-1])flag=1;
}
}
else if(age[j]<60&&age[j-1]<60){
if(num[j]<num[j-1])flag=1;
}
if(flag){
tempnum=num[j];
num[j]=num[j-1];
num[j-1]=tempnum;
tempage=age[j];
age[j]=age[j-1];
age[j-1]=tempage;
strcpy(tempid,id[j]);
strcpy(id[j],id[j-1]);
strcpy(id[j-1],tempid);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",id[i]);
}
return 0;
} | 9 |
4,357 | 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 |
4,358 | struct data{
int w;
char c[20];
int old;
struct data *next;
struct data *onext;
};
int main() {
int i,j,n,max,x;
scanf("%d",&n);
struct data *head=(struct data*)malloc(sizeof(struct data));
struct data *p,*pp,*de;
pp=head;
for(i=0;i<n;i++) {
p=(struct data*)malloc(sizeof(struct data));
scanf("%s %d",p->c,&p->w);
p->old=0;
pp->next=p;
pp=p;
}
struct data *old=(struct data*)malloc(sizeof(struct data));
pp=head->next;
de=old;
x=0;
for(i=0;i<n;i++) {
if(pp->w>59) {
pp->old=1;
de->onext=pp;
de=pp;
x++;
}
pp=pp->next;
}
for(i=0;i<x;i++) {
pp=old->onext;
max=0;
for(j=0;j<x;j++) {
if(pp->w>max) {
max=pp->w;
de=pp;
}
pp=pp->onext;
}
printf("%s\n",de->c);
de->w=-1;
}
pp=head->next;
for(i=0;i<n;i++) {
if(pp->old==0) printf("%s\n",pp->c);
pp=pp->next;
}
} | 9 |
4,359 | main()
{
int n,i,a[1000],e[1000],t,b,k,j,d;
char str[1000][1000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d",str[i],&a[i]);
}
b=0;
for(i=1;i<=n;i++)
{
if(a[i]>=60)
{b++;
}
}
t=b;
for(i=1;i<=n;i++)
{
if(a[i]<60)
{b++;
e[b]=i;}
}
k=0;
for(j=100;j>=60;j--)
{
for(i=1;i<=n;i++)
{
if(a[i]==j)
{k++;
e[k]=i;}
}
}
for(i=1;i<=n;i++)
{j=e[i];
if(i==1)
printf("%s",str[j]);
else
printf("\n%s",str[j]);
}
getchar();
getchar();
}
| 9 |
4,360 |
struct example
{
char id[10];
int age;
struct example *next;
};
int i=1,d,n;
struct example *creat(int n)
{struct example *head=NULL;
struct example *p1,*p2;
while(i<=n)
{
p1=(struct example *)malloc(sizeof(struct example));
scanf("%s%d",&(*p1).id,&(*p1).age);
if(i==1)
{head=p1;
p2=head;}
else
p2->next=p1;
p2=p1;
i=i+1;
}
p2->next=NULL;
return(head);
}
struct example *paixu(struct example *head)
{
char temp1[10]={'\0'};
int temp2;
struct example *p1,*p2;
p1=p2=head;
for(i=1;i<n;i++)
{
p1=head;
while(p1->next!=NULL)
{
p2=p1->next;
if(p1->age<p2->age&&((p2->age)>=60))
{strcpy(temp1,p1->id);
strcpy(p1->id,p2->id);
strcpy(p2->id,temp1);
temp2=p1->age;
p1->age=p2->age;
p2->age=temp2;
}
p1=p1->next;
}
}
return head;
}
void print(struct example *head)
{struct example *s;
s=head;
if(head!=NULL)
do
{printf("%s\n",s->id);
s=s->next;
}while(s!=NULL);
}
void main()
{
struct example *head=NULL;
scanf("%d",&n);
head=creat(n);
head=paixu(head);
print(head);
}
| 9 |
4,361 | struct patient{
char id[10];
int age;
}pat[100],order[100],buffer[100],swap;
int main (){
int i,j=0,m=0,n,k,p,q;
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){
order[j]=pat[i];
j++;}
}
for(i=0;i<n;i++){
if (pat[i].age<60){
buffer[m]=pat[i];
m++;}
}
for(p=1;p<j;p++){
for(q=0;q<j-p;q++){
if (order[q].age<order[q+1].age){
swap=order[q+1];
order[q+1]=order[q];
order[q]=swap;
}
}
}
for(q=0;q<j;q++){
printf("%s",order[q].id);
printf ("\n");}
for(i=0;i<m;i++){
printf("%s",buffer[i].id);
printf("\n");}
}
| 9 |
4,362 | void main()
{
int n,i,j=0,p=0,q,w;
struct patient
{
int age;
char b[10];
};
struct patient c[100],d[100],e[100],f[100],g;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c[i].b);
scanf("%d",&c[i].age);
}
for(i=0;i<n;i++)
{
if(c[i].age>=60)
{
d[j]=c[i];
j=j+1;
}
else
{
e[p]=c[i];
p=p+1;
}
}
w=j-1;
for(j=1;j<=w;j++)
{
q=w;
for(;q>=j;q--)
{
if(d[q].age>d[q-1].age)
{
g=d[q];
d[q]=d[q-1];
d[q-1]=g;
}
}
}
for(j=0;j<w+1;j++)
printf("%s\n",d[j].b);
for(j=0;j<p;j++)
printf("%s\n",e[j].b);
}
| 9 |
4,363 |
struct staff
{
char id[20];
int age;
struct staff*next;
};
void main()
{
int n,k=0,max=59;
struct staff*head,*p,*q,*pre;
scanf("%d",&n);
struct staff *p1,*p2;
p1=(struct staff*)malloc(LEN);
scanf("%s %d",p1->id,&p1->age);
head=p2=p1;
if(p1->age>=60) k++;
while(n-1)
{
n--;
p1=(struct staff *)malloc(LEN);
scanf("%s %d",p1->id,&p1->age);
if(p1->age>=60) k++;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
//printf("<%d>",k);
while(k)
{
p=head;
k--;
while(p)
{
if(p->age>max)
{
max=p->age;
q=p;
}
p=p->next;
}
printf("%s\n",q->id);
if(q==head)
{
head=q->next;
free(q);
}
else
{
if(q->next==NULL)
{
p=head;
while(p)
{
pre=p;
p=p->next;
if(p==q)
{
free(q);
pre->next=NULL;
break;
}
}
}
else
{
p=head;
while(p)
{
pre=p;
p=p->next;
if(p==q)
{
p=p->next;
pre->next=p;
free(q);
break;
}
}
}
}
max=59;
}
p=head;
while(p)
{
printf("%s\n",p->id);
p=p->next;
}
}
| 9 |
4,364 | void main()
{
int n,i,j=0,t=0;
struct patient
{
char str[10];
int age;
}pat[100],pat2[100],patt;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&pat[i].str,&pat[i].age);
for(i=0;i<n;i++)
if (pat[i].age>=60) {pat2[j]=pat[i];j++;t++;}
for(i=0;i<t-1;i++)
{
for(j=0;j<t-1-i;j++)
{if (pat2[j+1].age>pat2[j].age)
{
patt=pat2[j];
pat2[j]=pat2[j+1];
pat2[j+1]=patt;
}
}
}
for(i=0;i<t;i++)
printf("%s\n",pat2[i].str);
for(i=0;i<n;i++)
{
if (pat[i].age<60)
printf("%s\n",pat[i].str);
}
} | 9 |
4,365 | struct patient
{
char id[20];
int age;
}pat[100];
int main()
{
int i,k,n,e;
int ex[100],ex1[100];
i=0;
k=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%s%d",&(pat[i].id),&(pat[i].age));
ex[i]=pat[i].age;
ex1[i]=i+1;
}
for(k=n-1;k>=1;k--){
for(i=n-1;i>=n-k;i--){
if(ex[i]>ex[i-1]&&ex[i]>=60){
e=ex[i];
ex[i]=ex[i-1];
ex[i-1]=e;
e=ex1[i];
ex1[i]=ex1[i-1];
ex1[i-1]=e;
}
}
}
for(i=0;i<=n-1;i++){
if(ex[i]>=60){
printf("%s\n",pat[ex1[i]-1].id);
}
}
for(i=0;i<=n-1;i++){
if(ex[i]<60){
printf("%s\n",pat[ex1[i]-1].id);
}
}
return 0;
}
| 9 |
4,366 | int main()
{
struct data
{
int age;
char id[10];
}o[101],y[101],tmp;
int no=0,ny=0;
int i,j,n;
cin>>n;
for(i=0;i<n;i++)
{
cin>>tmp.id>>tmp.age;
if(tmp.age>=60)
{
o[no]=tmp;
no++;
}
else
{
y[ny]=tmp;
ny++;
}
}
for(i=no-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(o[j].age<o[j+1].age)
{
o[100]=o[j];
o[j]=o[j+1];
o[j+1]=o[100];
}
}
}
for(i=0;i<no;i++)
cout<<o[i].id<<endl;
for(i=0;i<ny;i++)
cout<<y[i].id<<endl;
return 0;
} | 9 |
4,367 | int main()
{
struct a
{
char id[10];
int age;
}p,q,a[100],old[100],yog[100];
int n,i=0,x=0,y=0,k,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",a[i].id,&a[i].age);
if(a[i].age>=60)
{
old[x]=a[i];
x++;
}
if(a[i].age<60)
{
yog[y]=a[i];
y++;
}
}
for(k=1;k<x;k++)
{
for(i=0;i<x-1;i++)
{
if(old[i].age<old[i+1].age)
{
p=old[i+1];
old[i+1]=old[i];
old[i]=p;
}
}
}
for(i=0;i<x;i++)
{
printf("%s\n",old[i].id);
}
for(i=0;i<y;i++)
{
printf("%s\n",yog[i].id);
}
return 0;
}
| 9 |
4,368 | 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 |
4,369 | struct f{
char id[10];
int old;
}st[1000],stu[1000],temp;
int main()
{
int n,i,j,a,b,c;
char cc,aa,x[1000],y[1000];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%s%c%d%c",st[i].id,&aa,&st[i].old,&cc);}
a=0;
for(j=1;j<=n;j++){
if(st[j].old>=60){
a++;
stu[a]=st[j];
}}
for(i=a-1;i>=0;i--){
for(j=1;j<=i;j++){
if(stu[j].old<stu[j+1].old){
temp=stu[j];
stu[j]=stu[j+1];
stu[j+1]=temp;}}}
for(i=1;i<=a;i++){
puts(stu[i].id);}
for(i=1;i<=n;i++){
if(st[i].old<60)puts(st[i].id);}
} | 9 |
4,370 |
int main(){
int n,i,j,t;
struct ill{
char num[10];
int age,id;
}man[N],ex;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",man[i].num,&man[i].age);
man[i].id=i;
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(man[i].age<man[j].age)
{
ex=man[i];
man[i]=man[j];
man[j]=ex;
}
}
}
for(i=0;i<n;i++)
{
if(man[i].age<60)
{
t=i;
break;
}
}
for(i=0;i<t;i++)
{
for(j=i+1;j<t;j++)
{
if(man[i].age==man[j].age&&man[i].id>man[j].id)
{
ex=man[i];
man[i]=man[j];
man[j]=ex;
}
}
}
for(i=t;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(man[i].id>man[j].id)
{
ex=man[i];
man[i]=man[j];
man[j]=ex;
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",man[i].num);
}
for(i=0;i<n;i++);
return 0;
} | 9 |
4,371 | struct senex
{
char id[10];
int age;
int rec;
} sen[100],t;
int n;
int main()
{
int i,j,k,l;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",sen[i].id,&sen[i].age);
if(sen[i].age>=60) sen[i].rec=1;
else sen[i].rec=0;
}
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
if(sen[j].rec<sen[j+1].rec)
{
t=sen[j];
sen[j]=sen[j+1];
sen[j+1]=t;
}
k=0;
while(sen[k].rec==1) k++;
for(i=1;i<k;i++)
for(j=0;j<k-i;j++)
if(sen[j].age<sen[j+1].age)
{
t=sen[j];
sen[j]=sen[j+1];
sen[j+1]=t;
}
//for(i=0;i<n;i++)
//printf("%d ",sen[i].rec);
for(i=0;i<n;i++)
printf("%s\n",sen[i].id);
scanf("%d",&i);
return 0;
} | 9 |
4,372 | int main(){
int m,e,n,i,j,k,a[101],b[101],c[101];
char ex[11],s[101][11],s1[101][11],s2[101][11];
scanf("%d",&n);
for(i=0,j=0,k=0;i<n;i++){
scanf("%s %d",s[i],&a[i]);
if(a[i]>=60){
strcpy(s1[j],s[i]);
b[j]=a[i];
j++;
}
else{
strcpy(s2[k],s[i]);
c[k]=a[i];
k++;
}
}
for(m=1;m<=j;m++){
for(i=0;i<j-m;i++){
if(b[i]<b[i+1]){
strcpy(ex,s1[i]);
strcpy(s1[i],s1[i+1]);
strcpy(s1[i+1],ex);
e=b[i];
b[i]=b[i+1];
b[i+1]=e;
}
}
}
for(i=0;i<j;i++){
printf("%s\n",s1[i]);
}
for(i=0;i<k;i++){
printf("%s\n",s2[i]);
}
return 0;
} | 9 |
4,373 | int main(){
struct point{
char id[10];
int age;
}patient[100];
int n;
int i,j,k;
int on=0,old[100],flag;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",patient[i].id,&patient[i].age);
}
for(j=120;j>=60;j--){
for(i=0;i<n;i++){
if(patient[i].age==j){
printf("%s\n",patient[i].id);
old[on]=i;
on++;
}
}
}
for(i=0;i<n;i++){
flag=0;
for(k=0;k<on;k++){
if(i==old[k]){
flag=1;
break;
}
}
if(flag==0){
printf("%s\n",patient[i].id);
}
}
return 0;
} | 9 |
4,374 | struct pa
{
char id[11];
int age;
};
void main()
{
struct pa p[200];
int n,i,t[200],j,m;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",p[i].id,&p[i].age);
i=0;
t[0]=0;
while(i<n)
{
if(p[i].age>=60)
{
for(j=0;j<i&&p[t[j]].age>=p[i].age;j++);
for(m=i;m>j;m--)
t[m]=t[m-1];
t[j]=i;
i++;
}
else
{
t[i]=i;
i++;
}
}
for(i=0;i<n;i++)
printf("%s\n",p[t[i]].id);
} | 9 |
4,375 | int main()
{
char s[101][10]={0},p[101][10]={0},q[101][10]={0};
int a[101]={0},b[101]={0},c[101]={0};
int n,i=0,j=0;
int f=0,g=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",s[i],&a[i]);
if(a[i]>=60)
{
b[f]=a[i];
strcpy(p[f],s[i]);
f++;
}
else if(a[i]<60)
{
c[g]=a[i];
strcpy(q[g],s[i]);
g++;
}
}
int e=0;
char y[10]={0};
for(j=0;j<f;j++)
{
for(i=f-2;i>=j;i--)
{
if(b[i]<b[i+1])
{
e=b[i];
b[i]=b[i+1];
b[i+1]=e;
strcpy(y,p[i]);
strcpy(p[i],p[i+1]);
strcpy(p[i+1],y);
}
}
}
for(i=0;i<f;i++)
{
printf("%s\n",p[i]);
}
for(j=0;j<g;j++)
{
printf("%s\n",q[j]);
}
return 0;
}
| 9 |
4,376 | 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 |
4,377 | 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 |
4,378 | 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 |
4,379 | struct Inf
{
char c[10];
int a;
};
int main()
{
int n,o=0,y=0,t,i,j;
char temp[10];
struct Inf inf[100],old[100],young[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",inf[i].c,&inf[i].a);
if(inf[i].a>=60)
{
strcpy(old[o].c,inf[i].c);
old[o].a=inf[i].a;
o++;
}
else
{
strcpy(young[y].c,inf[i].c);
young[y].a=inf[i].a;
y++;
}
}
for(j=1;j<o;j++)
{
for(i=0;i<o-j;i++)
{
if(old[i].a<old[i+1].a)
{
strcpy(temp,old[i].c);
strcpy(old[i].c,old[i+1].c);
strcpy(old[i+1].c,temp);
t=old[i].a;
old[i].a=old[i+1].a;
old[i+1].a=t;
}
}
}
for(i=0;i<o;i++)
{
printf("%s\n",old[i].c);
}
for(i=0;i<y;i++)
{
printf("%s\n",young[i].c);
}
return 0;
} | 9 |
4,380 | struct a
{
char id[100];
int year;
}p[100];
int main()
{
int n,i,j,k,t=0,r=0;
int a[200]={0};
scanf("%d",&n);
struct a b[100];
struct a c[100];
struct a temp;
for(i=0;i<=n-1;i++)
{
scanf("%s %d",p[i].id,&p[i].year);
}
for(i=0;i<=n-1;i++)
{
if(p[i].year>=60)
{
b[t]=p[i];
t++;
}
}
for(i=0;i<=t-1;i++)
{
a[b[i].year]++;
}
for(i=200;i>=60;i--)
{
if(a[i]>0)
{
for(j=0;j<=t-1;j++)
{
if(b[j].year==i)
{
c[r]=b[j];
r++;
}
}
}
}
for(i=0;i<=t-1;i++)
{
printf("%s\n",c[i].id);
}
for(i=0;i<=n-1;i++)
{
if(p[i].year<60)
{
printf("%s\n",p[i].id);
}
}
return 0;
} | 9 |
4,381 | 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 |
4,382 | void main()
{
int n,i,j,a[100],c[100],m=0,e[100],k=0,x;
char b[100][10],d[100][10],f[100][10],y[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",b[i],&a[i]);
if(a[i]>=60)
{
c[m]=a[i];
strcpy(d[m],b[i]);
m++;
}
else
{
e[k]=a[i];
strcpy(f[k],b[i]);
k++;
}
}
for(j=0;j<m-1;j++)
for(i=0;i<m-j-1;i++)
if(c[i]<c[i+1])
{
x=c[i];
c[i]=c[i+1];
c[i+1]=x;
strcpy(y,d[i]);
strcpy(d[i],d[i+1]);
strcpy(d[i+1],y);
}
for(i=0;i<m;i++)
printf("%s\n",d[i]);
for(i=0;i<k;i++)
printf("%s\n",f[i]);
} | 9 |
4,383 | struct patient
{
int age;
char id[10];
struct patient *next;
};
main()
{
int n,i,j,a=0,b=0;
struct patient *p1,*p2,*head1=NULL,*head2=NULL,*q1,*q2,*temp,*last;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct patient*)malloc(LEN);
scanf("%s %d",p1->id,&p1->age);
q1=p1;
if(p1->age>=60)
{
if(head1==NULL){head1=p1;p2=p1;p1->next=NULL;}
else
{
a=a+1;
temp=head1;last=head1;
for(j=0;j<a;j++)
{
if(p1->age>temp->age)
{
if(j==0){p1->next=head1;head1=p1;break;}
else{last->next=p1;p1->next=temp;break;}
}
last=temp;temp=temp->next;
}
if(j==a){last->next=p1;p1->next=NULL;}
}
}
if(p1->age<60)
{
if(head2==NULL){head2=q1;q2=q1;q1->next=NULL;}
else{b=b+1;q1->next=NULL;q2->next=q1;q2=q1;}
}
}
p1=head1;q1=head2;
for(i=0;i<=a;i++){printf("%s\n",p1->id);p1=p1->next;}
for(i=0;i<=b;i++){printf("%s\n",q1->id);q1=q1->next;}
}
| 9 |
4,384 |
int main(){
int i,n,m,j,k;
scanf("%d",&n);
struct br{
char x[10];
int y;
}*b,c[100],e;
b=(struct br*)malloc(sizeof(struct br)*n);
for(i=0;i<n;i++){
scanf("%s%d",b[i].x,&(b[i].y));
}
for(i=0,m=0;i<n;i++){
if(b[i].y>=60){
c[m]=b[i];
m++;
b[i].y=-1;
}
for(k=0;k<m;k++){
for(j=m-1;j>k;j--){
if(c[j].y>c[j-1].y){
e=c[j];
c[j]=c[j-1];
c[j-1]=e;
}
}
}
}
for(i=0;i<m;i++){
printf("%s\n",c[i].x);
}
for(i=0;i<n;i++){
if(b[i].y!=-1){
printf("%s\n",b[i].x);
}
}
return 0;
} | 9 |
4,385 | int main()
{
int n,i,pass;
struct patient
{
char id[L];
int age;
}men[M],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",men[i].id,&men[i].age);
for(pass=1;pass<n;pass++)
{
for(i=n-1;i>pass-1;i--)
{
if(men[i].age>=60&&men[i].age>men[i-1].age)
{
temp=men[i];
men[i]=men[i-1];
men[i-1]=temp;
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",men[i].id);
}
return 0;
}
| 9 |
4,386 | int main()
{
struct patient
{
char a[10];
int age;
}pat[100];
int n,i,m,b[100],l=0,p,q=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",pat[i].a,&pat[i].age);
}
for(i=0;i<n;i++)
{
if(pat[i].age>=60)
{
l=l+1;
b[l]=pat[i].age;
}
}
for(i=1;i<=l;i++)
{
for(m=i+1;m<=l;m++)
if(b[i]<b[m])
{
p=b[i];
b[i]=b[m];
b[m]=p;
}
}
for(i=1;i<=l;i++)
{
for(m=1;m<=l;m++)
{
if(b[i]==b[m])
{
if(i!=m)b[m]=0;
}
}
}
for(i=1;i<=l;i++)
{
for(m=0;m<n;m++)
if(pat[m].age==b[i])printf("%s\n",pat[m].a);
}
for(i=0;i<n;i++)
if(pat[i].age<60)printf("%s\n",pat[i].a);
return 0;
} | 9 |
4,387 | int main(){
struct old{
char ID[10];
int age;
};
struct old ill[100];
struct old t1[100];
struct old t2[100];
struct old t;
int n,i,j=0,k=0,num60=0,num0=0,b[100]={0},p,num=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",ill[i].ID);
scanf("%d",&ill[i].age);
if(ill[i].age>=60){
t1[j]=ill[i];
j++;
num60++;
}
else{
t2[k]=ill[i];
k++;
num0++;
}
}
for(i=0;i<num60;i++){
p=0;
for(j=0;j<num60;j++){
if(t1[j].age>p&&b[j]==0){
p=t1[j].age;
num=j;
}
}
printf("%s\n",t1[num].ID);
b[num]=1;
}
for(i=0;i<num0;i++){
printf("%s\n",t2[i].ID);
}
return 0;
} | 9 |
4,388 |
main()
{
struct h
{
char name[11];
int mun;
struct h *next;
} *p,*q,*head,*s,*t,*last;
int n;
scanf("%d",&n);
q=len;
s=head=q;
scanf("%s %d", head->name,&head->mun);
q->next=NULL;
last=q;
int i;
for(i=0;i<n-1;i++)
{
s=head;
q=len;
q->next=NULL;
scanf("%s %d", q->name,&q->mun);
if(q->mun>=60)
{
while((s!=NULL)&&((q->mun)<=(s->mun)))
{
t=s;
s=s->next;
}
if(s==head) {q->next=head;head=q;}
else
{
if(t==last) last=q;
t->next=q;q->next=s;
}
}
else
{
last->next=q;
last=q;
}
}
q=head;
for(i=0;i<n;i++)
{
printf("%s\n",q->name);
q=q->next;
}
}
| 9 |
4,389 | int main()
{
int i,j,n,k,l,z;
int a[100],b[100],f[100];
char d[30],c[100][30],e[100][30];
scanf("%d",&n);
for(i=0,z=0;i<n;i++)
{
scanf("%s",c[i]);
scanf("%d",&a[i]);
if(a[i]>=60)
{b[z]=a[i];f[z]=z;strcpy(e[z],c[i]);a[i]=0;z++;}
}
for(i=0;i<z;i++)
{
for(j=i+1;j<z;j++)
{
if(b[j]>b[i])
{
strcpy(d,e[i]);strcpy(e[i],e[j]);strcpy(e[j],d);
k=b[i];b[i]=b[j];b[j]=k;
l=f[i];f[i]=f[j];f[j]=l;
}
if(b[i]==b[j])
{
if(f[i]>f[j])
{
strcpy(d,e[i]);strcpy(e[i],e[j]);strcpy(e[j],d);
k=b[i];b[i]=b[j];b[j]=k;
l=f[i];f[i]=f[j];f[j]=l;
}
}
}
}
for(i=0;i<z;i++)
printf("%s\n",e[i]);
for(i=0;i<n;i++)
{
if(a[i]!=0)
printf("%s\n",c[i]);
}
return 0;
} | 9 |
4,390 | struct x
{char a[10];
int b;
};struct x y[100];
void main()
{int n,i,j,m;
char s[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d",&y[i].a,&y[i].b);
}
for(j=0;j<n-1;j++)
for(i=0;i<n-1-j;i++)
{if(y[i].b<y[i+1].b&&y[i+1].b>=60)
{strcpy(s,y[i].a);
strcpy(y[i].a,y[i+1].a);
strcpy(y[i+1].a,s);
m=y[i].b;
y[i].b=y[i+1].b;
y[i+1].b=m;
}
}
for(i=0;i<n;i++)
printf("%s\n",y[i].a);
}
| 9 |
4,391 |
struct student
{
char num[10];
int age;
}stu[100];
int main()
{
char c;
int n,i,j;
struct student*pstu=stu,e;
pstu=&stu[0];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",stu[i].num,&stu[i].age);
}
for(j=0;j<n;j++){if(stu[j].age>=60){
for(i=j;i>0;i--){
if(stu[i].age>stu[i-1].age){
e=*(pstu+i);
*(pstu+i)=*(pstu+i-1);
*(pstu-1+i)=e;}
}
}}
for(i=0;i<n;i++){
printf("%s\n",(pstu+i)->num);}
return 0;
}
| 9 |
4,392 | struct p
{
char id[11];
int y;
struct p *next;
};
int n;
struct p *creat(void)
{
struct p *head,*p1,*p2;
int i;
scanf("%d",&n);
p1=p2=(struct p *)malloc(LEN);
for(i=0;i<n;i++)
{
scanf("%s%d\n",p1->id,&p1->y);
if(i==0)
{
head=p1;
}
else
{
p2->next=p1;
}
p2=p1;
p1=(struct p *)malloc(LEN);
}
p2->next=NULL;
return head;
}
void px(struct p *head)
{
struct p *p;
int k,t;
leap:
t=0;
for(p=head;p!=0;)
{
if(p->y>=60)
t=1;
p=p->next;
}
if(t==1)
{
p=head;
k=p->y;
for(;p!=0;)
{
if(p->y>k)
k=p->y;
p=p->next;
}
for(p=head;p!=0;)
{
if(p->y==k)
{
printf("%s\n",p->id);
p->y=0;
}
p=p->next;
}
goto leap;
}
for(p=head;p!=0;)
{
if(p->y!=0)
printf("%s\n",p->id);
p=p->next;
}
}
void main()
{
struct p *p;
p=creat();
px(p);
} | 9 |
4,393 |
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 |
4,394 | 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 |
4,395 | int main(){
int n,i,k,l,b[100],n1=0,n2=0,ha[100],pp[100],x;
char a[100][11],yi[100][10],er[100][10],y[11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%d",&b[i]);
}
for(i=0;i<n;i++)
{
if(b[i]>=60)
{
n1++;
}
else
{
n2++;
}
}
for(i=0,k=0,l=0;i<n;i++)
{
if(b[i]>=60)
{
ha[k]=b[i];
strcpy(yi[k],a[i]);
k++;
}
else
{
pp[l]=b[i];
strcpy(er[l],a[i]);
l++;
}
}
for(i=1;i<n1;i++)
{
for(k=0;k<n1-i;k++)
{
if(ha[k]<ha[k+1])
{
x=ha[k];
ha[k]=ha[k+1];
ha[k+1]=x;
strcpy(y,yi[k]);
strcpy(yi[k],yi[k+1]);
strcpy(yi[k+1],y);
}
}
}
for(i=0;i<n1;i++){
printf("%s\n",yi[i]);
}
for(i=0;i<n2;i++){
printf("%s\n",er[i]);
}
return 0;
}
| 9 |
4,396 | struct mouse{
int weight;
char color[11];
struct mouse *next,*before;
};
int main(){
int i,j,n,max;
scanf("%d",&n);
struct mouse *m,*head,*p1,*p2,*fin;
head=p1=p2=(struct mouse *) malloc(sizeof(struct mouse));
scanf("%s %d",p1->color,&p1->weight);
for (i=1;i<=n-1;i++){
p1=(struct mouse *) malloc(sizeof(struct mouse));
scanf("%s %d",p1->color,&p1->weight);
p2->next=p1;p1->before=p2;p2=p1;
}
fin=p1;
p1->next=NULL;
for (i=1;i<=n-1;i++){
max=0;p1=head;
for (j=1;j<=n+1-i;j++){
if (p1->weight>max) {max=p1->weight;m=p1;}
p1=p1->next;
}
if (m->weight<60) break;
printf("%s\n",m->color);
if (m==head) {head=head->next;continue;}
if (m==fin) {fin=fin->before;fin->next=NULL;continue;}
if (m!=head && m!=fin) {p1=m->before;p1->next=m->next;m=m->next;m->before=p1;}
}
p1=head;
printf("%s\n",head->color);
for (;p1->next!=NULL;){
p1=p1->next;printf("%s\n",p1->color);
}
} | 9 |
4,397 |
int main()
{
struct br
{
char id[10];
int age;
} *patients,t;
int n,i,j;
scanf("%d",&n);
patients=(struct br *)malloc(sizeof(struct br)*n);
for (i=0; i<n; i++) {
scanf("%s%d", patients[i].id, &patients[i].age);
}
for (i=0; i<n; i++) {
for (j=n-1; j>i; j--) {
if (patients[j].age >= 60 &&
patients[j].age > patients[j-1].age) {
t = patients[j];
patients[j] = patients[j-1];
patients[j-1] = t;
}
}
}
for (i=0; i<n; i++) {
printf("%s\n", patients[i].id);
}
return 0;
}
| 9 |
4,398 | struct h{
char name[11];
int age;
};
void main(){
int i,k,n;
scanf("%d",&n);
struct h p[100];
for(i=0;i<n;i++){
scanf("%s %d",p[i].name,&p[i].age);
}
for(k=100;k>59;k--){
for(i=0;i<n;i++){
if(k==p[i].age)
printf("%s\n",p[i].name);
}
}
for(i=0;i<n;i++){
if(p[i].age<60)
printf("%s\n",p[i].name);
}
} | 9 |
4,399 | int main(){
struct ID{
char x[100];
int y;
}da[100],xiao[100],p[100],e;
int s,m=0,n=0;
scanf("%d\n",&s);
for(int i=0;i<s;i++){
scanf("%s %d",&(p[i].x),&(p[i].y));
if(p[i].y>=60){
da[m]=p[i];
m++;
}else{
xiao[n]=p[i];
n++;
}
}
for(int b=1;b<=m;b++){
for(int v=0;v<m-b;v++){
if(da[v].y<da[v+1].y){
e=da[v];
da[v]=da[v+1];
da[v+1]=e;
}
}
}
int h,f;
for(int z=0;z<m;z++){
f=strlen(da[z].x);
for(int g=0;g<f;g++){
if(g!=f-1){
printf("%c",da[z].x[g]);
}else{
printf("%c\n",da[z].x[g]);
}
}
}
for(int a=0;a<n;a++){
h=strlen(xiao[a].x);
for(int j=0;j<h;j++){
if(j!=h-1){
printf("%c",xiao[a].x[j]);
}else{
printf("%c\n",xiao[a].x[j]);
}
}
}
return 0;
}
| 9 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.