label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
9 | 4000 | 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 | 4001 | int main(){
int sz[100],aged[100];
char num[100][11],anum[100][11],q[100][11];
int n,i,k,j=0,s,p,e=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",num[i]);
scanf("%d",&sz[i]);
}for(i=0;i<n;i++){
if(sz[i]>=60){
aged[j]=sz[i];
strcpy(anum[j],num[i]);
j++;
}
}for(s=1;s<j;s++){
for(k=0;k<j-s;k++){
if(aged[k]<aged[k+1]){
e=aged[k+1];
aged[k+1]=aged[k];
aged[k]=e;
strcpy(q[k],anum[k+1]);
strcpy(anum[k+1],anum[k]);
strcpy(anum[k],q[k]);
}
}
}for(p=0;p<j;p++){
printf("%s\n",anum[p]);
}for(i=0;i<n;i++){
if(sz[i]<60){
printf("%s\n",num[i]);
}
}return 0;
} |
9 | 4002 |
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 | 4003 | int main(int argc, char* argv[])
{
char id[100][100];
int age[100];
int n;
int i,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",id[i]);
scanf("%d",&age[i]);
}
int e;
char t[13];
char id1[100][13];
int age1[100];
char id2[100][13];
int age2[100];
int x=0,y=0;
for(i=0;i<n;i++){
if(age[i]>=60){
age1[x]=age[i];
strcpy(id1[x],id[i]);
x++;
}
if(age[i]<60){
age2[y]=age[i];
strcpy(id2[y],id[i]);
y++;
}
}
for(k=1;k<x;k++){
for(i=0;i<x-k;i++){
if(age1[i]<age1[i+1]){
e=age1[i+1];
age1[i+1]=age1[i];
age1[i]=e;
strcpy(t,id1[i+1]);
strcpy(id1[i+1],id1[i]);
strcpy(id1[i],t);
}
}
}
for(i=0;i<x;i++){
printf("%s\n",id1[i]);
}
for(i=0;i<y;i++){
printf("%s\n",id2[i]);
}
return 0;
}
|
9 | 4004 | 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 | 4005 | 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 | 4006 | int main(){
int i,j=0,k,m,n,e,x,s[100],t[100],v=0;
char zfc[100][10],jg[100][10],h[100][10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",zfc[i]);
scanf("%d",&s[i]);
}
for(i=0;i<n;i++){
if(s[i]>=60){
t[j]=i;
j++;
}
}
for(i=j;i>=0;i--){
for(k=0;k<i-1;k++){
if(s[t[k]]<s[t[k+1]]){
m=t[k+1];
t[k+1]=t[k];
t[k]=m;
}
}
}
for(i=0;i<j;i++){
puts(zfc[t[i]]);
}
for(i=0;i<n;i++){
if(s[i]<60){
puts(zfc[i]);
}
}
return 0;
}
|
9 | 4007 | 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 | 4008 | 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 | 4009 |
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 | 4010 | int main()
{
int n,i,s=0,j=0,k=0;
struct patient{
int age;
char id[10];
}patient[100],old[100],young[100],temp;
cin>>n;
for(i=0;i<n;i++)
{
cin>>patient[i].id>>patient[i].age;
if(patient[i].age>=60)
{
old[k]=patient[i];
k++;
}
else
{
young[s]=patient[i];
s++;
}
}
for(i=k-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(old[j].age<old[j+1].age)
{
temp=old[j];
old[j]=old[j+1];
old[j+1]=temp;
}
}
}
for(i=0;i<k;i++)
cout<<old[i].id<<endl;
for(i=0;i<s;i++)
cout<<young[i].id<<endl;
return 0;
}
|
9 | 4011 | struct patient
{
char id[20];
int age;
};
int main()
{
int i,n,j,max,num=0;
struct patient a[110],t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",a[i].id,&a[i].age);
for(i=0;i<n;i++)
{
if(a[i].age>=60)
num++;
}
for(i=0;i<num;i++)
{
max=i;
for(j=i;j<n;j++)
{
if(a[j].age>a[max].age)
{
max=j;
}
}
t=a[max];
for(j=max;j>i;j--)
a[j]=a[j-1];
a[i]=t;
}
for(i=0;i<n;i++)
printf("%s\n",a[i].id);
return 0;
}
|
9 | 4012 | int n;
struct student
{
int a;
char num[20];
struct student *next;
};
struct student *creat()
{
struct student *head,*headtwo,*p1,*p2,*p3,*p4;
p1=(struct student *)malloc(len);
scanf("%s%d",p1->num,&p1->a);
head=(struct student *)malloc(len);
head->next=p1;
p2=head;
p1->next=NULL;
headtwo=(struct student *)malloc(len);
p4=headtwo;
p4->next=NULL;
int i,t=0;
for (i=0;i<n-1;i++)
{
t=0;
p3=(struct student *)malloc(len);
scanf("%s%d",p3->num,&p3->a);
if(p3->a>=60)
{
p2=head;
p1=head->next;
while(p1!=NULL)
{
if(p3->a>p1->a)
{
p3->next=p1;
p2->next=p3;
t=1;
break;
}
p2=p1;
p1=p1->next;
}
if(t==0) {p2->next=p3;p3->next=NULL;}
}
if(p3->a<60)
{
p4->next=p3;
p4=p3;
p4->next=NULL;
}
}
p1=head;
while(p1->next!=NULL)
{
p1=p1->next;
}
p1->next=headtwo->next;
return head;
}
void main()
{
scanf("%d",&n);
struct student *head,*p;
head=creat();
p=head->next;
while (p!=NULL)
{
printf("%s\n",p->num);
p=p->next;
}
}
|
9 | 4013 | main()
{
int n,k,j,i,age,m,y;
int b[1000];
char B[1000][100],C[1000][100],d[1000][100];
char a[1000];
scanf("%d",&n);
y=0;
k=0;
for(i=0;i<=n-1;i++)
{
scanf("%s %d",a,&age);
if(age<60)
{
strcpy(B[y],a);
y++;
}
else
{
strcpy(C[k],a);
b[k]=age;
k++;
}
}
int x=0;
for(i=200;i>=60;i--)
{
for(j=0;j<=k-1;j++)
{
if(i==b[j])
{
strcpy(d[x],C[j]);
x++;
}
}
}
for(i=0;i<=k-1;i++)
puts(d[i]);
for(i=0;i<=n-k-1;i++)
puts(B[i]);
getchar(); getchar();
}
|
9 | 4014 | void main()
{
struct people
{
char num[10];
int age;
}peo[100],pai[100],temp;
int i,n;
int j=0;
int k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",peo[i].num,&peo[i].age);
}
for(i=0;i<n;i++)
{
if(peo[i].age>=60)
{
pai[j]=peo[i];
j++;
}
}
for(i=0;i<n;i++)
{
if(peo[i].age<60)
{
pai[j]=peo[i];
j++;
}
}
for(k=0;k<j-1;k++)
{
for(i=0;i<j-1-k;i++)
{
if((pai[i].age<pai[i+1].age)&&(pai[i+1].age>=60))
{
temp=pai[i];
pai[i]=pai[i+1];
pai[i+1]=temp;
}
}
}
for(i=0;i<n;i++)
printf("%s\n",pai[i].num);
}
|
9 | 4015 | void main()
{int n;
scanf ("%d",&n);
struct patient
{ int num[10];int age;}
patient[100];
struct a
{ int num[10];int age;}
a[100];
int i,j=0;int t=0;
for (i=0;i<n;i++)
scanf ("%s %d",patient[i].num,&patient[i].age);
for (i=0;i<n;i++)
{ if (patient[i].age>=60) {strcpy(a[j].num,patient[i].num);
a[j].age=patient[i].age;j++;}}
int k=j; int m=a[0].age;
i=0;
while (i<k)
{
{for (j=0;j<k;j++)
if (m<a[j].age) {m=a[j].age; t=j;}}
printf("%s\n",a[t].num);a[t].age=0;m=0;i++;}
for (i=0;i<n;i++)
{if(patient[i].age<60) printf("%s\n",patient[i].num);}
} |
9 | 4016 | 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 | 4017 |
struct queue
{
char ID[11];
int age;
struct number * next;
};
int r=1;
struct queue * AppendNewNode(int n);
void main()
{
int n,i,j,a[100]={0},temp;
char temp_2[11]={""};
struct queue *head, *p,*pf,*temp_1;
scanf("%ld",&n);
head=AppendNewNode(n);
p=head;
while(p!=NULL)
{
scanf("%s %d\n",&p->ID,&p->age);
p=p->next;
}
p=head;
// p=p->next;
// printf("%d\n",p->age);
for(i=0;i<n;i++)
{
a[i]=p->age;
p=p->next;
}
//printf("%d\n",a[1]);
p=head;
pf=head;
for(i=0;i<n;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j+1]>=60&&a[j]<a[j+1]) {
temp=a[j];a[j]=a[j+1];a[j+1]=temp;
pf=p->next;temp=p->age;p->age=pf->age;pf->age=temp;strcpy(temp_2,p->ID);strcpy(p->ID,pf->ID);strcpy(pf->ID,temp_2);p=p->next;
}
else {p=p->next;}
}
p=head;
}
p=head;
// printf("%d\n",p->age);
while(p!=NULL)
{
printf("%s\n",p->ID);
p=p->next;
}
}
struct queue * AppendNewNode(int n)
{
struct queue *head=NULL, *newNode, *thisNode;
do{
newNode=(struct number *) malloc(sizeof(struct queue));
if(r==1)
{
head=newNode;
thisNode=head;
}
else
thisNode->next=newNode;
if(r<=n)
{
thisNode=newNode;
r++;
}
}while(r<=n);
thisNode->next=NULL;
return(head);
} |
9 | 4018 | struct p{
char id[10];
int age;
};
void bubble(struct p a[100],int n)
{
int i,j;
struct p temp;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1;j++)
{
if(a[j].age>=60)
{
if(a[j+1].age>a[j].age)
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
else
{
if(a[j+1].age>=60)
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
}
int main()
{
int n,i;
struct p a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",a[i].id,&a[i].age);
}
bubble(a,n);
for(i=0;i<n;i++)
{
printf("%s\n",a[i].id);
}
return 0;
}
|
9 | 4019 | 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 | 4020 | int main(){
int i,n,j;
char s[100][11],z[11];
int g[100],c;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",s[i],&g[i]);
}
for(i=0;i<n;i++){
for(j=1;j<n-i;j++){
if(g[j-1]<g[j]&&g[j]>=60){
strcpy(z,s[j-1]);strcpy(s[j-1],s[j]);strcpy(s[j],z);
c=g[j-1];g[j-1]=g[j];g[j]=c;
}
}
}
for(i=0;i<n-1;i++){
printf("%s\n",s[i]);
}
if(i==n-1){
printf("%s",s[i]);
}
return 0;
} |
9 | 4021 | void main()
{
int n,i,j=0,k=0,l;
scanf("%d",&n);
struct p
{
char id[10];
int age;
}a[n],b[n],c[n],d;
for(i=0;i<n;i++)
{
scanf("%s %d",&a[i].id,&a[i].age);
if(a[i].age>=60) {b[j]=a[i];j++;}
else {c[k]=a[i];k++;}
}
for(i=0;i<j-1;i++)
for(l=0;l<j-1-i;l++)
if(b[l].age<b[l+1].age) {d=b[l];b[l]=b[l+1];b[l+1]=d;}
for(i=0;i<j;i++)
printf("%s\n",b[i].id);
for(i=0;i<k;i++)
printf("%s\n",c[i].id);
} |
9 | 4022 |
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 | 4023 | int main() {
/*------------??------------*/
//?????
int m,n;
// float f,f1;
// double d,d1;
//????
int a[101],b[101];
// int a[101][2000];
//?????
// char c[6000];
char c[101][11],d[101][11];
// int len;
//????
// int r;
// float r;
// double r;
// int r[501];
// int r[200][20];
// char r[5010];
// char r[1010][51];
//????
int i,j,k;
//????
int ni,nj,nk;
// double di,dj,dk;
// float fi,fj,fk;
char ci[11],cj[11],ck[11];
/*
?? - ????
??
????????????????????????????????????
1. ??>=60??????????????
2. ?????????????????????????????????
3. ??????<60??????????????
????
?1????????100?????????????
??????????????????????????
?????????10?????????ID??????ID??????????????????
????
?????????????????ID
????
5
021075 40
004003 15
010158 67
021033 75
102012 30
????
021033
010158
021075
004003
102012
*/
/*------------??/??------------*/
// scanf("% ",& );
// len=strlen(c);
scanf("%d",&n);
for(i=1;i<=n;i++) {
scanf("%s",c[i]);
strcpy(d[i],c[i]);
scanf("%d",&a[i]);
b[i]=a[i];
}
/*------------??------------*/
// for(i=1;i<=n;i++) {
// }
for(i=1;i<=n-1;i++) {
for(j=1;j<=n-i;j++) {
if(a[j]<a[j+1]) {
ni=a[j+1];
a[j+1]=a[j];
a[j]=ni;
strcpy(ci,c[j+1]);
strcpy(c[j+1],c[j]);
strcpy(c[j],ci);
}
}
}
/*------------??------------*/
// printf("% \n", );
// printf(" \n");
for(i=1;i<=n;i++) {
if(a[i]>=60) {
printf("%s\n",c[i]);
}
}
for(i=1;i<=n;i++) {
if(b[i]<60) {
printf("%s\n",d[i]);
}
}
/*------------??------------*/
return 0;
}
|
9 | 4024 | struct ill
{
char id[11];
int age;
struct ill*next;
};
struct ill*creat(int n)
{struct ill*head,*p1,*p2;
int i;
head=NULL;
for(i=0;i<n;i++)
{p1=(struct ill*)malloc(sizeof(struct ill));
scanf("%s %d",p1->id,&p1->age);
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
struct ill* arrang(struct ill*head)
{int t,tt;
char s[11],ss[11];
struct ill*p,*q,*m,*h;
for(p=head;p!=NULL;p=p->next)
{
if(p->age>=60)
{
for(m=p,q=p->next;q!=NULL;q=q->next)
if(q->age > m->age && m->age>=60 ) m=q;
{t=tt=p->age; strcpy(s,p->id); strcpy(ss,p->id);
for(h=p->next;h!=m->next;h=h->next)
{tt=h->age; strcpy(ss,h->id);
h->age=t; strcpy(h->id,s);
t=tt; strcpy(s,ss);
}
p->age=t; strcpy(p->id,s);
}
}
}
return(head);
}
void main()
{int n;
struct ill*head,*h;
scanf("%d",&n);
head=creat(n);
head=arrang(head);
for(h=head;h!=NULL;h=h->next)
if(h->age>=60) printf("%s\n",h->id);
for(h=head;h!=NULL;h=h->next)
if(h->age<60) printf("%s\n",h->id);
} |
9 | 4025 |
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 | 4026 |
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 | 4027 |
int main(int argc, char* argv[])
{
struct patient{
char ID[10];
int age;
}pat[100],old[100];
int n,i,j,k=0,a;
char b[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",pat[i].ID,&pat[i].age);
if(pat[i].age>=60){
strcpy(old[k].ID,pat[i].ID);
old[k].age=pat[i].age;
k++;
}
}
for(i=0;i<k-1;i++){
for(j=0;j<k-1-i;j++){
if(old[j].age<old[j+1].age){
a=old[j].age;
old[j].age=old[j+1].age;
old[j+1].age=a;
strcpy(b,old[j].ID);
strcpy(old[j].ID,old[j+1].ID);
strcpy(old[j+1].ID,b);
}
}
}
for(i=0;i<k;i++)
printf("%s\n",old[i].ID);
for(i=0;i<n;i++){
if(pat[i].age<60){
printf("%s\n",pat[i].ID);
}
}
return 0;
} |
9 | 4028 | 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 | 4029 | struct sick
{char name[10];
int age;
};
int main()
{
int n,i,count=0,j;
struct sick s[100],a[100],t;
char b[3];
gets(b);
n=atoi(b);
for(i=0;i<n;i++)
scanf("%s %d",s[i].name,&s[i].age);
if(n==1)
printf("%s",s[0].name);
else
{for(i=0;i<n;i++)
if(s[i].age>=60)
{a[count]=s[i];
count++;
}
for(i=0;i<count-1;i++)
for(j=0;j<count-1-i;j++)
if(a[j].age <a[j+1].age )
{t=a[j];a[j]=a[j+1];a[j+1]=t;}
for(i=0;i<count;i++)
printf("%s\n",a[i].name);
for(i=0;i<n;i++)
if(s[i].age<60)
printf("%s\n",s[i].name);
}
return 0;
}
|
9 | 4030 | struct patient
{
char name[10];
int age;
}p[100],e,old[100],young[100];
int main()
{
int n,i,j=0,k=0,o=-1,y=-1;
scanf("%d",&n);
struct patient p[100],old[100],young[100];
for(i=0;i<n;i++){
scanf("%s %d",p[i].name,&p[i].age);
if((p[i].age)>=60){
o++;
old[j]=p[i];
j++;
}else{
y++;
young[k]=p[i];
k++;
}
}//?????
for(i=120;i>=60;i--){
for(j=0;j<o+1;j++){
if(old[j].age==i){
printf("%s\n",old[j].name);
}
}
}//?????????? ? ??????????????
for(i=0;i<y+1;i++){
printf("%s\n",young[i].name);
}
return 0;
} |
9 | 4031 | struct patient
{
char id[10];
int age;
struct patient *next;
struct patient *pre;
};
void main()
{
void f(struct patient **head);
struct patient *head,*p1,*p2;
int n,i;
scanf("%d",&n);
p1=(struct patient *)malloc(sizeof(struct patient));
p2=p1;head=p1;p1->pre=NULL;
scanf("%s %d",p1->id,&p1->age);
for(i=0;i<n-1;i++)
{
p1=(struct patient *)malloc(sizeof(struct patient));
p2->next=p1;p1->pre=p2;p2=p1;
scanf("%s %d",p1->id,&p1->age);
}
p2->next=NULL;
f(&head);
for(p1=head;p1!=NULL;p1=p1->next)printf("%s\n",p1->id);
}
void f(struct patient **head)
{
struct patient *p1,*p2,*p;
for(p1=(*head)->next;p1!=NULL;p1=p1->next)
if(p1->age>=60)
{
p=p1->next;
p1->pre->next=p1->next;
if(p1->next!=NULL)p1->next->pre=p1->pre;
for(p2=*head;p2->next!=NULL;p2=p2->next)
if(p1->age>p2->age)
{
if(p2->pre!=NULL)p2->pre->next=p1;else *head=p1;
p1->pre=p2->pre;p2->pre=p1;p1->next=p2;
break;
}
if(p2->next==NULL)
{
if(p1->age>p2->age)
{
if(p2->pre!=NULL)p2->pre->next=p1;else *head=p1;
p1->pre=p2->pre;p2->pre=p1;p1->next=p2;
}
else {p2->next=p1;p1->pre=p2;p1->next=NULL;}
}
if(p!=NULL) p1=p->pre;
else break;
}
}
|
9 | 4032 |
void main()
{
int n,i,j,k;
struct patient
{
char id[10];
int age;
}pa[1000],t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pa[i].id,&pa[i].age);
}
for(i=0;i<n;i++)
{
for(j=n-1;j>=0;j--)
if(pa[j].age>pa[j-1].age&&pa[j].age>=60)
{
t=pa[j];
pa[j]=pa[j-1];
pa[j-1]=t;
}
}
for(i=0;i<n;i++)
{
if(pa[i].age>=60)
{
printf("%s\n",pa[i].id);
}
}
for(i=0;i<n;i++)
{
if(pa[i].age<60)
{
printf("%s\n",pa[i].id);
}
}
}
|
9 | 4033 | 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 | 4034 |
typedef struct
{
char ID[10];
int age;
}patient;
patient pat[100];
int cmp(const void*, const void*);
int main()
{
int n;
int i;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",pat[i].ID);
scanf("%d",&pat[i].age);
}
qsort(pat,n,sizeof(patient),cmp);
for (i=0;i<n;i++)
{
printf("%s\n",pat[i].ID);
}
return 0;
}
int cmp(const void *_p1, const void *_p2)
{
patient *p1 = (patient*)_p1;
patient *p2 = (patient*)_p2;
if (p1->age>=60 && p1->age<60)
return -1;
else if (p1->age<60 && p2->age >= 60)
return 1;
else if (p1->age>=60 && p2->age >= 60)
return p2->age - p1->age;
else
return 0;
}
|
9 | 4035 | int main()
{
int n,i,m,j,k=0,a,b,c,winnum=0,win=2,year;
char old[150][100]={0},id[100][100]={0},id0[100]={0},huiche[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",&id0,&year);
if(year>=60)
{
if(old[year][0]==0)
{
strcpy(old[year],id0);
}
else
{
huiche[0]=13;
huiche[1]=0;
strcat(old[year],huiche);
strcat(old[year],id0);
}
}
else
{
strcpy(id[i],id0);
}
}
for(i=149;i>=0;i--)
{
if(old[i][0]!=0)
{
printf("%s\n",old[i]);
}
}
for(i=0;i<n;i++)
{
if(id[i]!=0)
{
printf("%s\n",id[i]);
}
}
return 0;
} |
9 | 4036 | struct ill
{
char id[100];
int age;
struct ill *next;
};
void main()
{
struct ill *creat(int x);
struct ill *p,*head;
char *w[1000];
char *temp1;
int n,i,j=0,k,temp;
int *q;
scanf("%d",&n);
p=creat(n);
head=p;
q=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
if((*p).age>=60) {*(q+j)=(*p).age;*(w+j)=(*p).id;j++;}
p=(*p).next;
}
k=j;
loop:for(i=0;i<j-1;i++)
{
if(*(q+i)<*(q+i+1))
{
temp=*(q+i);*(q+i)=*(q+i+1);*(q+i+1)=temp;
temp1=*(w+i);*(w+i)=*(w+i+1);*(w+i+1)=temp1;
}
}
for(i=0;i<j-1;i++)
{
if(*(q+i)<*(q+i+1)) goto loop;
}
for(i=0;i<j;i++)
{printf("%s\n",*(w+i));}
p=head;
for(i=0;i<n;i++)
{
if((*p).age>=60) goto lop;
else
{printf("%s\n",(*p).id);}
lop:p=(*p).next;
}
}
struct ill *creat(int x)
{
struct ill *head,*p1,*p2;
int i;
p1=(struct ill *)malloc(sizeof(struct ill));
scanf("%s %d",(*p1).id,&(*p1).age);
p2=p1;
head=p1;
for(i=0;i<x;i++)
{
p1=(struct ill *)malloc(sizeof(struct ill));
scanf("%s %d",(*p1).id,&(*p1).age);
(*p2).next=p1;
p2=p1;
}
(*p2).next=NULL;
return(head);
} |
9 | 4037 | 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 | 4038 | int main(){
int n, m=0, sz[100], i, j, sz2[100], e;
char zf[100][20], f[20], zf2[100][20];
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%s", zf[i]);
scanf("%d", &sz[i]);
}
for(i=0;i<n;i++){
if(sz[i]>=60){
n--;
strcpy(zf2[m],zf[i]);
sz2[m]=sz[i];
m++;
for(j=i;j<=n;j++){
strcpy(zf[j],zf[j+1]);
sz[j]=sz[j+1];
}
i--;
}
}
for(j=1;j<=m;j++){
for(i=0;i<m-j;i++){
if(sz2[i]<sz2[i+1]){
e=sz2[i];
sz2[i]=sz2[i+1];
sz2[i+1]=e;
strcpy(f,zf2[i]);
strcpy(zf2[i],zf2[i+1]);
strcpy(zf2[i+1],f);
}
}
}
for(i=0;i<m;i++){
printf("%s\n", zf2[i]);
}
for(i=0;i<n;i++){
printf("%s\n", zf[i]);
}
return 0;
} |
9 | 4039 | int main (){
int a[100],e[100],f[100];
char c[100][100],b[100][100],d[100][100],x[100];
int n,p=0,q=0,k,z,i;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s%d",c[i],&a[i]);
if(a[i]>=60){
p++;
e[i-q]=a[i];
strcpy(b[i-q],c[i]);
}
if(a[i]<60){
q++;
f[i-p]=a[i];
strcpy(d[i-p],c[i]);
}
}
for (k=1;k<=p;k++){
for (i=0;i<p-k;i++){
if(e[i]<e[i+1]){
z=e[i];
e[i]=e[i+1];
e[i+1]=z;
strcpy( x,b[i]);
strcpy( b[i],b[i+1]);
strcpy( b[i+1],x);
}
}
}
for(i=0;i<p;i++){
puts(b[i]);
}
for(i=0;i<q;i++){
puts(d[i]);
}
return 0;
}
|
9 | 4040 |
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 | 4041 | struct BING
{
char id[10];
int old;
}bing[100],temp;
int main()
{
int i,j,k,n,p,max;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",bing[i].id,&bing[i].old);
}
for(p=0;;p++){max=-1;
for(i=0;i<n;i++){
if(bing[i].old>max&&bing[i].old>=60){max=bing[i].old;k=i;}
}
if(max>=60) {printf("%s\n",bing[k].id);bing[k].old=-1;}
if(max<60) break;}
for(i=0;i<n;i++){
if(bing[i].old<60&&bing[i].old>=0) printf("%s\n",bing[i].id) ;
}
return 0;
}
|
9 | 4042 | 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 | 4043 | void main()
{
int i,j=0,k=0,n,n1=-1,n2=-1,old=0;
char xiao[100][10];
struct bingren
{
char id[10];
int age;
};
struct bingren a[100];
struct bingren b[100];
struct bingren t;
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]=a[i];
n1++;
j++;
}
else
{
strcpy(xiao[k],a[i].id);
k++;
n2++;
}
}
for(i=0;i<n1;i++)
{
for(j=0;j<n1-i;j++)
{
if(b[j].age<b[j+1].age)
{
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
}
}
}
for(i=0;i<=n1;i++)
printf("%s\n",b[i].id);
for(i=0;i<=n2;i++)
printf("%s\n",xiao[i]);
}
|
9 | 4044 | int main()
{
int num,i,j,l;//num??????
scanf("%d",&num);
struct inf //?????????ID
{
char str[10];
int age;
}infs[101];
struct f
{
char *p1;
int m1;
}old[101];//??????????
for(i=0;i<num;i++)
{
scanf("%s %d",infs[i].str,&infs[i].age);
}
for(i=0,j=0;i<num;i++)//????????????????????????????
if(infs[i].age>=60)
{old[j].m1=infs[i].age;
old[j].p1=infs[i].str;//??????????ID
j++;}
int end=j;
char *k;
for(i=0;i<end-1;i++)//?????????????????????
{
for(j=0;j+1<end-i;j++)
if(old[j].m1<old[j+1].m1)
{
l=old[j].m1;
old[j].m1=old[j+1].m1;
old[j+1].m1=l;
k=old[j].p1;
old[j].p1=old[1+j].p1;
old[1+j].p1=k;
}
}
for(i=0;i<end;i++)//??????
printf("%s\n",old[i].p1);
for(i=0;i<num;i++)
if(infs[i].age<60)//????????
printf("%s\n",infs[i].str);
}
|
9 | 4045 | int main()
{
char s[100][100],a[100][100],b[100];
int n,i,j=0,sz[100],t,c;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",s[i],&sz[i]);}
for(i=0;i<n;i++){
if(sz[i]<60){
strcpy(a[j],s[i]);
j++;}}
for(t=1;t<=n;t++){
for(i=0;i<n-t;i++){
if(sz[i]<sz[i+1]){
c=sz[i+1];sz[i+1]=sz[i];sz[i]=c;
strcpy(b,s[i+1]);
strcpy(s[i+1],s[i]);
strcpy(s[i],b);}}}
for(i=0;i<n;i++){
if(sz[i]>=60){
printf("%s\n",s[i]);}}
for(i=0;i<j;i++){
printf("%s\n",a[i]);}
return 0;
}
|
9 | 4046 | 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 | 4047 | 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 | 4048 |
struct a
{
char id[20];
int age;
struct a * next;
};
struct a * insert(struct a * head,struct a * s)/*??????????????????????*/
{
struct a *p0,*p1,*p2;
p1=head;/*???*/
p0=s;/*??????*/
if(head==NULL)/*?????*/
{head=p0;p0->next=NULL;}
else{
//while((p0->age<p1->age)&&(p1->next!=NULL))
while((p0->age<=p1->age)&&(p1->next!=NULL))
{p2=p1;p1=p1->next;}/*??????*/
if(p0->age>p1->age)/*???*/
{
if(head==p1)head=p0;
else p2->next=p0;
p0->next=p1;
}
else{p1->next=p0;p0->next=NULL;}/*????????*/
}
return(head);
}
struct a *creat(struct a * head, struct a * s)/*???????????????????*/
{
struct a *t;
if(head==NULL)
{head=s;s->next=NULL;}
else
{ for(t=head;t->next!=NULL;t=t->next);/*????*/
t->next=s; /*??*/
s->next=NULL;
}
return(head);
}
void main()
{
struct a *head1,*head2,*s,*p;
int i,n;
scanf("%d",&n);
head1=NULL;
head2=NULL;
for(i=0;i<=n-1;i++)
{ s=LEN;
scanf("%s %d",s->id,&s->age);
s->next=NULL;
if(s->age>=60)
head1=insert(head1,s);/*???????????????*/
if(s->age<60)
head2=creat(head2,s);/*?????????????*/
}
for(p=head1;p!=NULL;p=p->next)
printf("%s\n",p->id);
for(p=head2;p!=NULL;p=p->next)/*????????????????*/
printf("%s\n",p->id);
} |
9 | 4049 | 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 | 4050 | 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 | 4051 | struct patient
{
char No[10];
int age;
}grp1[100],grp2[100],grp3[100];
int main()
{
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s%d",&grp1[i].No,&grp1[i].age);
}
for(i=0;i<n;i++)
{
grp2[i].age=-1;
grp3[i].age=-1;
}
for(i=0;i<n;i++)
{
if(grp1[i].age>=60)
{
strcpy(grp2[i].No,grp1[i].No);
grp2[i].age=grp1[i].age;
}
if(grp1[i].age<60)
{
strcpy(grp3[i].No,grp1[i].No);
grp3[i].age=grp1[i].age;
}
}
char y[10];
int x;
int k,m;
for(k=1;k<n;k++)
{
for(m=0;m<n-k;m++)
{
if(grp2[m].age<grp2[m+1].age)
{
x=grp2[m+1].age;
grp2[m+1].age=grp2[m].age;
grp2[m].age=x;
strcpy(y,grp2[m+1].No);
strcpy(grp2[m+1].No,grp2[m].No);
strcpy(grp2[m].No,y);
}
}
}
for(i=0;i<n;i++)
{
if(grp2[i].age!=-1)
printf("%s\n",grp2[i].No);
}
for(i=0;i<n;i++)
{
if(grp3[i].age!=-1)
printf("%s\n",grp3[i].No);
}
return 0;
} |
9 | 4052 | int main()
{
int c,d,e,f,n,i;
char a[100][10];
int b[100];
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%s %d",a[i],&b[i]);
}
for (c=0;c<n;c++)
{
e=-1;
for (i=0;i<n;i++)
{
if (b[i]>=60)
{
if (b[i]>e)
{
e=b[i];
f=i;
}
}
}
if(e!=-1)
{
printf ("%s\n",a[f]);
b[f]=0;
}
}
for (i=0;i<n;i++)
{
if (b[i]!=0)
{
printf ("%s\n",a[i]);
}
}
getchar();
getchar();
}
|
9 | 4053 | struct student{
char num[20];
int score;
struct student * next;
};
int n=0;
struct student * creat(int numb);
void print(struct student *head);
struct student *maopao(struct student *head);
int main()
{
int n;
char ch;
struct student *head;
scanf("%d%c",&n,&ch);
head=creat(n);
head=maopao(head);
print(head);
free(head);
}
struct student * creat(int numb) /*?????*/
{
struct student *head; /*?????*/
struct student *p1,*p2; /*??????*/
n=0;
p1=p2=(struct student *)malloc(LEN); /*????????(struct student *)?(void*)??malloc??????
(struct student *)?*/
scanf("%s %d",&p1->num,&p1->score); /*????????*/
head=NULL;
while(n<numb-1) /*??????*/
{
n=n+1; /*?????*/
if(n==1)
{
head=p1; /*?????????p1???head*/
}
else
{
p2->next=p1; /*???p1??p2*/
}
p2=p1; /*p2????*/
p1=(struct student*)malloc(LEN); /*????????*/
scanf("%s %d",&p1->num,&p1->score); /*???????*/
}
p2->next=p1; /*????????next??NULL*/
p1->next=NULL;
return(head); /*?????*/
}
struct student *maopao(struct student *head)
{
struct student *p0,*p1,*p2,*tem;
int temp=0,i,j;
p0=head;
p1=head;
p2=head;
if(head==NULL)
{
return(head);
}
else if(p0->next==NULL)
{
return(head);
}
else if(p0->next!=NULL)
{
for(i=0;i<n;i=i+1)
{
for(j=0;j<n-1;j=j+1)
{
if(p1->score<p1->next->score&&j!=0&&p1->next->score>=60)
{
tem=p1->next;
p2->next=p1->next;
p1->next=tem->next;
tem->next=p1;
p2=p2->next;
}
else if(p1->score<p1->next->score&&j==0&&p1->next->score>=60)
{
tem=p1->next;
p0=tem;
p2=tem;
p1->next=tem->next;
tem->next=p1;
p2=p1;
p1=p1->next;
}
else
{
p2=p1;
p1=p1->next;
}
}
temp=temp+1;
p1=p0;
p2=p0;
}
}
return(p0);
}
void print(struct student *head) /*????*/
{
struct student *p,*tempo; /*??????*/
p=head; /*??head??????*/
if(head!=NULL) /*????????*/
{
do
{
tempo=p->next;
printf("%s\n",p->num);
p=tempo;
}while(p!=NULL); /*?p?????????*/
}
} |
9 | 4054 | 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 | 4055 | 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 | 4056 | int n,i;
struct man
{
char num[10];
int age;
int nu;
}stu[100];
int f(char *a,int b,int n1,char *c,int d,int n2)
{int sum;
if(b>=60&&d>=60)
{if(b>d)
sum=1;
else if(b<d)
sum=-1;
else
sum=n2-n1;
}
else if(b>=60&&d<60)
sum=1;
else if(b<60&&d>=60)
sum=-1;
else
sum=n2-n1;
return(sum);
}
void main()
{scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",stu[i].num,&stu[i].age);
stu[i].nu=i+1;}
int j,k;
struct man t;
for(i=0;i<n-1;i++)
{k=i;
for(j=i+1;j<n;j++)
if(f(stu[i].num,stu[i].age,stu[i].nu,stu[j].num,stu[j].age,stu[j].nu)<0)
{k=j;
t=stu[i];stu[i]=stu[k];stu[k]=t;}
}
for(i=0;i<n;i++)
printf("%s\n",stu[i].num);
} |
9 | 4057 | struct stu
{
char name[20];
int age;
int order;
struct stu *next;
};
int main()
{
struct stu *p,*q,*t,*r,*head;
int n,i,j;
scanf("%d",&n);
head=(struct stu *)malloc(l);
q=head;
for(i=0;i<n;i++)
{
p=(struct stu *)malloc(l);
scanf("%s %d",p->name,&p->age);
p->order=i;
q->next=p;
q=p;
}
q->next=NULL;
for(i=0;i<n-1;i++)
for(p=head,j=0;j<n-1-i;j++,p=p->next)
{
q=p->next;
t=q->next;
if((q->age==t->age&&q->order>t->order)||(q->age<60&&t->age<q->age&&q->order>t->order)||(t->age<60&&t->age>q->age&&q->order>t->order)||(t->age>=60&&t->age>q->age))
{
r=t->next;
t->next=q;
p->next=t;
q->next=r;
}
}
p=head->next;
while(p!=NULL)
{
printf("%s\n",p->name);
p=p->next;
}
}
|
9 | 4058 | struct Patient{
char id[10];
int age;
struct Patient *next;
struct Patient *pre;
};
struct Patient *creat(int x);
struct Patient *sort(struct Patient *);
void print(struct Patient *);
int main()
{
struct Patient *patient,*patient2;
int n,i;
scanf("%d",&n);
patient=creat(n);
patient2=sort(patient);
print(patient2);
}
struct Patient *creat(int x){
struct Patient *p1,*p2,*head,*p;
int i;
head = NULL;
for (i=0;i<x;i++){
p1 = (struct Patient *)malloc(Len);
if (i==0) {head = p1;head->pre = NULL;}
else {p2->next = p1;p1->pre = p2;}
p2 = p1;
scanf("%s%d",p1->id,&p1->age);
}
p1->next = NULL;
return head;
}
struct Patient *sort(struct Patient *head){
struct Patient *p1,*p2,*temp,*p;
temp = (struct Patient *)malloc(Len);
p1 = p2 =head;
while (p1){
if (p1->age>=60){
p2 = p1->next;
while (p2){
if (p2->age>p1->age){
temp->age = p2->age;
strcpy(temp->id,p2->id);
p = p2;
while (p->pre != p1){
strcpy(p->id,p->pre->id);
p->age = p->pre->age;
p = p->pre;
}
strcpy(p->id,p1->id);
p->age = p1->age;
p1->age = temp->age;
strcpy(p1->id,temp->id);
}
p2 = p2->next;
}
}
p1 = p1->next;
}
return head;
}
void print(struct Patient *head){
struct Patient *p1,*p2,*p;
p = head;
while (p){
if (p->age>=60){
printf("%s\n",p->id);
}
p = p->next;
}
p = head;
while (p){
if (p->age<60){
printf("%s\n",p->id);
}
p = p->next;
}
} |
9 | 4059 | int main()
{
int n,sz[100],zs[100],i,k=0,m,a;
char id[100][10],di[100][10],zfc[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",id[i],&(sz[i]));
}
for(i=0;i<n;i++)
{
if(sz[i]>=60)
{
zs[k]=sz[i];
strcpy(di[k],id[i]);
k++;
}
}
for(m=0;m<k-1;m++)
{
for(i=0;i<k-1-m;i++)
{
if(zs[i]<zs[i+1])
{
a=zs[i];
zs[i]=zs[i+1];
zs[i+1]=a;
strcpy(zfc,di[i]);
strcpy(di[i],di[i+1]);
strcpy(di[i+1],zfc);
}
}
}
for(i=0;i<n;i++)
{
if(sz[i]<60)
{
strcpy(di[k],id[i]);
k++;
}
}
for(i=0;i<k;i++)
{
printf("%s\n",di[i]);
}
return 0;
} |
9 | 4060 | 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 | 4061 | 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 | 4062 | 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 | 4063 | void main()
{
int n;
int i,j=0,k;
int t;
int old[100];
int age[100];
char a[100][20];
char a1[100][20];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a[i]);
scanf("%s",a1[i]);
}
for(i=1;i<=n;i++)
{
age[i]=atoi(a1[i]);
if(age[i]>=60)
{
old[j]=i;
j++;
}
}
for(i=0;i<j;i++)
for(k=0;k<j-i-1;k++)
if(age[old[k]]<age[old[k+1]])
{
t=old[k];
old[k]=old[k+1];
old[k+1]=t;
}
for(i=0;i<j;i++)
printf("%s\n",a[old[i]]);
for(i=1;i<=n;i++)
{
if(age[i]>=60)
continue;
printf("%s\n",a[i]);
}
}
|
9 | 4064 | 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 | 4065 | struct s
{
char a[100];
int b;
struct s *next;
};
void main()
{
struct s *p1,*p2,*p0,*head,*insert(struct s *head,struct s *stud),*h;
int i,j,k,m,n,t,x;
scanf("%d",&n);
head=0;
p1=(struct s *)malloc(sizeof(struct s));h=(struct s *)malloc(sizeof(struct s));
p2=head=p1;
p1->next=0;k=0;j=0;
scanf("%s %d",p1->a,&p1->b);x=0;
if(p1->b<60)
{
p2=h=p1;
x=1;
}
else
p2=h;
for(i=0;i<n-1;i++)
{
p0=(struct s *)malloc(sizeof(struct s));
scanf("%s %d",p0->a,&p0->b);
if(p0->b>=60)
{
head=insert(head,p0);
k++;
}
else
{
p2->next=p0;
p2=p0;
j++;
}
}
p1=head;
if(x==0)
i=-1;
else
i=0;
for(;i<k;i++)
{
printf("%s\n",p1->a);
p1=p1->next;
}
if(x==0)
{p2=h->next;
i=0;}
else
{p2=h;i=-1;}
for(;i<j;i++)
{
printf("%s\n",p2->a);
p2=p2->next;
}
}
struct s *insert(struct s *head,struct s *stud)
{
struct s *p0,*p1,*p2;
p1=head;
p0=stud;
if(head==0)
{
head=p0;p0->next=0;
}
else
{while((p0->b<=p1->b)&&(p1->next!=0))
{p2=p1;
p1=p1->next;}
if(p0->b>p1->b)
{if(head==p1)head=p0;
else p2->next=p0;
p0->next=p1;}
else
{p1->next=p0;p0->next=0;}
}
return(head);
}
|
9 | 4066 | main()
{
int n,i,j,k,m,l;
int age[10000];
char ID[10000][10],order[10000][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",ID[i],&age[i]);
}
for(i=0;i<n;i++)
{
m=0;
for(j=1;j<n-i;j++)
{
if(age[j]>=60&&age[j]>age[m])
m=j;
}
for(j=0;j<10;j++)
{
order[i][j]=ID[m][j];
}
for(j=m;j<n;j++)
{
for(k=0;k<10;k++)
{
ID[j][k]=ID[j+1][k];
}
age[j]=age[j+1];
}
}
for(i=0;i<n;i++)
{
puts(order[i]);
}
} |
9 | 4067 | struct patient{
char id[10];
int age;
};
void bubble(struct patient p[],int m);
void main()
{
struct patient p[200];
int n,i,t=100;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",p[i].id,&p[i].age);
if(p[i].age>=60)
{
p[t]=p[i];
t++;
p[i].age=0;
}
}
bubble(p,t);
for(i=100;i<t;i++)
{
printf("%s\n",p[i].id);
}
for(i=0;i<n;i++)
{
if(p[i].age!=0)
printf("%s\n",p[i].id);
}
}
void bubble(struct patient p[],int m)
{
int i,j;
struct patient temp;
for(j=101;j<m;j++)
{
for(i=100;i<m+100-j;i++)
{
if(p[i].age<p[i+1].age)
{
temp=p[i];
p[i]=p[i+1];
p[i+1]=temp;
}
}
}
}
|
9 | 4068 |
int main()
{
struct patient
{
char id[10];
int age;
};
int n, i, j, k;
struct patient p[100];
scanf("%d", &n);
for(i=0; i<n; i++)
scanf("%s%d", p[i].id, &p[i].age);
for(i=1; i<n; i++)
{
if (p[i].age >= 60)
{
j=0;
while(j<i && p[j].age >= p[i].age) j++;
if (j < i)
{
struct patient tmp = p[i];
for(k=i;k>j;k--)
p[k] = p[k-1];
p[j]=tmp;
}
}
}
for(i=0; i<n; i++)
printf("%s\n", p[i].id);
return 0;
}
|
9 | 4069 | int main(){
int i,n,j,k,e,m;
int a[100];
char b[100][10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",&b[i],&a[i]);
}
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
if(a[j]>=60&&a[j]>a[j-1]){
m=a[j];
a[j]=a[j-1];
a[j-1]=m;
char t[10];
strcpy(t,b[j]);
strcpy(b[j],b[j-1]);
strcpy(b[j-1],t);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",b[i]);
}
return 0;
} |
9 | 4070 |
struct info
{
char num[10];
int age;
};
struct info1
{
char num1[10];
int age1;
};
int main(int argc, char* argv[])
{
struct info patient[101];
struct info1 old[101];
int n;
scanf("%d",&n);
int i,j;
for(i=0,j=0;i<n;i++){
scanf("%s %d",&patient[i].num,&patient[i].age);
if(patient[i].age>=60){
strcpy(old[j].num1,patient[i].num);
old[j].age1=patient[i].age;
j++;
}
}
int m=j;
for(j=1;j<m;j++){
for(i=0;i<m-j;i++){
if(old[i].age1<old[i+1].age1){
old[100]=old[i];
old[i]=old[i+1];
old[i+1]=old[100];
}
}
}
for(i=0;i<m;i++){
printf("%s\n",old[i].num1);
}
for(i=0;i<n;i++){
if(patient[i].age<60){
printf("%s\n",patient[i].num);
}
}
return 0;
} |
9 | 4071 | int main()
{
int n,t;
int i,j=0,k,max;
int age[100];
int age2[100];
char string[100][11];
int line[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%s %d",string[i],&age[i]);
for(i=0;i<=n-1;i++)
{
if (age[i]>=60)
{
age2[j]=age[i];
age[i]=0;
line[j]=i;
j=j+1;
k=j;
}
}
for(i=1;i<=k;i++)
{
max=0;
t=0;
for(j=0;j<=k-1;j++)
{
if(max<age2[j])
{
max=age2[j];
t=j;
}
}
printf("%s\n",string[line[t]]);
age2[t]=0;
}
for(i=0;i<n;i++)
{
if(age[i]!=0)
printf("%s\n",string[i]);
}
getchar();
getchar();
}
|
9 | 4072 | int N;
struct patient
{
char ID[20];
int age;
struct patient*next;
};
struct patient*creat()
{
struct patient*head,*p1,*p2;
int i;
p1=(struct patient*)malloc(LEN);
scanf("%s %d",p1->ID,&p1->age);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<N;i++)
{
p1=(struct patient*)malloc(LEN);
scanf("%s %d",p1->ID,&p1->age);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return(head);
}
struct patient*rank(struct patient*head)
{
int i,j,a;
char ID[20];
struct patient*p1,*p2;
for(i=0;i<N-1;i++)
{
p1=head;
p2=head->next;
for(j=0;j<N-i-1;j++)
{
if((p1->age<p2->age)&&(p2->age>=60))
{
a=p1->age;
p1->age=p2->age;
p2->age=a;
strcpy(ID,p1->ID);
strcpy(p1->ID,p2->ID);
strcpy(p2->ID,ID);
}
p1=p2;
p2=p2->next;
}
}
return(head);
}
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;
scanf("%d",&N);
head=creat();
head=rank(head);
print(head);
}
|
9 | 4073 | struct person
{
char num[11];
int yr;
}pe[100],t;
int main()
{
int n,i,e,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",pe[i].num,&pe[i].yr);
}
for(k = 0 ; k < n ; k++){
for(i = 0; i <n-k-1 ; i++){
if((pe[i+1].yr>=60)&&(pe[i].yr<pe[i+1].yr)){
t=pe[i];
pe[i]=pe[i+1];
pe[i+1]=t;
}
}
}
for(i=0;i<n;i++){
printf("%s\n",pe[i].num);
}
return 0;
} |
9 | 4074 | struct pat
{
char num[10];
int age;
int x;
}p[100],P[100],s;
int main()
{
int n,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",p[i].num,&p[i].age);
if(p[i].age>=60) p[i].x=p[i].age;
else p[i].x=0;
}
for(i=0;i<n;i++){
s.age=-1;
s.x=-1;
char k[10];
for(j=0;j<n;j++){
if(s.x<p[j].x){
s=p[j];
strcpy(k,p[j].num);
}
}
P[i]=s;
for(j=0;j<n;j++){
if(strcmp(p[j].num,k)==0){
p[j].x=-2;
break;
}
}
}
for(i=0;i<n;i++){
printf("%s\n",P[i].num);
}
return 0;
} |
9 | 4075 | struct hospital
{
char ID [13];
int age;
struct hospital *next;
};
int main()
{
void change(struct hospital *);
int n;
scanf("%d",&n);
int i;
struct hospital *p,*head;
p=(struct hospital *)malloc(sizeof(struct hospital));
head=p;
for(i=0;i<n-1;i++)
{
scanf("%s %d",p->ID,&p->age);
p->next=(struct hospital *)malloc(sizeof(struct hospital));
p=p->next;
}
scanf("%s %d",p->ID,&p->age);
p->next=NULL;
for(i=0;i<n;i++)
{
for(p=head;p->next!=NULL;p=p->next)
{
if(p->age<60&&p->next->age>=60)
{
change(p);
}
if(p->age>=60&&p->next->age>=60&&p->next->age>p->age)
{
change(p);
}
}
}
for(p=head;p!=NULL;p=p->next)
{
printf("%s\n",p->ID);
}
return 0;
}
void change(struct hospital *p)
{
int tempage;
char tempID[13];
struct hospital *later=p->next;
tempage=later->age;
strcpy(tempID,later->ID);
later->age=p->age;
strcpy(later->ID,p->ID);
p->age=tempage;
strcpy(p->ID,tempID);
}
|
9 | 4076 |
struct Patient{
char id[10];
int age,arranged;
};
int main()
{
int n,i,t=0,j;
struct Patient pai[100],orderd[100];
cin>>n;
for(i=0;i<n;i++)
{
cin>>pai[i].id>>pai[i].age;
pai[i].arranged=0;
}
for(i=0;i<n;i++)
{
if(pai[i].age>=60)
{
orderd[t]=pai[i];
pai[i].arranged =1;
t++;
}
}
for(i=0;i<t;i++)
{
for(j=0;j<t-1-i;j++)
{
if(orderd[j].age<orderd[j+1].age)
{
struct Patient temp=orderd[j];
orderd[j]=orderd[j+1];
orderd[j+1]=temp;
}
}
}
for(i=0;i<n;i++)
{
if(pai[i].arranged==0)
{
orderd[t]=pai[i];
t++;
}
}
for(i=0;i<n;i++)
{
cout<<orderd[i].id<<endl ;
}
return 0;
} |
9 | 4077 | main()
{
int i,k,j,l,n,w,max,old;
int q=0;
char d[101][10];
int a[101];
int b[101];
int c[101];
scanf("%d",&n);
old=0;
for(i=1;i<=n;i++)
scanf("%s %d",d[i],&a[i]);
for(i=1;i<=n;i++)
{
b[i]=0;
if(a[i]>=60)
{
b[i]=1;
old=old+1;
}
}
for(i=1;i<=old;i++)
{
max=0;
for(j=1;j<=n;j++)
{
if(b[j]==1)
{
if(a[j]>max)
{
max=a[j];
w=j;
}
}
}
c[i]=w;
b[w]=2;
}
for(l=1;l<=old;l++)
{
q=c[l];
printf("%s\n",d[q]);
}
for(l=1;l<=n;l++)
{
if(b[l]==0)
printf("%s\n",d[l]);
}
getchar();
getchar();
getchar();
getchar();
}
|
9 | 4078 | void main()
{
int n, age[100]={0}, i, j, k, old[101]={0}, oldn, youngn;
char id[101][20]={0}, oldid[101][20]={0}, youngid[101][20]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%s%d",id[i],&age[i]);
for(i=1,j=1,k=1;i<=n;i++)
{
if(age[i]>=60)
{
old[j]=age[i];
strcpy(oldid[j],id[i]);
j++;
}
else
{
strcpy(youngid[k],id[i]);
k++;
}
}
oldn=j;
youngn=k;
for(i=1;i<=oldn;i++)
{
for(j=1;j<=oldn-i;j++)
{
if(old[j]<old[j+1])
{
old[100]=old[j];
old[j]=old[j+1];
old[j+1]=old[100];
strcpy(oldid[101],oldid[j]);
strcpy(oldid[j],oldid[j+1]);
strcpy(oldid[j+1],oldid[101]);
}
}
}
for(i=1;i<oldn;i++)
printf("%s\n",oldid[i]);
for(k=1;k<youngn;k++)
printf("%s\n",youngid[k]);
} |
9 | 4079 | 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 | 4080 | 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 | 4081 | 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 | 4082 | int main()
{
char id[100][10],a[10];
int n,i,j;
int age[100],b;
scanf("%d ",&n);
for(i=0;i<n;i++)
{
scanf(" %s %d",&id[i],&age[i]);
}
for(j=n-1;j>0;j--)
{
for(i=n-1;i>0;i--)
{
if(age[i]>=60&&age[i-1]>=60)
{
if(age[i]>age[i-1])
{
strcpy(a,id[i]);b=age[i];
strcpy(id[i],id[i-1]);age[i]=age[i-1];
strcpy(id[i-1],a);age[i-1]=b;
}
}
if(age[i]>=60&&age[i-1]<60)
{
strcpy(a,id[i]);b=age[i];
strcpy(id[i],id[i-1]);age[i]=age[i-1];
strcpy(id[i-1],a);age[i-1]=b;
}
}
}
for(i=0;i<n;i++)
{
if(i==0) printf("%s",id[i]);
else printf("\n%s",id[i]);
}
return 0;
} |
9 | 4083 | 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 | 4084 | int main()
{
struct patient{
char ID[10];int a;
}p[100],pr;
int np,i,k;
scanf("%d",&np);
for(i=0;i<np;i++){
scanf("%s %d",p[i].ID,&p[i].a);
}
for(i=0;i<np;i++){
for(k=np-1;k>i;k--){
if(p[k].a>p[k-1].a&&p[k].a>=60){
pr=p[k];p[k]=p[k-1];p[k-1]=pr;
}
}
printf("%s\n",p[i].ID);
}
return 0;
} |
9 | 4085 | struct pat
{
char num[11];
int age;
struct pat *next;
};
void main()
{
int n,i;
scanf("%d",&n);
struct pat *head,*p1,*p2,*pre;
p1=(struct pat *)malloc(sizeof(struct pat));
scanf("%s %d",p1->num,&p1->age);
head=p1;
p1->next=NULL;
for(i=1;i<n;i++)
{
p1=(struct pat *)malloc(sizeof(struct pat));
scanf("%s %d",p1->num,&p1->age);
if(p1->age<60)
{
p2=head;
while(p2)
{
if(p2->next==NULL)
{
p2->next=p1;p1->next=NULL;break;
}
p2=p2->next;
}
}
else if(p1->age>=60)
{p2=head;
while(p2)
{
if(p2==head&&p1->age>p2->age)
{
head=p1;p1->next=p2;break;
}
else if(p1->age>p2->age)
{
pre->next=p1;p1->next=p2;break;
}
else if(p2->next==NULL)
{
p2->next=p1;p1->next=NULL;break;
}
else {pre=p2;p2=p2->next;}
}
}
}
p1=head;
while(p1)
{
printf("%s\n",p1->num);
p1=p1->next;
}
}
|
9 | 4086 | main()
{
int i,n,a[100],j;
struct patient
{
char id[10];
int age;
}
s[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s%d",s[i].id,&s[i].age);
}
while (1)
{
int max=0;
for (i=0;i<n;i++)
{
if (s[i].age>s[max].age)
max=i;
}
if (s[max].age>=60)
{
printf("%s\n",s[max].id);
s[max].age=0;
}
else break;
}
for (i=0;i<n;i++)
if (s[i].age>0)
printf("%s\n",s[i].id);
}
|
9 | 4087 | struct patient
{ char id[11];
int age,seq;
struct patient *next;
};
main()
{ int n,n1=0,n2=0,i,j,m,at;
char id[10];
struct patient *head1,*head2,*p11,*p12,*p21,*p22,*t,*q;
scanf("%d",&n);
head1=NULL;
head2=NULL;
for(i=0;i<n;i++)
{
scanf("%s%d",id,&at);
if(at>=60)
{ if(head1==NULL)
{
head1=(struct patient*)malloc(sizeof(struct patient));
strcpy(head1->id,id);
head1->age=at;
head1->next=NULL;
}
else
{ p11=(struct patient *)malloc(sizeof(struct patient));
p11->age=at;
strcpy(p11->id,id);
for(t=head1,q=t;t!=NULL;q=t,t=t->next)
{ if(t->age<at&&t!=head1)
{
q->next=p11;
p11->next=t;
break;
}
if(t->age<at&&t==head1)
{
p11->next=head1;
head1=p11;
break;
}
}
if(t==NULL)
{
q->next=p11;
p11->next=NULL;
}
}
}
if(at<60)
{ if(head2==NULL)
{
head2=(struct patient*)malloc(sizeof(struct patient));
strcpy(head2->id,id);
head2->age=at;
head2->next=NULL;
p22=head2;
}
else
{
p21=(struct patient *)malloc(sizeof(struct patient));
p21->age=at;
strcpy(p21->id,id);
p22->next=p21;
p21->next=NULL;
p22=p21;
}
}
}
for(t=head1,q=t;t!=NULL;q=t,t=t->next);
q->next=head2;
for(t=head1;t->next!=NULL;t=t->next)
printf("%s\n",t->id);
printf("%s",t->id);
} |
9 | 4088 | 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-1;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-1;i++)
printf("%s\n",ID3[i]);
}
|
9 | 4089 | main()
{
int i,j,k,l,m,n;
char id[200][200];
int age[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",id[i],&age[i]);
}
for(j=200;j>=60;j--)
{
for(i=0;i<n;i++)
{ if(age[i]==j)
printf("%s\n",id[i]);}
}
for(i=0;i<n;i++)
if(age[i]<60)
printf("%s\n",id[i]);
getchar();
getchar();
}
|
9 | 4090 | int main(){
int n,i,t,k;
scanf("%d",&n);
char a[100][10],c[11];
int b[100];
for(i=0;i<n;i++){
scanf("%s %d",a[i],&b[i]);
if(b[i]<60){
b[i]=0;
}
}
for(k=1;k<=n;k++){
for(i=0;i<n-k;i++){
if(b[i]<b[i+1]){
t=b[i];
b[i]=b[i+1];
b[i+1]=t;
strcpy(c, a[i]);
strcpy(a[i], a[i+1]);
strcpy(a[i+1], c);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",a[i]);
}
return 0;
}
|
9 | 4091 | int main()
{
int n,i,y,x=0;
struct ID {
int age;
char a[10];
}ID[201];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",ID[i].a);
scanf("%d",&ID[i].age);
}
for(i=0;i<n;i++){
if(ID[i].age>=60){
ID[100+x]=ID[i];
ID[i].a[0]='\0';
x++;
}
}
for(i=0;i<x-1;i++){
for(y=0;y<x-1-i;y++){
if(ID[100+y].age<ID[y+101].age){
ID[200]=ID[100+y];
ID[100+y]=ID[y+101];
ID[y+101]=ID[200];
}
}
}
for(i=0;i<x;i++){
printf("%s\n",ID[100+i].a);
}
for(i=0;i<n;i++){
if(ID[i].a[0]!='\0')
printf("%s\n",ID[i].a);
}
return 0;
}
|
9 | 4092 | int main()
{
int n,i,j,k,b[100]={0},c[100]={0},d[100]={0},e[100]={0};
char a[100][100];
for(i=0;i<100;i++)
{
b[i]=i;
}
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&a[i],&c[i]);
if(c[i]>59)
{
d[i]=c[i];
}
else
{
e[i]=c[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n-1;j++)
{
if(d[b[j]]<d[b[j+1]])
{
k=b[j];
b[j]=b[j+1];
b[j+1]=k;
}
}
}
for(i=0;i<n;i++)
{
if(d[b[i]]>0)
{
printf("%s\n",a[b[i]]);
}
else
{
break;
}
}
for(i=0;i<n;i++)
{
if(e[i]!=0)
{
printf("%s\n",a[i]);
}
}
return 0;
}
|
9 | 4093 | 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 | 4094 | void main(int argc, char* argv[])
{
struct student
{
char ID[10];
int age;
} stu[100],stud[100];
int a[100],b[100],i,c,j,x,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&stu[i].ID);
scanf("%d",&stu[i].age);
}
int k=0;
for(i=0;i<n;i++){
if(stu[i].age>=60){a[k]=stu[i].age;b[k]=i;k++;}
}
for(i=0;i<k;i++){
for(j=0;j<k;j++){
if(a[j]<a[j+1]){x=a[j];a[j]=a[j+1];a[j+1]=x;x=b[j];b[j]=b[j+1];b[j+1]=x;}
}
}
for(i=0;i<k;i++){
c=b[i];
printf("%s\n",stu[c].ID);
}
for(i=0;i<n;i++){
if(stu[i].age<60){printf("%s\n",stu[i].ID);}
}
} |
9 | 4095 | 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 | 4096 | int main()
{
int n,i,j,s=0,e,z=0;
int a[100],c[100],x[100];
char b[100][10],d[100][10],y[100][10];
char f[100][10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",b[i],&a[i]);
}
for(i=0;i<n;i++){
if(a[i]>=60){
c[s]=a[i];
strcpy(d[s],b[i]);
s++;
}else{
x[z]=a[i];
strcpy(y[z],b[i]);
z++;
}
}
for(i=0;i<s;i++){
for(j=1;j<s-i;j++){
if(c[j-1]<c[j]){
e=c[j];
c[j]=c[j-1];
c[j-1]=e;
strcpy(f[j],d[j]);
strcpy(d[j],d[j-1]);
strcpy(d[j-1],f[j]);
}
}
}
for(i=0;i<s;i++){
printf("%s\n",d[i]);
}
for(i=0;i<z;i++){
printf("%s\n",y[i]);
}
return 0;
} |
9 | 4097 | struct Patient
{
char id[10];
int age;
int num;
}patient[100];
int main ()
{
int n;
int a,b,c;
scanf ("%d", &n);
int i,j,k=0;
for (i=0;i<=n-1;i++)
{
scanf ("%s %d", &patient[i].id, &patient[i].age);
patient[i].num = i;
}
int s[100];
for (i=0;i<=99;i++)
{
s[i]=i;
}
for (i=0;i<=n-2;i++)
{
for (j=0;j<=n-2;j++)
{
if (patient[s[j]].age<patient[s[j+1]].age)
{
a=s[j];
s[j]=s[j+1];
s[j+1]=a;
}
}
}
for (i=0;i<=n-1;i++)
{
if (patient[i].age>=60)
k=k+1;
}
for (i=0;i<=k-2;i++)
{
for (j=0;j<=k-2;j++)
{
if (s[j]>s[j+1] && patient[s[j]].age==patient[s[j+1]].age)
{
a=s[j];
s[j]=s[j+1];
s[j+1]=a;
}
}
}
for (i=k;i<=n-2;i++)
{
for (j=k;j<=n-2;j++)
{
if (s[j]>s[j+1])
{
a=s[j];
s[j]=s[j+1];
s[j+1]=a;
}
}
}
for (i=0;i<=n-1;i++)
{
printf ("%s\n", patient[s[i]].id);
}
return 0;
}
|
9 | 4098 |
int main()
{
int n;
int i,j;
scanf("%d",&n);
char bh[999][999];
int nl[999];
for(i=1;i<=n;i++)
{
scanf("%s %d",bh[i],&nl[i]);
}
int pd[999],k=0;
for(i=1;i<=n;i++)
{
if(nl[i]>=60)
{
k++;
pd[k]=i;
}
}
int e;
for(i=1;i<k;i++)
{
for(j=1;j<=k-i;j++)
{
if (nl[pd[j]]<nl[pd[j+1]])
{
e=pd[j+1];
pd[j+1]=pd[j];
pd[j]=e;
}
}
}
for(i=1;i<=n;i++)
{
if(nl[i]<60)
{
k++;
pd[k]=i;
}
}
for(i=1;i<=k;i++)
{
printf("%s\n",bh[pd[i]]);
}
return 0;
} |
9 | 4099 |
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;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.