id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
4,100 | int main()
{
int n,i,j,s=-1,t=-1,k,age[100],e[100],h[100];
char a[100][10],b[100][10],c[100][10],f[10];
scanf("%d",&n);
for(i=0;i<=(n-1);i++)
{
scanf("%s %d",a[i],&age[i]);
}
for(i=0;i<=(n-1);i++)
{
if(age[i]>=60)
{
s=s+1;
e[s]=age[i];
strcpy(b[s],a[i]);
}
else
{
t=t+1;
h[t]=age[i];
strcpy(c[t],a[i]);
}
}
for(j=0;j<s;j++)
{
for(i=0;i<s-j;i++)
{
if(e[i]<e[i+1])
{
k=e[i];
e[i]=e[i+1];
e[i+1]=k;
strcpy(f,b[i]);
strcpy(b[i],b[i+1]);
strcpy(b[i+1],f);
}
}
}
for(i=0;i<=s;i++)
{
printf("%s\n",b[i]);
}
for(i=0;i<=t;i++)
{
printf("%s\n",c[i]);
}
getchar();
getchar();
return 0;
}
| 9 |
4,101 | struct patient
{
char name[10];
int age;
}pat[100];
void main()
{
int n,i,j=0,k=0,l;
struct patient b[100];
struct patient c[100];
struct patient t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",pat[i].name,&pat[i].age);
for(i=0;i<n;i++)
{
if(pat[i].age<60)
{
b[j]=pat[i];
j++;
}
else
{
c[k]=pat[i];
k++;
}
}
for(i=0;i<k-1;i++)
for(l=0;l<k-1-i;l++)
if(c[l].age<c[l+1].age)
{
t=c[l];
c[l]=c[l+1];
c[l+1]=t;
}
for(i=0;i<k;i++)
printf("%s\n",c[i].name);
for(i=0;i<j;i++)
printf("%s\n",b[i].name);
} | 9 |
4,102 | void main()
{
struct patient
{
char id[10];
int age;
}pa[100]={0},old[100]={0},young[100]={0},t;
int i,j,k=0,l=0,n;
scanf("%d",&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)
{
old[k]=pa[i];
k++;
}
else
{
young[l]=pa[i];
l++;
}
}
for(i=0;i<n-1;i++)
{for(j=0;j<n-1-i;j++)
{
if(old[j].age<old[j+1].age)
{
t=old[j];
old[j]=old[j+1];
old[j+1]=t;
}
}
}
for(i=0;i<k;i++)
{
printf("%s\n",old[i].id);
}
for(i=0;i<l;i++)
{
printf("%s\n",young[i].id);
}
} | 9 |
4,103 | int main(){
char id[100][10];
int n,age[100],i,k=0,m,len,p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",&(id[i]),&(age[i]));
}
char e[100][10],kong[10];
int xin[100];
for(i=0;i<n;i++){
if(age[i]>59){
xin[k]=age[i];
strcpy(e[k],id[i]);
k++;
}
}
len=k;
for(m=1;m<=len;m++){
for(k=0;k<len-m;k++){
if(xin[k]<xin[k+1]){
p=xin[k];strcpy(kong,e[k]);
xin[k]=xin[k+1];strcpy(e[k],e[k+1]);
xin[k+1]=p;strcpy(e[k+1],kong);
}
}
}
for(k=0;k<len;k++){
printf("%s\n",e[k]);
}
for(i=0;i<n;i++){
if(age[i]<60){
printf("%s\n",id[i]);
}
}
return 0;
} | 9 |
4,104 | void main()
{
int n,age[100],age1[100],t1,i,j,l1=0,l2=0;
char id[100][10],t2[10]={" "},a[100][10]={" "},b[100][10]={" "};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",&id[i],&age[i]);
if(age[i]>=60)
{
strcpy(a[l1],id[i]);
age1[l1]=age[i];
l1+=1;
}
else
{
strcpy(b[l2],id[i]);
l2+=1;
}
}
for(i=1;i<l1;i++)
{
for(j=0;j<l1-i;j++)
{
if(age1[j]<age1[j+1])
{
t1=age1[j];
age1[j]=age1[j+1];
age1[j+1]=t1;
strcpy(t2,a[j]);
strcpy(a[j],a[j+1]);
strcpy(a[j+1],t2);
}
}
}
for(i=0;i<l1;i++)
printf("%s\n",a[i]);
for(j=0;j<l2;j++)
printf("%s\n",b[j]);
} | 9 |
4,105 | struct v
{
char a[10];
int b;
};
int main()
{
int n,i,j=0,l,k;
struct v *c;
struct v e[100],y;
scanf("%d",&n);
c=(struct v*)malloc(n*sizeof(struct v));
for(i=0;i<n;i++)
{
scanf("%s %d",c[i].a,&c[i].b);
}
for(i=0;i<n;i++)
{
if(c[i].b>=60)
{
e[j]=c[i];
j=j+1;
}
}
k=j;
for(l=1;l<k;l++)
{
for(j=0;j<k-l;j++)
{
if(e[j].b<e[j+1].b)
{
y=e[j];
e[j]=e[j+1];
e[j+1]=y;
}
}
}
for(j=0;j<k;j++)
{
printf("%s\n",e[j].a);
}
for(i=0;i<n;i++)
{
if(c[i].b<60)
{
printf("%s\n",c[i].a);
}
}
return 0;
} | 9 |
4,106 | 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 |
4,107 | struct person
{
char id[10];
int age;
struct person *next;
};
void main()
{
int n,i,j;
struct person *head,*ppre,*pnew,*p;
scanf("%d",&n);
pnew=(struct person *)malloc(len);
scanf("%s %d\n",pnew->id,&pnew->age);
pnew->next=NULL;
head=pnew;
for(i=2;i<=n;i++)
{
p=head;
ppre=head;
pnew=(struct person *)malloc(len);
scanf("%s %d",pnew->id,&pnew->age);
pnew->next=NULL;
if((pnew->age>=60)&&(pnew->age>head->age))
{
pnew->next=head;
head=pnew;
}
else
{
if (pnew->age>=60)
{
p=p->next;
for(j=2;j<i;j++)
{
if(pnew->age>p->age)
{
pnew->next=p;
ppre->next=pnew;
break;
}
p=p->next;
ppre=ppre->next;
}
if(pnew->next==NULL)
ppre->next=pnew;
}
else
{
while (p->next!=NULL)
p=p->next;
p->next=pnew;
}
}
}
p=head;
for(i=0;i<n;i++)
{
printf("%s\n",p->id);
p=p->next;
}
}
| 9 |
4,108 | int main()
{
int n,b[100],i,r,j=0,k=0,o[100]={0},y[100]={0},l=1,m;
char a[100][10],old[100][10],young[100][10],str[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s %d",a[i],&b[i]);
if(b[i]>=60)
{
strcpy(old[j],a[i]);
o[j]=b[i];
j++;
}
else
{
strcpy(young[k],a[i]);
y[k]=b[i];
k++;
}
}
for(i=j-1;i>0;i--)
{
for(r=0;r<i;r++)
{
if(o[r]<o[r+1])
{
m=o[r+1];
strcpy(str,old[r+1]);
o[r+1]=o[r];
strcpy(old[r+1],old[r]);
o[r]=m;
strcpy(old[r],str);
}
}
}
for(i=0;i<j;i++)
printf("%s\n",old[i]);
for(i=0;i<n-j;i++)
printf("%s\n",young[i]);
getchar();
getchar();
}
| 9 |
4,109 | int s[100]={0},t[100]={0},n,i,j,m=0;
char ss[100][100];
int cmp(const void *a, const void *b)
{return(*(int *)b-*(int *)a);}
int main()
{
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",ss[i],&s[i]);
for(j=0;j<n;j++)
{
m=0;
for(i=0;i<n;i++)
{m=m>s[i]?m:s[i];}
if(m<60) {break;}
for(i=0;i<n;i++)
{
if(s[i]==m)
{printf("%s\n",ss[i]);
s[i]=-1;}
}
}
for(i=0;i<n;i++)
{if(s[i]!=-1)
{printf("%s\n",ss[i]);}
}
} | 9 |
4,110 |
int main()
{
int i, j, n, sr=0, jr=0, age, srage[100], jrage[100];
char num[10], srnum[100][10], jrnum[100][10];
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%s %d", &num, &age);
if(age<60)
{
strcpy(jrnum[jr],num);
jrage[jr]=age;
jr++;
}
else
{
strcpy(srnum[sr],num);
srage[sr]=age;
sr++;
}
}
for(i=sr-1; i>=0; i--)
{
for(j=0; j<i; j++)
{
if(srage[j]<srage[j+1])
{
age=srage[j];
srage[j]=srage[j+1];
srage[j+1]=age;
strcpy(num,srnum[j]);
strcpy(srnum[j],srnum[j+1]);
strcpy(srnum[j+1],num);
}
}
}
for(i=0; i<sr; i++) printf("%s\n", srnum[i]);
for(i=0; i<jr; i++) printf("%s\n", jrnum[i]);
return 0;
} | 9 |
4,111 |
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 |
4,112 |
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 |
4,113 | int main()
{
int n;
int p,q;
scanf("%d", &n);
struct patient{
char id[20];
int age;
}pa1[100],pa2[100],t;
int i;
for(i=0;i<n;i++)
{
scanf("%s%d", pa1[i].id, &pa1[i].age);
}
for(i=0;i<n;i++)
{
strcpy(pa2[i].id,pa1[i].id);
pa2[i].age=pa1[i].age;
}
for(p=1;p<n;p++)
{
for(q=0;q<n-p;q++)
{
if(pa1[q].age>pa1[q+1].age)
{
t=pa1[q];
pa1[q]=pa1[q+1];
pa1[q+1]=t;
}
}
}
int a[1000];
int s=0,h;
for(p=n-1;p>=0;p--)
{
if(pa1[p].age>=60)
{
a[s]=pa1[p].age;
s++;
}
}
for(h=0;h<s;h++)
{
for(p=h+1;p<s;p++)
{
if(a[p]==a[h])
{
a[p]=0;
}
}
}
for(h=0;h<s;h++)
{
for(p=0;p<n;p++)
{
if(pa2[p].age==a[h])
{
printf("%s\n", pa2[p].id);
}
}
}
for(p=0;p<n;p++)
{
if(pa2[p].age<60)
{
printf("%s\n", pa2[p].id);
}
}
return 0;
} | 9 |
4,114 | int main(){
char tmp[100];
int n,i,j=0,o=0,tmpn;
struct{
char num[100];
int a,k;
}s[1000],t[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",s[i].num,&s[i].a);
if(s[i].a>=60)s[i].k=1;
else s[i].k=0;
}
for(i=0;i<n;i++){
if(s[i].k==1){
strcpy(t[j].num,s[i].num);
t[j].a=s[i].a;
j++;
o++;
}
}
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if(t[j].a<t[j+1].a){
tmpn=t[j].a;
t[j].a=t[j+1].a;
t[j+1].a=tmpn;
strcpy(tmp,t[j].num);
strcpy(t[j].num,t[j+1].num);
strcpy(t[j+1].num,tmp);
}
}
}
for(i=0;i<o;i++)printf("%s\n",t[i].num);
for(i=0;i<n;i++){
if(s[i].k==1)continue;
printf("%s\n",s[i].num);
}
return 0;
} | 9 |
4,115 | int main()
{
int n,i,age[100],a,ageb[100],c,t,m;
char ID[100][100],IDb[100][100],IDc[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",ID[i],&age[i]);
}
i=0;
c=0;
while(i<n)
{
if(age[i]>=60)
{
ageb[c]=age[i];
strcpy(IDb[c],ID[i]);
c++;
}
i++;
}
for(i=0;i<=c-1;i++)
for(a=0;a<c-i-1;a++)
if(ageb[a]<ageb[a+1])
{
t=ageb[a];
strcpy(IDc,IDb[a]);
ageb[a]=ageb[a+1];
strcpy(IDb[a],IDb[a+1]);
ageb[a+1]=t;
strcpy(IDb[a+1],IDc);
}
for(i=0;i<=c-1;i++)
printf("%s\n",IDb[i]);
i=0;
while(i<n)
{
if(age[i]<60)
printf("%s\n",ID[i]);
i++;
}
getchar();
getchar();
}
| 9 |
4,116 |
void main()
{
int n,age[100],i,j,m=0,p,h;
char hao[100][10],mid[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",hao[i],&age[i]);
for(i=0;i<n;i++)
if(age[i]>=60)
{
m=m+1;
for(j=i;j>=m;j--)
{
strcpy(mid,hao[j]);
strcpy(hao[j],hao[j-1]);
strcpy(hao[j-1],mid);
h=age[j];
age[j]=age[j-1];
age[j-1]=h;
}
}
for(i=0;i<m;i++)
for(j=0;j<m-i-1;j++)
if(age[j]<age[j+1])
{
strcpy(mid,hao[j]);
strcpy(hao[j],hao[j+1]);
strcpy(hao[j+1],mid);
h=age[j];
age[j]=age[j+1];
age[j+1]=h;
}
for(i=0;i<n;i++)
printf("%s\n",hao[i]);
} | 9 |
4,117 | int main()
{
int n,i,age,max,t,numold,numyoung;
char id[101][10],young[101][10];
int x[101],r[101];
scanf("%d",&n);
for (i=0;i<101;i++)
{
x[i]=0;
r[i]=0;
}
numold=0;numyoung=0;
for (i=1;i<=n;i++)
{
scanf("%s %d",id[i],&age);
if (age>=60)
{
x[i]=age;
numold++;
}
else
{
numyoung++;
strcpy(young[numyoung],id[i]);
}
}
for (i=1;i<101;i++)
{
max=1;
for (int j=2;j<101;j++)
{
if (x[j]>x[max]) max=j;
}
x[max]=0;
t=i;
r[i]=max;
max=t;
}
for (i=1;i<=numold;i++) printf("%s\n",id[r[i]]);
for (i=1;i<=numyoung;i++) printf("%s\n",young[i]);
}
| 9 |
4,118 | void main()
{
int a=0,b=0,c=0,d=0,n=0,k=0,i=0;
struct man
{
int number;
char name[10];
}m[100],p[100],s;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",m[i].name,&m[i].number);
for(i=0;i<n;i++)
if(m[i].number>=60)
{
p[k]=m[i];
k++;
}
for(a=k-1;a>0;a--)
{
for(b=0;b<a;b++)
if(p[b].number<p[b+1].number)
{ s=p[b+1];
p[b+1]=p[b];
p[b]=s;}
}
for(i=0;i<n;i++)
if(m[i].number<60)
{
p[k]=m[i];
k++;
}
for(i=0;i<k;i++)
printf("%s\n",p[i].name);
} | 9 |
4,119 | int main()
{
int n,a[100],l[100],b[100],i=0,j,k,p=0,q=0,t=0;
char s[100][12],lao[100][13]={'\0'},bu[100][13]={'\0'},w[12]={'\0'};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",&s[i],&a[i]);
if(a[i]>=60)l[p]=a[i],strcpy(lao[p],s[i]),p++;
else b[q]=a[i],strcpy(bu[q],s[i]),q++;}
for(i=0;i<p;i++){
for(j=0;j<p-1;j++){
if(l[j]<l[j+1])t=l[j],l[j]=l[j+1],l[j+1]=t,strcpy(w,lao[j]),strcpy(lao[j],lao[j+1]),strcpy(lao[j+1],w);
}}
for(i=0;i<p;i++){printf("%s\n",lao[i]);}
for(i=0;i<q;i++){printf("%s\n",bu[i]);}
} | 9 |
4,120 | 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 |
4,121 | int main()
{
int n,year[100],i,j,year2[100]={0},t,k;
char num[100][10],num2[100][10],p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",num[i]);
scanf("%d",&year[i]);
}
for(i=0;i<n;i++)
{
if(year[i]>=60)
{
for(k=0;k<10;k++)
{num2[i][k]=num[i][k];}
year2[i]=year[i];
}
}
for(j=0;j<n-1;j++)
for(i=0;i<n-j-1;i++)
{
if(year2[i]<year2[i+1])
{
t=year2[i];
year2[i]=year2[i+1];
year2[i+1]=t;
for(k=0;k<10;k++)
{ p=num2[i][k];
num2[i][k]=num2[i+1][k];
num2[i+1][k]=p;
}
}
}
for(i=0;i<n;i++)
{
if(year2[i]!=0)
printf("%s\n",num2[i]);
}
for(i=0;i<n;i++)
{
if(year[i]<60)
printf("%s\n",num[i]);
}
return 0;
}
| 9 |
4,122 | struct people
{char id[10];
int age;
}p[100];
void main()
{
int n,i,a[100],b[100],j,k,m=0;
char str[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&p[i].id,&p[i].age);
for(i=0,j=0,k=0;i<n;i++)
{
if(p[i].age>=60)
{
a[j++]=i;
m++;
}
else b[k++]=i;
}
for(i=0;i<m-1;i++)
for(j=0;j<m-1-i;j++)
{
if(p[a[j]].age<p[a[j+1]].age)
{
int t=p[a[j]].age;
p[a[j]].age=p[a[j+1]].age;
p[a[j+1]].age=t;
strcpy(str,p[a[j]].id);
strcpy(p[a[j]].id,p[a[j+1]].id);
strcpy(p[a[j+1]].id,str);
}
}
if(m!=0)
{
printf("%s",p[a[0]].id);
for(i=1;i<m;i++)
printf("\n%s",p[a[i]].id);
for(i=0;i<n-m;i++)
printf("\n%s",p[b[i]].id);
}
else
{
printf("%s",p[b[0]].id);
for(i=1;i<n;i++)
printf("\n%s",p[b[i]].id);
}
}
| 9 |
4,123 | main()
{
int n,m[100];
int t,i,j;
char str[100][10],s[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",str[i],&m[i]);
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
{
if(m[i]>=60)
{if(m[i+1]>=60)
{if(m[i+1]>m[i])
{strcpy(s,str[i]);strcpy(str[i],str[i+1]);strcpy(str[i+1],s);t=m[i];m[i]=m[i+1];m[i+1]=t;}
}
else {strcpy(s,str[i]);strcpy(str[i],str[i+1]);strcpy(str[i+1],s);t=m[i];m[i]=m[i+1];m[i+1]=t;}}
if(m[i]<60)
{
if(m[i+1]>=60) {strcpy(s,str[i]);strcpy(str[i],str[i+1]);strcpy(str[i+1],s);t=m[i];m[i]=m[i+1];m[i+1]=t;}
}
}
for(i=0;i<n;i++)
printf("%s\n",str[i]);
}
| 9 |
4,124 | struct
{
int age[100];
char ID[100][11];
}patient,*ppatient;
int main()
{
ppatient=&patient;
int n,i,j,k,num,m=0;
char id[11],ID_1[100][11],age_1[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",patient.ID[i],&patient.age[i]);
}
j=0;
for(i=0;i<n;i++){
if((*ppatient).age[i]>=60){
strcpy(ID_1[j],(*ppatient).ID[i]);
age_1[j]=(*ppatient).age[i];
m+=1;
j++;
}
}
for(j=m-1;j>0;j--){
for(k=0;k<j;k++){
if(age_1[k]<age_1[k+1]){
strcpy(id,ID_1[k+1]);
strcpy(ID_1[k+1],ID_1[k]);
strcpy(ID_1[k],id);
num=age_1[k+1];
age_1[k+1]=age_1[k];
age_1[k]=num;
}
}
}
for(i=0;i<m;i++){
printf("%s\n",ID_1[i]);
}
for(i=0;i<n;i++){
if((*ppatient).age[i]<60)
printf("%s\n",(*ppatient).ID[i]);
}
return 0;
} | 9 |
4,125 |
int main(){
int n,k;
scanf("%d",&n);
char ID[100][10];
int nl[100];
int i;
char e[10];
for(i=0;i<n;i++){
scanf("%s %d",ID[i],&nl[i]);
}
int m;
for(k=1;k<=n;k++){
for(i=0;i<n-k;i++){
if((nl[i]<60&&nl[i+1]>=60)||(nl[i]>=60&&nl[i+1]>=60&&nl[i+1]>nl[i]))
{
m=nl[i+1];
nl[i+1]=nl[i];
nl[i]=m;
strcpy(e,ID[i+1]);
strcpy(ID[i+1],ID[i]);
strcpy(ID[i],e);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",ID[i]);
}
return 0;
}
| 9 |
4,126 | 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 |
4,127 | struct patient
{
char id[10];
int age;
int turn;
}pat[100],temp;
void main()
{
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",pat[i].id,&pat[i].age);
pat[i].turn=i;
}
for(i=0;i<n;i++)
if(pat[i].age<60)
{
j=i+1;
while((pat[j].age<60)&&(j<n))j++;
if(pat[j].age>=60)
{
temp=pat[i];
pat[i]=pat[j];
pat[j]=temp;
}
}
for(i=0;(pat[i].age>=60)&&(i<n);i++)
for(j=i+1;j<n;j++)
if((pat[j].age>pat[i].age)||((pat[i].age==pat[j].age)&&(pat[j].turn<pat[i].turn)))
{
temp=pat[i];
pat[i]=pat[j];
pat[j]=temp;
}
for(i=0;i<n;i++)
if(pat[i].age<60)
{
for(j=i+1;j<n;j++)
if(pat[i].turn>pat[j].turn)
{
temp=pat[i];
pat[i]=pat[j];
pat[j]=temp;
}
}
for(i=0;i<n;i++)
printf("%s\n",pat[i].id);
} | 9 |
4,128 |
struct patient
{
char ID[10];
int age;
};
int main()
{
int n,m;
int i,j=0,k=0;
struct patient a[100],b[100],c[100],t[1];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",a[i].ID,&a[i].age);
if(a[i].age>=60)
{
strcpy(b[j].ID,a[i].ID);
b[j].age=a[i].age;
j=j+1;
}
else
{
strcpy(c[k].ID,a[i].ID);
c[k].age=a[i].age;
k=k+1;
}
}
m=j;
for(j=1;j<=m-1;j++)
{
for(i=0;i<=m-1-j;i++)
{
if(b[i].age<b[i+1].age)
{
strcpy(t[0].ID,b[i].ID);
t[0].age=b[i].age;
strcpy(b[i].ID,b[i+1].ID);
b[i].age=b[i+1].age;
strcpy(b[i+1].ID,t[0].ID);
b[i+1].age=t[0].age;
}
}
}
for(i=0;i<m;i++)
printf("%s\n",b[i].ID);
for(i=0;i<k;i++)
printf("%s\n",c[i].ID);
return 0;
} | 9 |
4,129 | struct patient
{
char id[10];
short int age;
};
void main()
{
int i,j,k,l,n;
struct patient pat[100],temp;
struct patient pa[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&pat[i].id,&pat[i].age);
for(i=0,j=0;i<n;i++)
if(pat[i].age>=60)
{
pa[j]=pat[i];
j++;
}
for(k=0;k<j-1;k++)
for(l=j-1;l>k;l--)
if(pa[l].age>pa[l-1].age)
{
temp=pa[l];
pa[l]=pa[l-1];
pa[l-1]=temp;
}
for(k=0;k<j;k++)
printf("%s\n",pa[k].id);
for(i=0;i<n;i++)
if(pat[i].age<60)
printf("%s\n",pat[i].id);
} | 9 |
4,130 | struct s
{
int d;
char c[20];
struct s *next;
};
void sort(struct s *head)
{
struct s *pre=head,*p=pre->next,*s;
s=(struct s *)malloc(sizeof(struct s));
scanf("%s %d",s->c,&s->d);
s->next=NULL;
if(s->d>=60)
{
while(p!=NULL&&p->d>=s->d)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
if(s->d<60)
{
while(p!=NULL)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
}
int main()
{
struct s *head,*p;
int n,i;
head=(struct s *)malloc(sizeof(struct s));
scanf("%d",&n);
head->next=NULL;
for(i=0;i<n;i++)
{
sort(head);
}
p=head->next;
while(p!=NULL)
{
printf("%s\n",p->c);
p=p->next;
}
return 0;
} | 9 |
4,131 | struct pa{
char num[15];
int age;
struct pa *next;
};
int main()
{
struct pa *p,*p1,*p2;
int i=0,n;
scanf("%d",&n);
p1=(struct pa *)malloc(LEN);
scanf("%s%d",p1->num,&p1->age);
p1->next=NULL;
p2=p1;
p=p2;
for(i=1;i<n;i++){
p1=(struct pa *)malloc(LEN);
scanf("%s%d",p1->num,&p1->age);
if(p1->age<60){
while(p2->next!=NULL)
p2=p2->next;
p2->next=p1;
p1->next=NULL;
}
else{
if(p->age<p1->age){
p1->next=p;
p=p1;
}
else{
while(p2->next!=NULL&&(p2->next)->age>=p1->age)
p2=p2->next;
p1->next=p2->next;
p2->next=p1;
}
}
p2=p;
}
while(p!=NULL){
printf("%s\n",p->num);
p=p->next;
}
return 0;
} | 9 |
4,132 | void main()
{
struct pat
{
char id[10];
int age;
}pat[201];
int i,n,j,x=0,y=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pat[i].id,&pat[i].age);
printf("\n");
}
for(i=0;i<n;i++)
{
if(pat[i].age>=60)
{ pat[100+x]=pat[i];
x++;}
else
{
pat[y]=pat[i];
y++;
}
}
for(i=0;i<x-1;i++)
{
for(j=0;j<x-i-1;j++)
{
if(pat[100+j].age<pat[101+j].age)
{
pat[200]=pat[100+j];
pat[100+j]=pat[101+j];
pat[101+j]=pat[200];
}
}
}
for(i=0;i<x;i++)
printf("%s\n",pat[100+i].id);
for(i=0;i<y;i++)
printf("%s\n",pat[i].id);
}
| 9 |
4,133 |
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 |
4,134 | struct patient
{
char id[20];
int age;
int num;
};
int main()
{
int n,i,j;
char id1[20];
int age1,u;
struct patient temp;
struct patient *p;
struct patient a[500];
scanf("%d",&n);
p=a;
u=0;
for(;p<a+n;p++)
{
scanf("%s",id1);
scanf("%d",&age1);
strcpy(p->id,id1);
p->age=age1;
p->num=u;
u++;
}
p=a;
for(i=n-2;i>=0;i--)
{
for(j=0;j<=i;j++)
{
if((*(p+j)).age>=60||(*(p+j+1)).age>=60)
{
if((*(p+j)).age<(*(p+j+1)).age)
{
temp=*(p+j);
*(p+j)=*(p+j+1);
*(p+j+1)=temp;
}
}
else continue;
}
}
p=a;
for(;p<a+n;p++)
{
printf("%s\n",p->id);
}
return 0;
} | 9 |
4,135 |
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 |
4,136 | 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 |
4,137 | struct student
{
char c[20];
int num;
struct student*next;
};
struct student*creat(int n)
{
int i,r;
struct student*p,*p1,*p2,*p3,*p4;
p1=(struct student*)malloc(sizeof(struct student));
scanf("%s %d",p1->c,&p1->num);
p1->next=NULL;
p=p1;
r=0;
p2=p1;
for(i=0;i<n-1;i++)
{
p4=(struct student*)malloc(sizeof(struct student));
scanf("%s %d",p4->c,&p4->num);
if(p4->num>=60)
{
for(p2=p,p3=p,r=0;p2!=NULL;)
{
if(p4->num>p2->num)
{
if(p2==p3)
{
p=p4;
p4->next=p2;
}
else
{
p3->next=p4;
p4->next=p2;
}
r=1;
break;
}
if(p4->num<=p2->num)
{
p3=p2;
p2=p2->next;
}
}
if(r==0)
{
p3->next=p4;
p4->next=NULL;
}
}
else
{
p2=p;
while(p2!=NULL)
{
p3=p2;
p2=p2->next;
}
p3->next=p4;
p4->next=NULL;
}
}
return p;
}
void print(struct student*p)
{
struct student*p1;
p1=p;
while(p1!=NULL)
{
printf("%s\n",p1->c);
p1=p1->next;
}
}
void main()
{
struct student*p,*p1;
int n;
scanf("%d\n",&n);
p=creat(n);
print(p);
}
| 9 |
4,138 | struct bing
{
char id[10];
int age;
}person[100],old[100];
main()
{
int n,i,j=0,k,b;
char e[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",person[i].id,&person[i].age);
if(person[i].age>=60)
{
strcpy(old[j].id,person[i].id);
old[j].age=person[i].age;
j=j+1;
}
}
for(k=1;k<j;k++)
for(i=0;i<j-k;i++)
{
if(old[i].age<old[i+1].age)
{
strcpy(e,old[i].id);
strcpy(old[i].id,old[i+1].id);
strcpy(old[i+1].id,e);
b=old[i].age;
old[i].age=old[i+1].age;
old[i+1].age=b;
}
}
for(i=0;i<j;i++)
printf("%s\n",old[i].id);
for(i=0;i<n;i++)
if(person[i].age<60)
printf("%s\n",person[i].id);
return 0;
}
| 9 |
4,139 | 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 |
4,140 | struct stu
{
int w;
char c[10];
struct stu *next;
};
int n;
struct stu*creat(int m)
{
struct stu *head,*p1,*p2,*p3;
int i;
n=0;
p1=p2=(struct stu*)malloc(sizeof(struct stu));
head=p1;
p1->next=NULL;
n=0;
scanf("%s %d",p1->c,&p1->w);
for(i=0;i<m-1;i++)
{ p1=(struct stu*)malloc(sizeof(struct stu));
scanf("%s %d",p1->c,&p1->w);
if(p1->w<60)
{for(p2=head;p2->next!=NULL;p2=p2->next)
;
p2->next=p1;
p1->next=NULL;
}
else
{
p2=head;
while((p1->w<=p2->w)&&(p2->next!=NULL))
{
p3=p2;
p2=p2->next;
}
if(p1->w>p2->w)
{
if(head==p2)
head=p1;
else p3->next=p1;
p1->next=p2;
}
else
{p2->next=p1;p1->next=NULL;
}
}
}
return(head);
}
void main()
{
int m,i;
struct stu *head,*p;
scanf("%d",&m);
head=creat(m);
p=head;
for(i=0;i<m;i++)
{printf("%s\n",p->c);
p=p->next;
}
} | 9 |
4,141 | struct patient
{
char num[10];
int age;
} p[100];
void main()
{
int i,j=0,k=0,t,l,n;
char other[100][10],a[10];
struct patient old[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",p[i].num,&p[i].age);
for(i=0;i<n;i++)
{
if(p[i].age>=60)
{
strcpy(old[j].num,p[i].num);
old[j].age=p[i].age;
j++;
}
else
{
strcpy(other[k],p[i].num);
k++;
}
}
for(i=0;i<j-1;i++)
{
for(l=0;l<j-1-i;l++)
{
if(old[l].age<old[l+1].age)
{
t=old[l].age;
old[l].age=old[l+1].age;
old[l+1].age=t;
strcpy(a,old[l].num);
strcpy(old[l].num,old[l+1].num);
strcpy(old[l+1].num,a);
}
}
}
for(i=0;i<j;i++)
printf("%s\n",old[i].num);
for(i=0;i<k;i++)
printf("%s\n",other[i]);
}
| 9 |
4,142 | 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 |
4,143 | struct P
{
char id[10];
int age;
}
pa[100];
struct P pb[100];
int main(){
int n,r=0,s=0,i,o,p,j,k;
scanf("%d",&n);
struct P temp;
for(i=0;i<n;i++){
scanf("%s%d",temp.id,&(temp.age));
if(temp.age>=60){
pb[r]=temp;
r++;
}else{
pa[s]=temp;
s++;
}
}
for(o=0;o<r;o++){
for(p=0;p<r-o;p++){
if(pb[p].age<pb[p+1].age){
struct P tmp=pb[p];
pb[p]=pb[p+1];
pb[p+1]=tmp;
}
}
}
for(j=0;j<r;j++){
printf("%s\n",pb[j].id);
}
for(k=0;k<s;k++){
printf("%s\n",pa[k].id);
}
return 0;
} | 9 |
4,144 | struct people
{
char num[10];
int age;
struct people *next;
};
void main()
{
struct people *head,*p0,*p,*s;
head=(struct people *)malloc(sizeof(struct people));
head->next=NULL;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p0=head;
p=p0->next;
s=(struct people *)malloc(sizeof(struct people));
s->next=NULL;
scanf("%s %d",s->num,&s->age);
while(p!=NULL&&((s->age>=60&&s->age<=p->age)||s->age<60))
{
p0=p;
p=p->next;
}
p0->next=s;
s->next=p;
}
p=head->next;
while(p!=NULL)
{
printf("%s\n",p->num);
p=p->next;
}
} | 9 |
4,145 | 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 |
4,146 | 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 |
4,147 | void main()
{
int n;
scanf("%d\n",&n);
struct patient
{
char num[10];
int age;
}pa[100],pao[100],pay[100],blank;
int i,j=0,k=0;
for(i=0;i<n;i++)
{
scanf("%s",pa[i].num);
scanf("%d",&pa[i].age);
if(pa[i].age>=60)
pao[j++]=pa[i];
else
pay[k++]=pa[i];
}
int t;
for(i=0;i<j;i++)
{
for(t=i+1;t<j;t++)
{
if(pao[t].age>pao[i].age)
{
blank=pao[i];
pao[i]=pao[t];
pao[t]=blank;
}
}
}
for(i=0;i<j;i++)
{
if(pao[i].age!=pao[i-1].age)
{
for(t=0;t<n;t++)
if(pa[t].age==pao[i].age)
printf("%s\n",pa[t].num);
}
}
for(i=0;i<k;i++)
printf("%s\n",pay[i].num);
}
| 9 |
4,148 | 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 |
4,149 | struct peo
{
char id[10];
int age;
}a[150],b[150];
void main()
{
int n,i,j=0,e,k;
char c[10];
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)
{
strcpy(b[j].id,a[i].id);
b[j].age=a[i].age;
j++;
}
}
for(k=1;k<j;k++)
{
for(i=0;i<j-k;i++)
{
if(b[i].age<b[i+1].age)
{
e=b[i+1].age;
b[i+1].age=b[i].age;
b[i].age=e;
strcpy(c,b[i+1].id);
strcpy(b[i+1].id,b[i].id);
strcpy(b[i].id,c);
}
}
}
for(i=0;i<j;i++)
{
printf("%s\n",b[i].id);
}
for(i=0;i<n;i++)
{
if(a[i].age<60)
printf("%s\n",a[i].id);
}
} | 9 |
4,150 | void main()
{
int n,i,j,age[100],dengji[100],p,t;
char id[100][10],c;int jishuqi=0,k;
int l,m;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s%d",id[i],&age[i]);
dengji[i]=i;
}
for(i=0;i<=n-2;i++)
for(j=0;j<=n-2-i;j++)
{
if(age[j]<age[j+1])
{
t=age[j];
age[j]=age[j+1];
age[j+1]=t;
k=dengji[j];
dengji[j]=dengji[j+1];
dengji[j+1]=k;
for(p=0;p<=9;p++)
{
c=id[j][p];
id[j][p]=id[j+1][p];
id[j+1][p]=c;
}
}
if(age[j]==age[j+1])
{
if(dengji[j]>dengji[j+1])
{
k=dengji[j];
dengji[j]=dengji[j+1];
dengji[j+1]=k;
for(p=0;p<=9;p++)
{
c=id[j][p];
id[j][p]=id[j+1][p];
id[j+1][p]=c;
}
}
}
}
for(i=0;i<=n-2;i++)
for(j=0;j<=n-2-i;j++)
{
if(age[j]<60)
{
if(dengji[j]>dengji[j+1])
{
k=dengji[j];
dengji[j]=dengji[j+1];
dengji[j+1]=k;
t=age[j];
age[j]=age[j+1];
age[j+1]=t;
for(p=0;p<=9;p++)
{
c=id[j][p];
id[j][p]=id[j+1][p];
id[j+1][p]=c;
}
}
}
}
for(i=0;i<=n-1;i++)
printf("%s\n",id[i]);
}
| 9 |
4,151 | struct student
{
char num[10];
int o;
struct student *next;
};
struct student *create(int n)
{
struct student *head,*p1,*p2;
int i;
int scholar(struct student *p);
p1=(struct student*)malloc(len);
scanf("%s %d",p1->num,&p1->o);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<=n-1;i++)
{
p1=(struct student*)malloc(len);
scanf("%s %d",p1->num,&p1->o);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return head;
}
struct student *max(struct student *head)
{
struct student *p,*m;
m=head;
p=head->next;
while(p)
{
if(p->o>m->o) m=p;
p=p->next;
}
return m;
}
void main()
{
int n;
struct student *head,*m,*p;
struct student *create(int n);
struct student *max(struct student *head);
scanf("%d",&n);
head=create(n);
p=head;
for(;;)
{
m=max(p);
if(m->o>=60)
{
printf("%s\n",m->num);
m->o=-1;
}
else break;
}
p=head;
while(p)
{
if(p->o!=-1) printf("%s\n",p->num);
p=p->next;
}
}
| 9 |
4,152 | int main(){
int n,i,age[100];
char id[100][10];
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s%d",id[i],&(age[i]));
}
int e;
char e_id[10];
for(int k=1;k<=n;k++){
for (int m=0;m<n-k;m++){
if((age[m]>=60&&age[m+1]>=60&&age[m]<age[m+1])||(age[m]<60&&age[m+1]>=60)){
e=age[m+1];
strcpy(e_id,id[m+1]);
age[m+1]=age[m];
strcpy(id[m+1],id[m]);
age[m]=e;
strcpy(id[m],e_id);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",id[i]);
}
return 0;
} | 9 |
4,153 | int main()
{
struct patient
{char id[10];
int age;
}patient[100],old[100],t;
int a,i=0,j=0,k=0,r,i1;
scanf("%d",&a);
getchar();
for(i=0;j+i<a;i++)
{
scanf("%s%d",patient[i].id,&patient[i].age);
if(patient[i].age>=60)
{
old[j]=patient[i];
j++;
i--;
}
}
for(r=0;r<j-1;r++)
for(k=0;k<j-1-r;k++)
if(old[k].age<old[k+1].age)
{t=old[k];old[k]=old[k+1];old[k+1]=t;}
for(r=0;r<j;r++)
printf("%s\n",old[r].id);
for(r=0;r<i;r++)
printf("%s\n",patient[r].id);
return 0;
}
| 9 |
4,154 | struct Info{
char sID[10];
int nAge;
};
void main(){
int i,n,j,l;
struct Info t;
scanf("%d",&n);
struct Info patients[100];
struct Info overpatients[100];
l=0;
for (i=0;i<n;i++){
scanf("%s%d",patients[i].sID,&patients[i].nAge);
if (patients[i].nAge>=60){//?????60?????????
overpatients[l]=patients[i];
l++;
}
}
for (i=0;i<l-1;i++)
for (j=1;j<l-i;j++){
if (overpatients[j-1].nAge<overpatients[j].nAge){
t=overpatients[j-1];
overpatients[j-1]=overpatients[j];
overpatients[j]=t;
}
}
for (i=0;i<l;i++){
printf("%s\n",overpatients[i].sID);
}
for (i=0;i<n;i++)
if (patients[i].nAge<60){
printf("%s\n",patients[i].sID);
}
}
| 9 |
4,155 |
int main()
{
struct patient_t {
char id[10];
int age;
} patients[100], t;
int i, j, n;
scanf("%d", &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,156 | int main()
{
char id[100][10],id1[100][10],t[10];
int n,i,j,b,age[100],age1[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",id[i]);
scanf("%d",&age[i]);
strcpy(id1[i],id[i]);
age1[i]=age[i];
}
for(i=0;i<n-1;i++){
for(j=0;j<n-i-1;j++){
if(age1[j]<age1[j+1]){
b=age1[j];
age1[j]=age1[j+1];
age1[j+1]=b;
strcpy(t,id1[j]);
strcpy(id1[j],id1[j+1]);
strcpy(id1[j+1],t);
}
}
}
for(i=0;i<n;i++){
if(age1[i]>=60)
printf("%s\n",id1[i]);
}
for(i=0;i<n;i++){
if(age[i]<60)
printf("%s\n",id[i]);
}
return 0;
} | 9 |
4,157 |
struct data
{
int a[100];
char num[100][15];
}data;
void main()
{
int i,b,k=0,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",data.num[i],&data.a[i]);
if(data.a[i]>=60) k++;
}
for(j=0;j<k;j++)
{
b=0;
for(i=0;i<n;i++)
{
if(data.a[i]>data.a[b])
b=i;
}
printf("%s\n",data.num[b]);
data.a[b]=0;
}
for(i=0;i<n;i++)
{
if(data.a[i]!=0)
printf("%s\n",data.num[i]);
}
} | 9 |
4,158 |
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 |
4,159 | 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[LEN];
for(k = 1 ; k <= n; k++){
for(i = 0; i < n- k; i++){
if((age[i]<age[i+1]&&age[i]>=60)||(age[i]<60&&age[i+1]>=60)){
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 |
4,160 | void main()
{
int n,i,d=0,q,j;
int b[101],f[101];
char a[101][10],c[101][10],e[101][10];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d",a[i],&b[i]);
}
q=n-1;j=0;
for(i=n-1;i>=0;i--)
{
if (b[i]<60)
{
strcpy(c[q],a[i]);
q=q-1;
}
}
for (i=0;i<n;i++)
{
if (b[i]>=60)
{
strcpy(c[j],a[i]);
f[j]=b[i];
d=d+1;
j=j+1;
}
}
for (i=0;i<d;i++)
{
for (j=0;j<d-1;j++)
{
if (f[j]<f[j+1])
{
f[100]=f[j];
f[j]=f[j+1];
f[j+1]=f[100];
strcpy(c[100],c[j]);
strcpy(c[j],c[j+1]);
strcpy(c[1+j],c[100]);
}
}
}
for(i=0;i<n;i++)
printf("%s\n",c[i]);
} | 9 |
4,161 | struct mao
{
char name[10];
int age;
}pat[100];
int main()
{
int max (int age[100],int n);
int n,i,k;
int age[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",pat[i].name,&pat[i].age);
if(pat[i].age>=60)
age[i]=200+pat[i].age;
else
age[i]=101-i;
}
for(i=0;i<n;i++)
{
k=max (age,n);
printf("%s\n",pat[k].name);
}
return 0;
}
int max (int age[100],int n)
{
int a=0,j=0,k=0;
for(j=0;j<n;j++)
{
if(age[j]>a)
{
a=age[j];
k = j;
}
}
age[k]=0;
return k;
} | 9 |
4,162 | int main()
{
struct pa
{
char ID[11];
int age;
struct pa *next;
}*head,*p1,*p2,*p3,*p4;
int tage;
char tID[11];
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct pa*)malloc(sizeof(struct pa));
if(i==0)
head=p1;
scanf("%s %d",p1->ID,&p1->age);
if(i!=0)
p2->next=p1;
p2=p1;
}
p1->next=NULL;
p1=head;
p2=p1->next;
for(i=0;i<n;i++)//??
{
p3=p1;
p4=p2;
for(j=0;j<n-1;j++)
{
if(p3->age<p4->age && p4->age>=60)
{
strcpy(tID,p3->ID);
tage=p3->age;
strcpy(p3->ID,p4->ID);
p3->age=p4->age;
strcpy(p4->ID,tID);
p4->age=tage;
}
p3=p3->next;
p4=p4->next;
}
}
p1=head;
while(p1!=NULL)
{
printf("%s\n",p1->ID);
p1=p1->next;
}
return 0;
} | 9 |
4,163 | struct patient{
char num[20];
int age;
};
int main()
{
void bubble(struct patient a[],int len);
int n,i,old,sum,age,j;
struct patient a[100];
struct patient b[100];
char str[100]={'\0'};
char str1[100]={'\0'};
scanf("%d",&n);
for(i=0,j=0,sum=0;sum<=n;)
{
age=0;
strcpy(str,str1);
scanf("%s %d",str,&age);
if(age>=60){strcpy(a[i].num,str);a[i].age=age;i++;sum++;}
else{strcpy(b[j].num,str);b[j].age=age;j++;sum++;}
}
//printf("%d",i);
bubble(a,i);
old=i;
for(i=0;i<old;i++)
{
printf("%s\n",a[i].num);
}
for(i=0;i<j;i++)
{
printf("%s\n",b[i].num);
}
return 0;
}
void bubble(struct patient a[],int len)
{
int i,pass;
struct patient temp;//temp????????????
for(pass=1;pass<len;pass++)
{
for(i=0;i<len-pass;i++)
{
if(a[i].age<a[i+1].age)
{temp=a[i];a[i]=a[i+1];a[i+1]=temp;}
}
}
}
| 9 |
4,164 | 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 |
4,165 | 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 |
4,166 | 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 |
4,167 | struct sick
{
int age;
char id[100];
struct sick *next;
};
struct sick *insert(struct sick *head,struct sick *new1)
{
struct sick *p0,*p1,*p2,*p;
p1=head;
p0=new1;
if(head==NULL)
{
head=p0;
p0->next=NULL;
}
else
{
if(p0->age<60)
{
p1=head;
while(p1!=NULL)
{
p2=p1;
p1=p1->next;
}
p2->next=p0;
p0->next=NULL;
}
else
{
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;
}
}
}
return(head);
}
void main()
{
struct sick *head,*p;
int n,i;
head=NULL; /*head????NULL????,????????*/
scanf("%d",&n);
struct sick *insert(struct sick *head,struct sick *new1);/*??*/
for(i=0;i<n;i++)
{
p=(struct sick*)malloc(sizeof(struct sick));
scanf("%s %d",p->id,&p->age);
head=insert(head,p);
}
p=head;
do
{
printf("%s\n",p->id);
p=p->next;
}while(p!=NULL);
}
| 9 |
4,168 |
struct RAT
{
int weight;
char color[10];
struct RAT *next;
};
int N;
int main()
{
void sort(struct RAT *p);
int i;
scanf("%d",&N);
struct RAT *head,*p1,*p2;
p1=(struct RAT *)malloc(Len);
scanf("%s %d",p1->color,&p1->weight);
p1->next=NULL;
head=p1;
p2=p1;
for (i=1;i<N;i++)
{
p1=(struct RAT *)malloc(Len);
scanf("%s %d",p1->color,&p1->weight);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
sort (head);
for (p1=head;p1!=NULL;p1=p1->next)
printf("%s\n",p1->color);
return 0;
}
void sort(struct RAT *p)
{
int j,i;
struct RAT *pt,temp;
for(j=0;j<N;j++)
for(pt=p,i=0;i<N-j-1;pt=pt->next,i++)
{
if((pt->weight<60&&pt->next->weight>=60)||(pt->weight>=60&&pt->next->weight>=60&&pt->weight<pt->next->weight))
{
temp=*pt;
pt->weight=pt->next->weight;
strcpy(pt->color,pt->next->color);
pt->next->weight=temp.weight;
strcpy(pt->next->color,temp.color);
}
}
} | 9 |
4,169 |
int main(){
int n,i,j;
struct ren{
char b[100];
int c;
}a[100],d[100],m;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",a[i].b,&a[i].c);
d[i]=a[i];
}
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if(d[j].c<d[j+1].c){
m=d[j+1];
d[j+1]=d[j];
d[j]=m;
}
}
}
for(i=0;i<n;i++){
if(d[i].c>=60){
printf("%s\n",d[i].b);
}
}
for(i=0;i<n;i++){
if(a[i].c<60){
printf("%s\n",a[i].b);
}
}
return 0;
}
| 9 |
4,170 | main()
{
int n,i,j,f;
int k=0;
scanf("%d",&n);
char a[100][2000],e[11];
char d[100][2000];
int b[100];
int c[100];
for(i=0;i<=n-1;i++)
scanf("%s %d",a[i],&b[i]);
for(i=0;i<n;i++)
{
if(b[i]>=60)
{
c[k]=b[i];
strcpy(d[k],a[i]);
k++;
}
}
for(j=k-2;j>=0;j--)
{
for(i=j;i<=k-2;i++)
{
if(c[i]<c[i+1])
{
strcpy(e,d[i]);
strcpy(d[i],d[i+1]);
strcpy(d[i+1],e);
f=c[i];c[i]=c[i+1];c[i+1]=f;
}
}
}
for(i=0;i<k;i++)
printf("%s\n",d[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;i++)
printf("%s\n",d[i]) ;
}
| 9 |
4,171 |
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 |
4,172 | int main(){
char s[100][MAX+1];
char g[100][MAX+1];
int h[100];
int k[100],a,i,j;
char q[100];
int n,e;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s[i]);
scanf("%d",&k[i]);
}
a=0;
j=0;
for(i=0;i<n;i++){
if(k[i]>=60){
a++;
h[j]=k[i];
strcpy(g[j],s[i]);
j++;
k[i]=0;
}
}
for(i=1;i<=a;i++){
for(j=0;j<a-i;j++){
if(h[j]<h[j+1]){
e=h[j];
h[j]=h[j+1];
h[j+1]=e;
strcpy(q,g[j]);
strcpy(g[j],g[j+1]);
strcpy(g[j+1],q);
}
}
}
for(i=0;i<a;i++){
printf("%s\n",g[i]);
}
for(i=0;i<n;i++){
if(k[i]!=0)
printf("%s\n",s[i]);
}
return 0;
} | 9 |
4,173 | struct f
{
char *id;
char id_[11];
int age;
struct f*next;
};
struct in
{
struct f*old;
struct f*young;
int num;
};
int main()
{
int n,num_;
scanf("%d",&n);
struct f *p2,*p3;
struct in *p1;
struct in*cr(int x);//?????????????????????
p1=cr(n);
p3=p1->young;
p2=p1->old;
num_=p1->num;
void sort (struct f*p,int x);
sort(p2,num_);
while(p2)
{
printf("%s\n",p2->id);
p2=p2->next;
}
while(p3)
{
printf("%s\n",p3->id);
p3=p3->next;
}
}
struct in*cr(int x)
{
struct f* head1,*head2,*p;
int k=0;
struct in *p3;
p3=(struct in *)malloc(sizeof (struct in));
head1=(struct f*)malloc(sizeof (struct f));
head2=(struct f*)malloc(sizeof (struct f));
p3->old=head1;//??????????????
p3->young=head2;
struct f*p4,*p5,*p6,*p7;
p4=head1;
p6=head2;
int i;
for(i=0;i<x;i++)
{
p=(struct f*)malloc(sizeof (struct f));
scanf("%s %d",p->id_,&p->age);
if(p->age>=60)//????????????
{
p4->age=p->age;
p4->id=p->id_;
p5=p4;
p4=(struct f*)malloc(sizeof (struct f));
p5->next=p4;
k++;
}
else//??????????????
{
p6->age=p->age;
p6->id=p->id_;
p7=p6;
p6=(struct f*)malloc(sizeof (struct f));
p7->next=p6;
}
}
p5->next=0;
p7->next=0;
p3->num=k;
return p3;//?????
}
void sort (struct f*p,int x)
{
int i,j,k1;
char *k2;
struct f*p1,*p2;
for(i=0;i<x-1;i++)//???????????
for(p1=p,j=0;i+j<x-1;j++,p1=p1->next)
{
p2=p1->next;
if(p2->age>p1->age)
{
k1=p2->age;
p2->age=p1->age;
p1->age=k1;
k2=p2->id;
p2->id=p1->id;
p1->id=k2;
}
}
}
| 9 |
4,174 | 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 |
4,175 | 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 |
4,176 | 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 |
4,177 | struct people
{
char ID[10];
int age;
};
void main()
{
int n, i, t;
struct people peo[100];
struct people old[100];
void bubble(struct people a[100], int n);
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%s", peo[i].ID);
scanf("%d", &peo[i].age);
}
t = 0;
for(i=0; i<n; i++)
{
if(peo[i].age>=60)
{
strcpy(old[t].ID, peo[i].ID);
old[t].age = peo[i].age;
t++;
}
else
continue;
}
bubble(old, t);
for(i=0; i<t; i++)
printf("%s\n", old[i].ID);
for(i=0; i<n; i++)
{
if(peo[i].age<60)
printf("%s\n", peo[i].ID);
}
}
void bubble(struct people a[100], int n)
{
int i, j;
struct people t;
for(i=1; i<n; i++)
for(j=0; j<n-i; j++)
{
if(a[j].age<a[j+1].age)
{
t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
} | 9 |
4,178 | int n;
struct student
{
int a;
struct student *next;
char num[20];
};
struct student *creat()
{
struct student *head,*headtwo,*p1,*p2,*p3,*p4;
p1=(struct student *)malloc(sizeof(struct student));
scanf("%s",p1->num);
scanf("%d",&p1->a);
head=(struct student *)malloc(sizeof(struct student));
head->next=p1;
p2=head;
p1->next=NULL;
headtwo=(struct student *)malloc(sizeof(struct student));p4=headtwo;p4->next=NULL;
int i,t=0;
for (i=0;i<n-1;i++)
{
t=0;
p3=(struct student *)malloc(sizeof(struct student));
scanf("%s",p3->num);
scanf("%d",&p3->a);
if(p3->a>=60)
{
p2=head;
p1=head->next;
while(p1!=NULL)
{
if(p3->a>p1->a)
{
p3->next=p1;p2->next=p3;t=1;break;
}
p2=p1;
p1=p1->next;
}
if(t==0) {p2->next=p3;p3->next=NULL;}
}
if(p3->a<60)
{
p4->next=p3;
p4=p3;
p4->next=NULL;
}
}
p1=head;
while(p1->next!=NULL)
{
p1=p1->next;
}
p1->next=headtwo->next;
return head;
}
void main()
{
scanf("%d",&n);
struct student *head,*p;
head=creat();
p=head->next;
while (p!=NULL)
{
printf("%s\n",p->num);
p=p->next;
}
}
| 9 |
4,179 |
int main(){
int n,i,j;
char id[NUM][LEN];
int nl[NUM];
char id_old[NUM][LEN],id_young[NUM][LEN];
int nl_old[NUM];
int a=0,b=0;
scanf("%d",&n);
char ids[LEN];
for(i=0;i<n;i++){
scanf("%s %d",&id[i],&nl[i]);
if(nl[i]>=60){
strcpy(id_old[a],id[i]);
nl_old[a]=nl[i];
a++;
}
else{
strcpy(id_young[b],id[i]);
b++;
}
}
int e;
for(i=1;i<=a;i++){
for(j=0;j<a-i;j++){
if(nl_old[j]<nl_old[j+1]){
e=nl_old[j+1];
nl_old[j+1]=nl_old[j];
nl_old[j]=e;
strcpy(ids,id_old[j+1]);
strcpy(id_old[j+1],id_old[j]);
strcpy(id_old[j],ids);
}
}
}
for(i=0;i<a;i++){
printf("%s\n",id_old[i]);
}
for(i=0;i<b;i++){
printf("%s\n",id_young[i]);
}
return 0;
} | 9 |
4,180 | struct patient
{
char num[10];
int age;
struct patient *next;
};
int n;
struct patient *creat(void)
{
struct patient *head;
struct patient *p1,*p2;
int num=1;
head=NULL;
while(num<=n)
{
p1=(struct patient *)malloc(LEN);
scanf("%s %d",p1->num,&p1->age);
if (num==1)
head=p1;
else
p2->next=p1;
p2=p1;
num++;
}
p2->next=NULL;
return (head);
}
int main()
{
struct patient *pt,*p,*pre;
int i,max,num=0;
scanf("%d",&n);
pt=creat();
for (p=pt;p;p=p->next)
{
if (p->age>=60)
num++;
}
for (i=1;i<=num;i++)
{
max=59;
for (p=pt;p;p=p->next)
{
if (max<p->age)
max=p->age;
}
for (p=pre=pt;p;p=p->next)
{
if (p->age!=max)
pre=p;
else
break;
}
printf("%s\n",p->num);
if (p==pt)
pt=p->next;
else
pre->next=p->next;
}
for (p=pt;p;p=p->next)
printf("%s\n",p->num);
return 0;
} | 9 |
4,181 | int main()
{
char a[100][1000];
int b[100];
char c[100][1000];
int q,w,e;
q=0;
w=0;
int n;
int i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
int y;
char x[100][1000];
scanf("%s %d",x,&y);
if(y>=60)
{
strcpy(a[q],x[0]);
b[q]=y;
q++;
}
else
{
strcpy(c[w],x[0]);
w++;
}
}
int h;
char H[100][1000];
for(i=1;i<10000;i++)
{
for(j=0;j<q;j++)
{
if(b[j]<b[j+1])
{
h=b[j];
b[j]=b[j+1];
b[j+1]=h;
strcpy(H[0],a[j]);
strcpy(a[j],a[j+1]);
strcpy(a[j+1],H[0]);
}
}
}
for(i=0;i<q;i++)
{
printf("%s\n",a[i]);
}
for(i=0;i<w;i++)
printf("%s\n",c[i]);
} | 9 |
4,182 | struct patient
{
char id[20];
int age;
struct patient *next;
};
void main()
{
struct patient *head,*p1,*p2,*p0;
int i,n;
scanf("%d",&n);
p1=p2=(struct patient*)malloc(LEN);
head=NULL;
for(i=0;i<n;i++){
scanf("%s %d",&p1->id,&p1->age);
p1->next=NULL;
if(i==0){head=p1; }
else{
if((p1->age>60)&&(p1->age>head->age)){p0=head;p1->next=p0;head=p1;}
else{
p0=head;
p2=head->next;
if((p1->age)<60){
while(p2!=NULL){ p0=p2;p2=p2->next;}
p0->next=p1;
}
else{
while((p2!=NULL)&&((p1->age)<=(p2->age))){p0=p2; p2=p2->next;}
p0->next=p1;
p1->next=p2;
}
}
}
p1=(struct patient*)malloc(LEN);
}
p1=head;
for(i=0;i<n-1;i++){
printf("%s\n",p1->id);
p1=p1->next;
}
printf("%s",p1->id);
} | 9 |
4,183 | int main(){
struct patient {
char id[11];
int age;
}*p,*p60_up,*p60_low,t;
int n,i,j,k=0;
scanf ("%d",&n);
p = (struct patient *) malloc( sizeof(struct patient) * n );
for(i=0;i<n;i++){
scanf("%s",&(p[i].id));
scanf("%d",&(p[i].age));
}
for(i=0;i<=n;i++){
if(p[i].age>=60){
k++;
}
}
p60_up = (struct patient *) malloc( sizeof(struct patient) * k );
p60_low= (struct patient *) malloc( sizeof(struct patient) * (n-k) );
for(i=0,j=0;i<n;i++){
if(p[i].age>=60){
p60_up[j]=p[i];
j++;
}
}for(i=0,j=0;i<n;i++){
if(p[i].age<60){
p60_low[j]=p[i];
j++;
}
}
for( j = 1 ; j <= k ; j++){
for( i = 0; i < k - j; i++){
if(p60_up[i].age<p60_up[i+1].age){
t = p60_up[i+1];
p60_up[i+1] = p60_up[i];
p60_up[i] = t;
}
}
}
for(i=0;i<k;i++){
puts(p60_up[i].id);
}
free(p60_up);
for(i=0;i<n-k;i++){
puts(p60_low[i].id);
}
free(p60_low);
return 0;
} | 9 |
4,184 | int main()
{
int n,i;
scanf ("%d",&n);
struct patient
{
char ID[10];
int age;
struct patient *next;
struct patient *pre;
};
struct patient *p,*head,*q,*m,*temp;
p=(struct patient*)malloc(sizeof(struct patient));
head=p;
temp=(struct patient*)malloc(sizeof(struct patient));
for (i=0;i<n;i++)
{
scanf ("%s %d",p->ID,&p->age);
if(i!=n-1)
{
p->next=(struct patient*)malloc(sizeof(struct patient));
p->next->pre=p;
p->next->next=NULL;
p=p->next;
}
}
for (p=head;p!=NULL;p=p->next)
{
for (q=p->next;q!=NULL;q=q->next)
{
if ((p->age < q->age)&&(q->age>=60))
{
for (m=q;m!=p;m=m->pre)
{
temp->age=m->age;
m->age=m->pre->age;
m->pre->age=temp->age;
strcpy(temp->ID,m->ID);
strcpy(m->ID,m->pre->ID);
strcpy(m->pre->ID,temp->ID);
}
}
}
}
for (p=head;p!=NULL;p=p->next)
printf ("%s\n",p->ID);
return 0;
}
| 9 |
4,185 | void main()
{
int n;
scanf("%d",&n);
struct patient
{
char name[16];
int age;
};
struct patient p[n];
int i,j;
for(i=0;i<n;i++)
scanf("%s %d",p[i].name,&p[i].age);
struct patient q[n];
for(i=0,j=0;i<n;i++)
if(p[i].age>=60)strcpy(q[j].name,p[i].name),q[j].age=p[i].age,j++;
int k,t;
char s[16];
for(k=0;k<j;k++)
{
for(i=0;i<j-k-1;i++)
if(q[i].age<q[i+1].age)
strcpy(s,q[i].name),strcpy(q[i].name,q[i+1].name),strcpy(q[i+1].name,s),
t=q[i].age,q[i].age=q[i+1].age,q[i+1].age=t;
}
for(i=0;i<n;i++)
if(p[i].age<60)strcpy(q[j].name,p[i].name),q[j].age=p[i].age,j++;
for(i=0;i<n;i++)
puts(q[i].name);
putchar('\n');
} | 9 |
4,186 |
void main()
{
struct pa
{
char id[20];
int old;
}pai[101],ol[101],you[101];
int n,i,j,k,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pai[i].id,&pai[i].old);
}
l=0;k=0;
for(i=0;i<n;i++)
{
if(pai[i].old>=60)
{
ol[l]=pai[i];
l++;
}
if(pai[i].old<60)
{
you[k]=pai[i];
k++;
}
}
for(i=0;i<l;i++)
{
for(j=0;j<l-i;j++)
{
if(ol[j].old<ol[j+1].old)
{
ol[100]=ol[j];
ol[j]=ol[j+1];
ol[j+1]=ol[100];
}
}
}
for(i=0;i<l;i++)
{
printf("%s\n",ol[i].id);
}
for(i=0;i<k-1;i++)
{printf("%s\n",you[i].id);
}
printf("%s",you[k-1].id);
} | 9 |
4,187 | 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 |
4,188 |
struct Ill {
char a[10];
int age;
};
int main()
{
int n, i, k;
int m,l = 0;
int j = 0;
struct Ill illMan[100], illOld[100], temp,illOld1[100];
scanf("%d",&n);
for (i = 0; i < n; i++) {
scanf("%s %d",illMan[i].a,&illMan[i].age);
}
for (i = 0; i < n; i++) {
if (illMan[i].age >= 60) {
illOld1[j] = illMan[i];
j++;
}
}
for (i = 0; i < j; i++) {
m = 0;
for (k = 0; k < j; k++) {
if (m < illOld1[k].age) {
m = illOld1[k].age;
}
}
for (k = 0; k < j; k++) {
if (illOld1[k].age == m) {
illOld[l] = illOld1[k];
illOld1[k].age = 0;
l++;
break;
}
}
}
for (i = 0; i < j; i++) {
printf("%s\n",illOld[i].a);
}
for (i = 0; i < n; i++) {
if (illMan[i].age < 60) {
printf("%s\n",illMan[i].a);
}
}
return 0;
} | 9 |
4,189 | int main()
{
int n,m=0,t;
scanf("%d",&n);
char a[n][100],s[n][100],r[100];
int b[n],c[n];
for(int i=0;i<n;i++)
scanf("%s %d",a[i],&b[i]);
for(int j=0;j<n;j++)
{
if(b[j]>=60)
{
c[m]=b[j],strcpy(s[m],a[j]);
if(m!=0)
{
for(int k=m;k>0;k=k-1)
{
if(c[k]>c[k-1])
{
strcpy(r,s[k]),strcpy(s[k],s[k-1]),strcpy(s[k-1],r);
t=c[k],c[k]=c[k-1],c[k-1]=t;
}
}
}
m++;
}
}
if(m!=0)
{
for(int i=0;i<m;i++)
printf("%s\n",s[i]);
}
for(int j=0;j<n;j++)
{
if(b[j]<60)
printf("%s\n",a[j]);
}
getchar();
getchar();
}
| 9 |
4,190 |
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 |
4,191 | int main()
{
int n;
scanf("%d",&n);
int nj[N];
int lr[N],xr[N];
char zfc[N][20];
int i;
int m=0,k=0;
for(i=0;i<n;i++)
{
scanf("%s",zfc[i]);
scanf("%d",&nj[i]);
}
for(i=0;i<n;i++)
{
if(nj[i]>=60)
{
lr[m]=i;
m++;
}
else
{
xr[k]=i;
k++;
}
}
int j;
if(m>=2)
{
for(i=0;i<m-1;i++)
{
for(j=m-1;j>i;j--)
{
int e;
if(nj[lr[j]]>nj[lr[j-1]])
{
e=lr[j];
lr[j]=lr[j-1];
lr[j-1]=e;
}
else if(nj[lr[j]]==nj[lr[j-1]]&&(lr[j]<lr[j-1]))
{
e=lr[j];
lr[j]=lr[j-1];
lr[j-1]=e;
}
}
}
}
if(m>=1)
{
for(i=0;i<m;i++)
{
printf("%s\n",zfc[lr[i]]);
}
}
if(k>0)
{
for(i=0;i<k;i++)
{
printf("%s\n",zfc[xr[i]]);
}
}
return 0;
}
| 9 |
4,192 | struct people
{
int order;
char ID[10];
int age;
}per[100];
struct old
{
int orders;
char IDs[10];
int ages;
}elder[100];
int main()
{
int n,i,j,t,m,q,r;
char p[10];
int b[100],c[100];
scanf("%d",&n);
for(i=0;i<=(n-1);i++)
{
per[i].order=i;
scanf("%s %d",per[i].ID,&per[i].age);
b[i]=strlen(per[i].ID);
}
t=0;
for(i=0;i<=(n-1);i++)
{
if(per[i].age>=60)
{
elder[t].orders=t;
strcpy(elder[t].IDs,per[i].ID);
elder[t].ages=per[i].age;
t=t+1;
per[i].age=(-1);
}
}
for(i=0;i<=(t-1);i++)
{
for(j=0;j<=(t-i-1);j++)
{
if(elder[j].ages<elder[j+1].ages)
{
m=elder[j].ages;
strcpy(p,elder[j].IDs);
q=elder[j].orders;
strcpy(elder[j].IDs,elder[j+1].IDs);
elder[j].ages=elder[j+1].ages;
elder[j].orders=elder[j+1].orders;
elder[j+1].ages=m;
strcpy(elder[j+1].IDs,p);
elder[j+1].orders=q;
}
}
}
for(i=0;i<=(t-1);i++)
{
for(j=0;j<=(t-1-j);j++)
{
if(elder[j].ages==elder[j+1].ages)
{
if(elder[j].orders>elder[j+1].orders)
{
m=elder[j].ages;
strcpy(p,elder[j].IDs);
q=elder[j].orders;
strcpy(elder[j].IDs,elder[j+1].IDs);
elder[j].ages=elder[j+1].ages;
elder[j].orders=elder[j+1].orders;
elder[j+1].ages=m;
strcpy(elder[j+1].IDs,p);
elder[j+1].orders=q;
}
}
}
}
for(i=0;i<=(t-1);i++)
{
printf("%s\n",elder[i].IDs);
}
for(i=0;i<=(n-1);i++)
{
if(per[i].age!=(-1))
{
printf("%s\n",per[i].ID);
}
}
return 0;
}
| 9 |
4,193 | main ()
{
int n,j,k,t;
scanf ("%d",&n);
char a[n][10];
char p[1][10];
int g[n];
for (j=0;j<n;j++)
scanf ("%s %d",a[j],&g[j]);
for (j=n-1;j>0;j--)
for (k=n-1;k>n-j-1;k--)
{
if (g[k]>=60)
{
if (g[k]>g[k-1])
{
t=g[k-1];
g[k-1]=g[k];
g[k]=t;
strcpy (p[0],a[k-1]);
strcpy (a[k-1],a[k]);
strcpy (a[k],p[0]);
}
}
}
for (k=0;k<n;k++)
printf ("%s\n",a[k]);
getchar ();
getchar ();
}
| 9 |
4,194 | 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 |
4,195 |
struct peo{
char id[11];
int age;
};
int main(){
struct peo people[100];
int sixty[100];
int n,b=0,i,j,k,e;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",people[i].id,&people[i].age);
if(people[i].age>=60){
sixty[i]=people[i].age;
b+=1;
}else{
sixty[i]=0;
}
}
for(k=0;k<n-1;k++){
for(i=n-1;i>k;i--){
if(sixty[i-1]<sixty[i]){
e=sixty[i-1];
sixty[i-1]=sixty[i];
sixty[i]=e;
}
}
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(sixty[i]==people[j].age&&sixty[i]!=sixty[i-1]){
printf("%s\n",people[j].id);
}
}
}
for(i=0;i<n;i++){
if(people[i].age<60){
printf("%s\n",people[i].id);
}
}
return 0;
} | 9 |
4,196 | void main()
{
int n,t,x,i;
int age[100];
char c[10],num[100][10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",num[i],&age[i]);
for(i=0;i<n;i++)
if(age[i]>=60)
for(x=i;x>0;x--)
if(age[x]>age[x-1])
{ t=age[x];age[x]=age[x-1];age[x-1]=t;
strcpy(c,num[x]);strcpy(num[x],num[x-1]);strcpy(num[x-1],c);
}
for(i=0;i<n;i++)
printf("%s\n",num[i]);
} | 9 |
4,197 |
void bubble_sort(int a[100], char b[100][10], int n)
{
int i, j, temp;
char temp_[10]={0}, empty[10]={0};
for (j=1; j<n; j++)
for(i=0; i<n-j; i++)
{
if (a[i]<a[i+1])
{
temp=a[i];
strcpy(temp_,b[i]);
a[i]=a[i+1];
strcpy(b[i], empty);
strcpy(b[i], b[i+1]);
a[i+1]=temp;
strcpy(b[i+1], empty);
strcpy(b[i+1], temp_);
}
}
}
int main()
{
int age[100], Age_[100]={0}, age_[100];
int n, i;
char id[100][10], Id_[100][10]={0}, id_[100][10]={0}, empty[10]={0};
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)
{
Age_[i] = age[i];
strcpy(Id_[i], id[i]);
}
else
{
age_[i] = age[i];
strcpy(id_[i], id[i]);
}
}
bubble_sort(Age_, Id_, n);
for(i=0;i<n; i++)
{
if(strcmp(Id_[i], empty)==0)
continue;
else
printf("%s\n", Id_[i]);
}
for(i=0;i<n; i++)
{
if(strcmp(id_[i], empty)==0)
continue;
else
printf("%s\n", id_[i]);
}
return 0;
}
| 9 |
4,198 | main()
{
int n;
int amount_lao=0,amount_yiban=0;
char c[11];
int shuru;
int i,j,k,s,p;
struct xinxi
{
char id[11];
int age;
};
struct xinxi laoren[100];
struct xinxi common[100];
struct xinxi temp;
scanf("%d",&n);
for(p=0;p<n;p++)
{
scanf("%s %d",c,&shuru);
if(shuru<60)
{
strcpy(common[amount_yiban].id,c);
common[amount_yiban].age=shuru;
amount_yiban++;
}
else if(shuru>=60)
{
strcpy(laoren[amount_lao].id,c);
laoren[amount_lao].age=shuru;
amount_lao++;
}
}
for(i=0;i<amount_lao-1;i++)
{
for(j=0;j<amount_lao-i-1;j++)
{
if(laoren[j].age<laoren[j+1].age)
{
strcpy(temp.id,laoren[j].id);
temp.age=laoren[j].age;
strcpy(laoren[j].id,laoren[j+1].id);
laoren[j].age=laoren[j+1].age;
strcpy(laoren[j+1].id,temp.id);
laoren[j+1].age=temp.age;
}
}
}
for(k=0;k<amount_lao;k++)
{
puts(laoren[k].id);
printf("\n");
}
for(s=0;s<amount_yiban;s++)
{
puts(common[s].id);
printf("\n");
}
getchar();
getchar();
}
| 9 |
4,199 | main()
{
struct patient{
char id[11];
int age;
}ren[100];
struct oldp{
char idold[11];
int ageold;
}oldren[100];
struct youngp{
char idyoung[11];
int ageyoung;
}youngren[100];//?????
int old[100],young[100];
int n,i,t,j,oldindex=0,youngindex=0;
char num[4],idinter[11];
gets(num);
n=atoi(num);
for(i=0;i<n;i++){
scanf("%s %d",ren[i].id,&ren[i].age);//??id???
}
for(i=0;i<n;i++){
if(ren[i].age>=60){
oldren[oldindex].ageold=ren[i].age;
strcpy(oldren[oldindex].idold,ren[i].id);
oldindex+=1;//???????
}else{
youngren[youngindex].ageyoung=ren[i].age;
strcpy(youngren[youngindex].idyoung,ren[i].id);
youngindex+=1;
}//???????
}
for(i=1;i<oldindex;i++){
for(j=0;j<oldindex-i;j++){
if(oldren[j].ageold<oldren[j+1].ageold){
t=oldren[j].ageold;
oldren[j].ageold=oldren[j+1].ageold;
oldren[j+1].ageold=t;//????????
strcpy(idinter,oldren[j].idold);//?????????id?
strcpy(oldren[j].idold,oldren[j+1].idold);
strcpy(oldren[j+1].idold,idinter);
}
}
}
for(i=0;i<oldindex;i++){
printf("%s\n",oldren[i].idold);
}
for(i=0;i<youngindex;i++){
printf("%s\n",youngren[i].idyoung);
}
}
| 9 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.