label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
9 | 4200 | 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 | 4201 | main()
{
int m=0,n,i,j,t=0;
int num[100];
int a[100];
char string[11];
char stm[100][11];
char str[100][11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",stm[i]);
scanf("%d",&num[i]);
}
j=0;
for(i=0;i<n;i++)
{
if(num[i]>=60)
{
a[j]=num[i];
strncpy(str[j],stm[i],10);
j++;
t=j-1;
}
}
for(j=0;j<t;j++)
{
for(i=0;i<t-j;i++)
{
if(a[i]<a[i+1])
{
m=a[i];
a[i]=a[i+1];
a[i+1]=m;
strncpy(string,str[i],10);
strncpy(str[i],str[i+1],10);
strncpy(str[i+1],string,10);
}
}
}
for(i=0;i<=t;i++)
printf("%s\n",str[i]);
for(i=0;i<n;i++)
{
if(num[i]<60)
printf("%s\n",stm[i]);
}
getchar();
getchar();
}
|
9 | 4202 |
char id[NUM][LEN],oldid[NUM][LEN],newid[NUM][LEN];
int age[NUM];
int oldage[NUM],newage[NUM];
int main(){
int num;
int i=0,j=0, k=0,n=0;
int e_oldage;
char e_oldid[LEN];
scanf("%d", &num);
for(i = 0; i < num; i++){
scanf("%s %d ", id[i], &(age[i]));
}
for(i=0;i<num;i++){
if(age[i]>=60){
oldage[j]= age[i];
strcpy(oldid[j], id[i]);
j++;
}else {
newage[n]= age[i];
strcpy(newid[n], id[i]);
n++;
}
}
for(k = 1 ; k <= j; k++){
for(i = 0; i < j- k; i++){
if( oldage[i] < oldage[i+1]){
e_oldage = oldage[i+1];
strcpy(e_oldid, oldid[i+1]);
oldage[i+1] = oldage[i];
strcpy(oldid[i+1], oldid[i]);
oldage[i] = e_oldage;
strcpy(oldid[i], e_oldid);
}
}
}
for(i=0;i<j;i++){
printf("%s\n",oldid[i]);
}
for(i=0;i<n;i++){
printf("%s\n",newid[i]);
}
return 0;
} |
9 | 4203 | int main(){
char a[100][11],c[100][11];
int i,j,n,b[100],m,e=-1,f=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",&a[i],&b[i]);
}
for(i=0;i<n;i++){
if(b[i]>=60){
m=0;
for(j=0;j<n;j++){
if(b[i]<b[j]||(b[i]==b[j]&&i>j)){
m++;
}}
if(e<m)
e=m;
strcpy(c[m],a[i]);
}}
e=e+1;
for(i=0;i<n;i++){
if(b[i]<60){
strcpy(c[i-f+e],a[i]);
}else{
f++;
}}
for(i=0;i<n;i++){
printf("%s\n",c[i]);
}
return 0;
}
|
9 | 4204 |
struct patient{
char ID[10];
int age;
struct patient *next;
};
struct patient *creat(int n)
{ int i;
struct patient *head;
struct patient *p1,*p2;
p2=p1=(struct patient *)malloc(LEN);
head=p1;
scanf("%s %d",p1->ID,&p1->age);
for(i=1;i<n;i++)
{
p1=(struct patient *)malloc(LEN);
scanf("%s %d",p1->ID,&p1->age);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
int main()
{
int i,j,n;
char a[10];
scanf("%d",&n);
struct patient *h,*q,*p;
h=creat(n);
for(i=0;i<n;i++)
for(q=h;q->next!=NULL;q=q->next)
if(q->next->age>=60&&q->next->age>q->age)
{
strcpy(a,q->ID);strcpy(q->ID,q->next->ID);strcpy(q->next->ID,a);
j=q->age;q->age=q->next->age;q->next->age=j;
}
for(p=h;p!=NULL;p=p->next)
printf("%s\n",p->ID);
}
|
9 | 4205 | void main()
{
struct patient
{
char a[11];
int b;
}p[100];
int n,i,j=0,m,t;
char c[100][11],string[11];
int d[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",p[i].a,&p[i].b);
for(i=0;i<n;i++)
{
if(p[i].b>=60)
{
strcpy(c[j],p[i].a);
d[j]=p[i].b;
j++;
}
}
m=j;
for(j=0;j<m-1;j++)
for(i=0;i<m-1-j;i++)
if(d[i]<d[i+1])
{
t=d[i];
d[i]=d[i+1];
d[i+1]=t;
strcpy(string,c[i]);
strcpy(c[i],c[i+1]);
strcpy(c[i+1],string);
}
for(i=0;i<m;i++)
printf("%s\n",c[i],d[i]);
for(i=0;i<n;i++)
{
if(p[i].b<60)
printf("%s\n",p[i].a,p[i].b);
}
} |
9 | 4206 | struct patient{
char name[11];
int age;
int order;
};
int main(){
struct patient peo[NO];
int n,i,count=0,COUNT,j,k,e,agedata[NO],a=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&peo[i].name);
scanf("%d",&peo[i].age);
}
for(i=0;i<n;i++){
if(peo[i].age>=60){
count++;
agedata[a]=peo[i].age;
a++;
}
}//count number of old people
COUNT=count;
for(i=0;i<n;i++){
if(peo[i].age<60){
peo[i].order=count;
count++;
}
}// record order for young people
for(k=1;k<COUNT;k++){
for(j=0;j<COUNT-k;j++){
if(agedata[j]<agedata[j+1]){
e=agedata[j+1];
agedata[j+1]=agedata[j];
agedata[j]=e;
}
}
}//rearrage age of old people
for(i=0;i<COUNT;i++){
for(j=0;j<n;j++){
if(peo[j].age==agedata[i]){
peo[j].order=i;
}
}
}// record order for old people
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(peo[j].order==i){
printf("%s\n",peo[j].name);
}
}
}
return 0;
} |
9 | 4207 |
int main()
{
struct patient{
char id[10];
int age;
}br[100];
int n,i,j,mid,k;
char s[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",&br[i].id,&br[i].age);
}
for(k=0;k<n;k++){
for(i=0;i<n;i++){
if(br[i].age>=60){
for(j=i+1;j<n;j++){
if(br[j].age>=60){
if(br[j].age>br[i].age){
mid=br[i].age;
br[i].age=br[j].age;
br[j].age=mid;
strcpy(s,br[i].id);
strcpy(br[i].id,br[j].id);
strcpy(br[j].id,s);
}
break;
}
}
}
}
}
for(i=0;i<n;i++){
if(br[i].age>=60){
printf("%s\n",br[i].id);
}
}
for(i=0;i<n;i++){
if(br[i].age<60){
printf("%s\n",br[i].id);
}
}
return 0;
}
|
9 | 4208 | struct arr
{
char id[10];
int age;
struct arr *next;
};
int n;
struct arr *create(int m)
{
struct arr *head;
struct arr *p1,*p2;
n=1;
p1=p2=(struct arr *) malloc(LEN);
scanf("%s %d",&p1->id,&p1->age);
head=p1;
while(n<m)
{
p1=(struct arr *)malloc(LEN);
p2->next=p1;
n++;
p2=p1;
scanf("%s %d",&p1->id,&p1->age);
}
p1->next=NULL;
return(head);
}
struct arr *del(struct arr *head,long int dnum)
{
struct arr *p1,*p2;
p1=p2=head;
while(p1!=NULL&&p1->age==dnum)
{
head=p1->next;
p2=head;
free(p1);
p1=head;
}
while(p1!=NULL)
{
p2=p1;
p1=p1->next;
while(p1!=NULL&&p1->age==dnum)
{
p2->next=p1->next;
free(p1);
p1=p2->next;
}
}
return(head);
}
void print(struct arr *head)
{
struct arr *p;
p=head;
while(p!=NULL)
{
if(p==head)
printf("%s\n",p->id);
else printf("%s\n",p->id);
p=p->next;
}
}
void freelist(struct arr *head)
{
struct arr *p=head ;
if(head!=NULL)
{
while(p!=NULL)
{
head=head->next;
free(p);
p=head;
}
}
}
void main()
{
struct arr *head,*p1;
int m,max=0;
scanf("%d",&m);
head=create(m);
for(;;)
{
max=0;
for(p1=head;p1!=NULL;p1=p1->next)
{
max=(max>p1->age)?max:p1->age;
}
if(max>=60)
{
for(p1=head;p1!=NULL;p1=p1->next)
{
if(p1->age==max)
printf("%s\n",p1->id);
}
head=del(head,max);
}
else break;
}
print(head);
freelist(head);
}
|
9 | 4209 |
struct patient{
char id[10];
int age;}pat[100];
int over60[100];
int below60[100];
int m,k;
int main(int argc, char* argv[])
{
void choose(struct patient *p,int n);
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",pat[i].id,&pat[i].age);}
choose(pat,n);
for(j=1;j<=m;j++){
if(over60[m-j]!=over60[m-j-1]){
for(i=0;i<n;i++){
if(pat[i].age==over60[m-j]){
printf("%s\n",pat[i].id);
}}}}
for(i=0;i<n;i++){
if(pat[i].age<60){
printf("%s\n",pat[i].id);}}
return 0;
}
void choose(struct patient *p,int n){
void paixu(int *a,int n);
int i;
for(i=0,m=0,k=0;i<n;i++){
if((p+i)->age>=60){
over60[m]=(p+i)->age;
m++;}}
paixu(over60,m);}
void paixu(int *a,int n){
int j,i,e;
for(j=1;j<n;j++){
for(i=0;i<n-j;i++){
if(*(a+i)>*(a+i+1)){
e=*(a+i);
*(a+i)=*(a+i+1);
*(a+i+1)=e;}}}}
|
9 | 4210 | int main()
{
int n,sz[100];
scanf("%d",&n);
char zf[100][10],id[10];
int i,k,e=0;
for(i=0;i<n;i++){
scanf("%s %d",zf[i],&(sz[i]));
}
for(k=1;k<n;k++){
for(i=0;i<n-k;i++){
if(sz[i+1]>=60&&sz[i+1]>sz[i]){
e=sz[i];
sz[i]=sz[i+1];
sz[i+1]=e;
strcpy(id,zf[i]);
strcpy(zf[i],zf[i+1]);
strcpy(zf[i+1],id);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",zf[i]);
}
return 0;
}
|
9 | 4211 | int main()
{
int n,k,i,j,l;
int a[100],c[100],d[100];
char b[100][11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",b[i]);
scanf("%d",&a[i]);
d[i]=a[i];
c[i]=i;
}
for(j=0;j<n;j++)
{
for(i=0;i<n-1;i++)
{
if(d[i]<d[i+1])
{
k=d[i];
d[i]=d[i+1];
d[i+1]=k;
k=c[i];
c[i]=c[i+1];
c[i+1]=k;
}
}
}
for(j=0;j<n;j++)
{
if(d[j]<60)
{
l=j;
break;
}
}
for(j=0;j<l;j++)
{
k=c[j];
printf("%s\n",b[k]);
}
for(i=0;i<n;i++)
{
if(a[i]<60)
{
printf("%s\n",b[i]);
}
}
return 0;
}
|
9 | 4212 | struct kb
{
char ID[10];
int nl;
}kbr[100],lnr[100],ln;
int main()
{
int n,i,k=0,l;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s%d",&kbr[i].ID,&kbr[i].nl);
}
for (i=0;i<n;i++){
if(kbr[i].nl>=60){
strcpy(lnr[k].ID,kbr[i].ID);
lnr[k].nl=kbr[i].nl;
k++;
strcpy(kbr[i].ID,"000000000");
}
}
for (i=1;i<k;i++){
for(l=0;l<k-i;l++){
if(lnr[l].nl<lnr[l+1].nl){
ln=lnr[l+1];
lnr[l+1]=lnr[l];
lnr[l]=ln;
}
}
}
for (i=0;i<k;i++){
printf("%s\n",lnr[i].ID);
}
for (i=0;i<n;i++){
if(strcmp(kbr[i].ID,"000000000")==1){
printf("%s\n",kbr[i].ID);
}
}
return 0;
}
|
9 | 4213 | int main(){
struct point{
char id[10];
int age;
}patient[100];
int n;
int i,j,k;
int on=0,old[100],flag;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",patient[i].id,&patient[i].age);
}
for(j=120;j>=60;j--){
for(i=0;i<n;i++){
if(patient[i].age==j){
printf("%s\n",patient[i].id);
old[on]=i;
on++;
}
}
}
for(i=0;i<n;i++){
flag=0;
for(k=0;k<on;k++){
if(i==old[k]){
flag=1;
break;
}
}
if(flag==0){
printf("%s\n",patient[i].id);
}
}
return 0;
} |
9 | 4214 | void main()
{
int n,i,j,a[100],c[100],m=0,e[100],k=0,x;
char b[100][10],d[100][10],f[100][10],y[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",b[i],&a[i]);
if(a[i]>=60)
{
c[m]=a[i];
strcpy(d[m],b[i]);
m++;
}
else
{
e[k]=a[i];
strcpy(f[k],b[i]);
k++;
}
}
for(j=0;j<m-1;j++)
for(i=0;i<m-j-1;i++)
if(c[i]<c[i+1])
{
x=c[i];
c[i]=c[i+1];
c[i+1]=x;
strcpy(y,d[i]);
strcpy(d[i],d[i+1]);
strcpy(d[i+1],y);
}
for(i=0;i<m;i++)
printf("%s\n",d[i]);
for(i=0;i<k;i++)
printf("%s\n",f[i]);
} |
9 | 4215 | struct patient
{
char id[20];
int age;
}pat[100];
int main()
{
int i,k,n,e;
int ex[100],ex1[100];
i=0;
k=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%s%d",&(pat[i].id),&(pat[i].age));
ex[i]=pat[i].age;
ex1[i]=i+1;
}
for(k=n-1;k>=1;k--){
for(i=n-1;i>=n-k;i--){
if(ex[i]>ex[i-1]&&ex[i]>=60){
e=ex[i];
ex[i]=ex[i-1];
ex[i-1]=e;
e=ex1[i];
ex1[i]=ex1[i-1];
ex1[i-1]=e;
}
}
}
for(i=0;i<=n-1;i++){
if(ex[i]>=60){
printf("%s\n",pat[ex1[i]-1].id);
}
}
for(i=0;i<=n-1;i++){
if(ex[i]<60){
printf("%s\n",pat[ex1[i]-1].id);
}
}
return 0;
}
|
9 | 4216 | main()
{
int n,i,a[1000],e[1000],t,b,k,j,d;
char str[1000][1000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d",str[i],&a[i]);
}
b=0;
for(i=1;i<=n;i++)
{
if(a[i]>=60)
{b++;
}
}
t=b;
for(i=1;i<=n;i++)
{
if(a[i]<60)
{b++;
e[b]=i;}
}
k=0;
for(j=100;j>=60;j--)
{
for(i=1;i<=n;i++)
{
if(a[i]==j)
{k++;
e[k]=i;}
}
}
for(i=1;i<=n;i++)
{j=e[i];
if(i==1)
printf("%s",str[j]);
else
printf("\n%s",str[j]);
}
getchar();
getchar();
}
|
9 | 4217 | int main()
{
int n,i,j,k=0,m=0,t,x;
char w[10];
scanf("%d",&n);
struct patient
{char id[10];
int age;
}a[100];
for(i=0;i<n;i++)
scanf("%s%d",a[i].id,&a[i].age); /*?????*/
struct patient1
{char id[10];
int age;
}b[100];
struct patient2
{char id[10];
int age;
}c[100];
for(i=0;i<n;i++)
{
if(a[i].age>=60)
{
b[k].age=a[i].age;
for(j=0;j<10;j++)
{
b[k].id[j]=a[i].id[j];
}
k++;
} /*???????patient1????*/
else
{
c[m].age=a[i].age;
for(j=0;j<10;j++)
{
c[m].id[j]=a[i].id[j];
}
m++;
}
} /*?????????patient2,???*/
for(j=0;j<k-1;j++)
{
for(i=0;i<k-1-j;i++)
{
if(b[i].age<b[i+1].age)
{
t=b[i].age;
b[i].age=b[i+1].age;
b[i+1].age=t;
for(x=0;x<10;x++)
{
w[x]=b[i].id[x];
b[i].id[x]=b[i+1].id[x];
b[i+1].id[x]=w[x];
}
}
}
} /*???patient1?age???????id*/
for(i=0;i<k;i++)
printf("%s\n",b[i].id); /*??patient1*/
for(i=0;i<m;i++)
printf("%s\n",c[i].id); /*??patient2*/
return 0;
}
|
9 | 4218 |
int main()
{
int n,i,j,t,x[110],k,x2[110];
char id[110][20], temp[20], id2[100][20];
scanf("%d", &n);
k=0;
for (i=1;i<=n;i++){
scanf("%s %d" , &id[i],&x[i]);
if (x[i]>=60){
k++;
x2[k] = x[i];
strcpy(id2[k],id[i]);
}
}
for (i=1;i<=k;i++){
for (j=k;j>i;j--){
if (x2[j]>x2[j-1]){
t = x2[j];
x2[j] = x2[j-1];
x2[j-1] = t;
strcpy(temp,id2[j]);
strcpy(id2[j],id2[j-1]);
strcpy(id2[j-1],temp);
}
}
}
for (i=1;i<=k;i++){
printf("%s\n", id2[i]);
}
for (i=1;i<=n;i++){
if (x[i]<60)
printf("%s\n", id[i]);
}
return 0;
}
|
9 | 4219 | 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 | 4220 | 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 | 4221 | int main(){
int i,j,n,h1[100],h2[100],c1=0,c2=0,t;
char d1[100][10],d2[100][10],d[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",d);
scanf("%d",&t);
if(t>=60){
h1[c1]=t;
strcpy(d1[c1],d);
c1++;
}
else{
h2[c2]=t;
strcpy(d2[c2],d);
c2++;
}
}
for(i=1;i<=c1;i++){
for(j=0;j<c1-i;j++){
if(h1[j]<h1[j+1]){
t=h1[j];
h1[j]=h1[j+1];
h1[j+1]=t;
strcpy(d,d1[j]);
strcpy(d1[j],d1[j+1]);
strcpy(d1[j+1],d);
}
}
}
for(i=0;i<c1;i++){
puts(d1[i]);
}
for(i=0;i<c2;i++){
puts(d2[i]);
}
return 0;
}
|
9 | 4222 | struct mouse{
int weight;
char color[11];
struct mouse *next,*before;
};
int main(){
int i,j,n,max;
scanf("%d",&n);
struct mouse *m,*head,*p1,*p2,*fin;
head=p1=p2=(struct mouse *) malloc(sizeof(struct mouse));
scanf("%s %d",p1->color,&p1->weight);
for (i=1;i<=n-1;i++){
p1=(struct mouse *) malloc(sizeof(struct mouse));
scanf("%s %d",p1->color,&p1->weight);
p2->next=p1;p1->before=p2;p2=p1;
}
fin=p1;
p1->next=NULL;
for (i=1;i<=n-1;i++){
max=0;p1=head;
for (j=1;j<=n+1-i;j++){
if (p1->weight>max) {max=p1->weight;m=p1;}
p1=p1->next;
}
if (m->weight<60) break;
printf("%s\n",m->color);
if (m==head) {head=head->next;continue;}
if (m==fin) {fin=fin->before;fin->next=NULL;continue;}
if (m!=head && m!=fin) {p1=m->before;p1->next=m->next;m=m->next;m->before=p1;}
}
p1=head;
printf("%s\n",head->color);
for (;p1->next!=NULL;){
p1=p1->next;printf("%s\n",p1->color);
}
} |
9 | 4223 |
struct data
{
char id[11];
int age;
struct data *next;
}*p1,*p2,*head,*q1,*q2,*qhead;
void main ()
{
int i,n,k=0;
struct data * sort( struct data *head,int n);
void print(struct data *head);
scanf ("%d",&n);
head=p1=p2=(struct data *)malloc(LEN);
head->next=NULL;
for (i=0;i<n;i++)
{
p1=(struct data *)malloc(LEN);
scanf ("%s %d",p1->id,&p1->age);
if ((p1->age)>=60)
k++;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
qhead=q1=q2=(struct data *)malloc(LEN);
qhead->next=NULL;
for (i=n;i>n-k;i--)
{
head=sort(head,i);
}
q2->next=NULL;
q2->next=head->next;
free(head);
print(qhead);
}
struct data * sort(struct data *head,int n)
{
int max=59,i;
struct data *p1,*p2,*code,*pre;
p2=head;
p1=head->next;
for (i=0;i<n;i++)
{
if ((p1->age)>max)
{
max=p1->age;
code=p1;
pre=p2;
}
p1=p1->next;
p2=p2->next;
}
q1=(struct data *)malloc(LEN);
strcpy(q1->id,code->id);
q1->age=code->age;
q2->next=q1;
q2=q1;
if (pre==head)
head->next=code->next;
else
pre->next=code->next;
free(code);
return (head);
}
void print(struct data *qhead)
{
struct data *q;
q=qhead->next;
do
{
printf ("%s\n",q->id);
q=q->next;
}
while (q!=NULL);
}
|
9 | 4224 |
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 | 4225 | main()
{ char temp_0[10],id[100][10];
int i,j,n,max,age[100],num[100],yes[100],ncount=1,temp,num_1;
scanf("%d",&n);
for(i=0;i<n;i++)
{num[i]=i;
scanf("%s %d",id[i],&age[i]);
}
for(j=0;j<n;j++) {
for(i=0;i<n-j-1;i++)
{ if(age[i]<age[i+1])
{ strcpy(temp_0,id[i]);
temp=age[i];
num_1=num[i];
strcpy(id[i],id[i+1]);
age[i]=age[i+1];
num[i]=num[i+1];
age[i+1]=temp;
strcpy(id[i+1],temp_0);
num[i+1]=num_1; }
}}
for(i=0;i<n;i++)
{if(age[i]>=60)
printf("%s\n",id[i]);
}
for(j=0;j<n;j++)
{for(i=0;i<n-j-1;i++)
{if(num[i]>num[i+1])
{ strcpy(temp_0,id[i]);
temp=age[i];
num_1=num[i];
strcpy(id[i],id[i+1]);
age[i]=age[i+1];
num[i]=num[i+1];
age[i+1]=temp;
strcpy(id[i+1],temp_0);
num[i+1]=num_1;
}}
}
for(i=0;i<n;i++)
{if(age[i]<60)
printf("%s\n",id[i]);}
getchar();
getchar(); }
|
9 | 4226 | struct person
{
char ID[20];
int age;
};
int main()
{
struct person a[100]={0}, b[100]={0},t;
int n, i,j, k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",a[i].ID,&a[i].age);
if(a[i].age>=60)
{
b[k]=a[i];
k++;
}
}
for(i=0;i<k-1;i++)
for(j=0;j<k-1-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<k;i++)
{
puts(b[i].ID);
printf("\n");
}
for(i=0;i<n;i++)
{
if(a[i].age<60)
{
puts(a[i].ID);
printf("\n");
}
}
return 0;
} |
9 | 4227 | 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 | 4228 | int main()
{
struct point
{
char x[10];
int y;
}
sz[100];
struct po
{
char a[10];
int b;
int c;
}
lnr[100];
int n,temp;
int tag=0;
char tem[100];
int count=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s%d",sz[i].x,&sz[i].y);
}
for(int j=0;j<n;j++)
{
for(int k=tag;k<n;k++)
{
if(sz[k].y>=60)
{
lnr[j].c=k;
lnr[j].b=sz[k].y;
strcpy(lnr[j].a,sz[k].x);
tag=k+1;
count++;
break;
}
}
}
for(int l=0;l<count-1;l++)
{
for(int m=count-1;m>l;m--)
{
if(lnr[m].b>lnr[m-1].b)
{
temp=lnr[m-1].b;
lnr[m-1].b=lnr[m].b;
lnr[m].b=temp;
strcpy(tem,lnr[m-1].a);
strcpy(lnr[m-1].a,lnr[m].a);
strcpy(lnr[m].a,tem);
}
}
}
tag=n-1;
for(int o=n-1;o>count-1;o--)
{
for(int p=tag;p>=0;p--)
{
if(sz[p].y<60)
{
sz[o].y=sz[p].y;
strcpy(sz[o].x,sz[p].x);
tag=p-1;
break;
}
}
}
for(int q=0;q<count;q++)
{
printf("%s\n",lnr[q].a);
}
for(int r=count;r<n;r++)
{
printf("%s\n",sz[r].x);
}
return 0;
}
|
9 | 4229 | struct student
{
char num[1000];
int age;
struct student *next;
};
struct student *creat(int n)
{
struct student *p1,*p2,*head;
int i;
for (i = 0;i < n;i++)
{
p1 = (struct student*)malloc(len);
scanf("%s%d",p1->num,&p1->age);
p1->next = NULL;
if(i == 0)
{
p2 = p1;
head = p1;
}
else
{
p2->next = p1;
p2 = p1;
}
}
return (head);
}
struct student *trans(struct student *head,int n)
{
struct student *p1,*p2,*p3,*p4,*q;
int i,j;
for (i = 0;i<n;i++)
{
p1 = head;
p2 = p1->next;
p3 = p2->next;
p4 = head;
for(j = 0;p1->next != NULL;j++)
{
if(p2->age >=60)
{
if(p1->age < p2->age)
{
if(p1 == head)
{
p2->next = p1;
p1->next = p3;
head = p2;
q = p1;
p1 = p2;
p2 = q;
p4 = head;
}
else if(p2 ->next != NULL)
{
p1->next = p3;
p2->next = p1;
p4->next = p2;
q = p1;
p1 = p2;
p2 = q;
}
else
{
p2->next = p1;
p4 ->next = p2;
p1->next = 0;
q = p1;
p1 = p2;
p2 = q;
}
}
}
if(p1 != head)
p4 = p4->next;
p1 = p1->next;
p2 = p2->next;
if (p3 != NULL)
p3 = p3->next;
}
q = head;
}
return(q);
}
print(struct student *head)
{
struct student *p;
p = head;
for (;p !=NULL;p = p->next)
printf("%s\n",p->num);
}
main()
{
struct student *p;
int n;
scanf("%d",&n);
p = creat(n);
p = trans(p,n);
print(p);
}
|
9 | 4230 | 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 | 4231 | 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
{ for(t=head1,q=t;t!=NULL;q=t,t=t->next)
{ if(t->age<at&&t!=head1)
{
p11=(struct patient *)malloc(sizeof(struct patient));
p11->age=at;
strcpy(p11->id,id);
q->next=p11;
p11->next=t;
break;
}
if(t->age<at&&t==head1)
{
p11=(struct patient *)malloc(sizeof(struct patient));
p11->age=at;
strcpy(p11->id,id);
p11->next=head1;
head1=p11;
break;
}
/* if(t->age==at)
{
p11=(struct patient *)malloc(sizeof(struct patient));
p11->age=at;
strcpy(p11->id,id);
p11->next=t->next;
t->next=p11;
break;
} */
}
if(t==NULL)
{
p11=(struct patient *)malloc(sizeof(struct patient));
p11->age=at;
strcpy(p11->id,id);
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 | 4232 |
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 | 4233 | struct pat
{
char id[10];
int age;
}pat[100];
main()
{
int n,a[200],j,i;
scanf("%d",&n);
for(j=0;j<150;j++) a[j]=0;
for( i=0;i<n;i++)
{
scanf("%s %d",pat[i].id,&pat[i].age);
for(j=1;j<150;j++)
{
if(j==pat[i].age) a[j]++;
}
}
for(j=150;j>=60;j--)
{
if(a[j]==0) continue;
for(i=0;i<n;i++)
{
if(j==pat[i].age) printf("%s\n",pat[i].id);
}
}
for(i=0;i<n;i++)
if(pat[i].age<60) printf("%s\n",pat[i].id);
getchar();
getchar();
} |
9 | 4234 | 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 | 4235 |
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 | 4236 | 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 | 4237 | int main(int argc, char *argv[])
{
struct fy{
char a[12];
int k;
int s;
struct fy *p;
}x[100],*head;
int n,i,j,l,kk,ss;
char aa[12];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",x[i].a,&x[i].k);
x[i].s=x[i].k>=60?1:0;
x[i].p=&x[i+1];
}
head=&x[0];
x[n-1].p=NULL;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(x[i].s==1&&x[j].s==1)
{
if(x[i].k<x[j].k)
{
kk=x[j].k;
ss=x[j].s;
strcpy(aa,x[j].a);
for(l=j;l>i;l--)
{
x[l].k=x[l-1].k;
x[l].s=x[l-1].s;
strcpy(x[l].a,x[l-1].a);
}
x[i].k=kk;
x[i].s=ss;
strcpy(x[i].a,aa);
}
}
}
if(x[i].s==1)
printf("%s\n",x[i].a);
}
while(head!=NULL)
{
if(head->s==0)
printf("%s\n",head->a);
head=head->p;
}
return 0;
}
|
9 | 4238 | struct patient
{ char ID[10];
int age;
int a6;
char Id[10];
};
void main()
{ struct patient bin[N];
int n,mid;
char s[10];
int i=0,j=0,k=0;
char c[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",&bin[i].ID,&bin[i].age);
for(i=0;i<n;i++)
{ if(bin[i].age>=60)
{ bin[j].a6=bin[i].age;
strcpy(bin[j].Id,bin[i].ID);
j++;
bin[i].age=0;
}
}
for(k=1;k<j;k++)
{ for(i=0;i<j-k;i++)
if(bin[i].a6<bin[i+1].a6)
{ mid=bin[i].a6;
bin[i].a6=bin[i+1].a6;
bin[i+1].a6=mid;
strcpy(c,bin[i].Id);
strcpy(s,bin[i+1].Id);
strcpy(bin[i+1].Id,c);
strcpy(bin[i].Id,s);
}
}
for(i=0;i<j;i++)
printf("%s\n",bin[i].Id);
for(i=0;i<n;i++)
{ if(bin[i].age!=0)
printf("%s\n",bin[i].ID);
}
}
|
9 | 4239 | struct stu{
char n[30];
int y;
};
void sort(struct stu a[],int l, int r)
{
int i=l,j=r,t=a[(l+r)/2].y;
struct stu temp;
while (i<=j)
{
while (a[i].y>t) i++;
while (a[j].y<t) j--;
if (i<=j)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
i++;
j--;
}
}
if (l<j) sort(a,l,j);
if (i<r) sort(a,i,r);
}
int main()
{
int n;
struct stu a[1000],b[1000],c[1000],temp;
int i,j,tot=0,totc=0;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s %d",&a[i].n,&a[i].y);
if (a[i].y>=60)
{
b[++tot]=a[i];
} else
{
c[++totc]=a[i];
}
}
for (i=1;i<tot;i++)
for (j=2;j<=tot-i+1;j++)
if (b[j-1].y<b[j].y)
{
temp=b[j-1];
b[j-1]=b[j];
b[j]=temp;
}
for (i=1;i<=tot;i++) printf("%s\n",b[i].n);
for (i=1;i<=totc;i++) printf("%s\n",c[i].n);
// scanf("%d",&n);
return 0;
}
|
9 | 4240 |
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 | 4241 | int main()
{
int i,a,n,e,sz[100],sx[100]={0};
char st[100][11],sa[11],sd[100][11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&st[i]);
scanf("%d",&sz[i]);
}
for(i=0;i<n;i++)
{
if(sz[i]>=60)
{
sx[i]=sz[i];
strcpy(sd[i],st[i]);
}
}
for(i=1;i<=n;i++)
{
for(a=0;a<n-i;a++)
{
if(sx[a]<sx[a+1])
{
e=sx[a];
sx[a]=sx[a+1];
sx[a+1]=e;
strcpy(sa,sd[a]);
strcpy(sd[a],sd[a+1]);
strcpy(sd[a+1],sa);
}
}
}
for(i=0;i<n;i++)
{
if(sx[i]>=60)
puts(sd[i]);
}
for(i=0;i<n;i++)
{
if(sz[i]<60)
puts(st[i]);
}
return 0;
} |
9 | 4242 | 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 | 4243 |
struct patient
{
char ID[11];
int age;
}p[1000];
int main()
{
int n,i,k,j,l,a=0,b=0,e;
int sz1[1000],sz2[1000];
char zfc1[1000][11],zfc2[1000][11],f[11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&p[i].ID);
scanf(" %d",&p[i].age);
}
for(i=0,j=0,l=0;i<n;i++)
{
if(p[i].age>=60)
{
a++;
sz1[j]=p[i].age;
strcpy(zfc1[j],p[i].ID);
j++;
}
else
{
b++;
sz2[l]=p[i].age;
strcpy(zfc2[l],p[i].ID);
l++;
}
}
for(k=0;k<n;k++)
{
for(j=n-1;j>=k;j--)
{
if(sz1[j+1]>sz1[j])
{
e=sz1[j];
sz1[j]=sz1[j+1];
sz1[j+1]=e;
strcpy(f,zfc1[j]);
strcpy(zfc1[j],zfc1[j+1]);
strcpy(zfc1[j+1],f);
}
}
}
for(j=0;j<a;j++)
{
printf("%s\n",zfc1[j]);
}
for(l=0;l<b;l++)
{
printf("%s\n",zfc2[l]);
}
return 0;
} |
9 | 4244 | // ??(14-6) ????.cpp : Defines the entry point for the console application.
//
struct patient
{
char id[20];
int age;
int num;
};
int main()
{
int n;
scanf("%d",&n);
int i,j;
struct patient p[100];
for(i=1;i<=n;++i)
{
scanf("%s%d",&p[i].id,&p[i].age);
p[i].num=i;
}
for(i=1;i<=n-1;++i)
{
for(j=i+1;j<=n;++j)
{
if(p[j].age>p[i].age)
{
struct patient t;
t=p[i];
p[i]=p[j];
p[j]=t;
}
}
}
for(i=1;p[i].age>=60;++i)
{
for(j=i+1;p[j].age==p[i].age;++j)
{
if(p[i].num>p[j].num)
{
struct patient t;
t=p[i];
p[i]=p[j];
p[j]=t;
}
}
printf("%s\n",p[i].id);
}
for(j=i;j<=n;++j)
{
int k;
for(k=j+1;k<=n;++k)
{
if(p[j].num>p[k].num)
{
struct patient t;
t=p[j];
p[j]=p[k];
p[k]=t;
}
}
printf("%s\n",p[j].id);
}
return 0;
}
|
9 | 4245 | 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 | 4246 | 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 | 4247 | struct patient{
char id[10];
int age;
}young[100],old[100];
int main(){
int i,j,n,temp,yn=0,on=0,people[150]={0};
char t[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",t,&temp);
if(temp>=60){
strcat(old[on].id,t);
old[on].age=temp;
on++;
people[temp]++;
}
else{
strcat(young[yn].id,t);
young[yn].age=temp;
yn++;
}
}
for(i=149;i>=60;i--){
if(people[i]>0){
for(j=0;j<on;j++)
if(old[j].age==i)
printf("%s\n",old[j].id);
}
}
for(i=0;i<yn;i++)
printf("%s\n",young[i].id);
}
|
9 | 4248 | struct pa
{
char id[10];
int age;
}patient[100],patient2[100];
void main()
{
int i,k,m,n,j,temp;
char id2[10];
scanf("%d\n",&n); //input the patient number
for(i=0;i<n;i++) //insert the information of the patients
{
scanf("%s %d\n",patient[i].id,&patient[i].age);
}
for(i=0,j=0;i<n;) //deal with the information
{
if(patient[i].age>=60)
{
strcpy(patient2[j].id,patient[i].id);
patient2[j].age=patient[i].age;
// printf("%d ",patient2[j].age);
j++;
for(k=i;k<n-1;k++)
{
strcpy(patient[k].id,patient[k+1].id);
patient[k].age=patient[k+1].age;
}
n--;
}
else i++;
}
// printf("\n");
// printf("%d",j);
for(i=1;i<j;i++)
{
for(k=0;k<i;k++)
{
if(patient2[i].age>patient2[k].age)
{
temp=patient2[i].age;
strcpy(id2,patient2[i].id);
for(m=i;m>k;m--)
{
patient2[m].age=patient2[m-1].age;
strcpy(patient2[m].id,patient2[m-1].id);
}
patient2[k].age=temp;
strcpy(patient2[k].id,id2);
}
// printf("\n");
// printf("%d %d ",patient2[i].age,patient2[i+1].age);
}
}
for(i=0;i<j;i++)printf("%s\n",patient2[i].id);
for(i=0;i<n;i++)printf("%s\n",patient[i].id);
} |
9 | 4249 |
struct pat
{
char num[10];
int age;
int turn;
} pa[100],temp,temp2;
int main()
{
int i,j,t,s,n,m;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d",&pa[i].num,&pa[i].age);
pa[i].turn=i;
}
for(i=1;i<=n;i++)
{
if(pa[i].age>=60)
{
for(j=1;j<=i;j++)
{
if(pa[i].age>pa[j].age)
{
temp=pa[j];
pa[j]=pa[i];
for(t=i-1;t>j;t--)
{
pa[t+1]=pa[t];
}
pa[j+1]=temp;
break;
}
}
}
}
for(i=1;i<=n;i++)
{
puts(pa[i].num);
}
return 0;
} |
9 | 4250 | void main()
{
int n,i,j;
int a[200],t;
char b[200][11],b1[11];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&b[i],&a[i]);
for(i=0;i<n;i++)
for(j=0;j<n-i;j++)
if(a[j+1]>=60&&a[j]<a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
strcpy(b1,b[j]);
strcpy(b[j],b[j+1]);
strcpy(b[j+1],b1);
}
for(i=0;i<n;i++)
printf("%s\n",b[i]);
}
|
9 | 4251 | struct patient
{
char ID[10];
int age;
struct patient *next;
};
void sort(struct patient * head,struct patient * q)
{
struct patient *pre=head,*p=pre->next,*s;
s=(struct patient *)malloc(sizeof(struct patient));
s->age=q->age;strcpy(s->ID,q->ID);
s->next=NULL;
if(q->age>=60)
{
while((p!=NULL)&&(q->age<=p->age))
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
else
{
while(p!=NULL)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
}
void print(struct patient *head)
{
struct patient *p;
p=head;
while(p!=NULL)
{
printf("%s\n",p->ID);
p=p->next;
}
}
void main()
{
int n,i;
struct patient *head;
struct patient *p;
head=(struct patient *)malloc(sizeof(struct patient));
head->next=NULL;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
p=(struct patient *)malloc(sizeof(struct patient));
scanf("%s %d",p->ID,&p->age);
sort(head,p);
}
print(head->next);
} |
9 | 4252 | int main(){
int n;
int i,j=0;
scanf("%d",&n);
char **id=(char**)malloc(sizeof(char*)*n);
for(i=0;i<n;i++){
id[i]=(char*)malloc(sizeof(char)*10);
}
int p=0;
int *year=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%s %d",id[i],&year[i]);
if(year[i]>=60){
p++;
}
}
char **idolder=(char**)malloc(sizeof(char*)*p);
for(i=0;i<n;i++){
idolder[i]=(char*)malloc(sizeof(char)*10);
}
int *yearolder=(int*)malloc(sizeof(int)*p);
for(i=0;i<n;i++){
if(year[i]>=60){
idolder[j]=id[i];
yearolder[j]=year[i];
j++;
}
}
int e;
char *id1=(char*)malloc(sizeof(char)*10);
for(i=1;i<=p;i++){
for(j=0;j<p-i;j++){
if(yearolder[j+1]>yearolder[j]){
id1=idolder[j];
idolder[j]=idolder[j+1];
idolder[j+1]=id1;
e=yearolder[j];
yearolder[j]=yearolder[j+1];
yearolder[j+1]=e;
}
}
}
for(i=0;i<p;i++){
printf("%s\n",idolder[i]);
}
for(i=0;i<n;i++){
if(year[i]<60){
printf("%s\n",id[i]);
}
}
return 0;
} |
9 | 4253 | struct patient
{
char id[20];
int age;
};
int main()
{
int i,j,tem,n,len;
char id[20];
struct patient a[200];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%s%d",a[i].id,&a[i].age);
for (i=0;i<n;i++)
{
for (j=n-2;j>=i;j--)
if (a[j+1].age>=60&&a[j+1].age>a[j].age)
{
tem=a[j].age;
a[j].age=a[j+1].age;
a[j+1].age=tem;
len=strlen(a[j].id);
strcpy(id,a[j].id);
id[len]='\0';
strcpy(a[j].id,a[j+1].id);
strcpy(a[j+1].id,id);
}
printf("%s\n",a[i].id);
}
return 0;
} |
9 | 4254 | 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 | 4255 | void main()
{
int n,i,age[100],a[100],j=0,k,l,temp,ord[100],o[100];
char num[100][10],old[100][10],t[10];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%s %d",num[i],&age[i]);
for(i=0;i<n;i++) ord[i]=i;
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
a[j]=age[i];
o[j]=ord[j];
strcpy(old[j],num[i]);
j++;
}
}
for(k=0;k<j;k++)
{
for(l=k+1;l<j;l++)
{
if(a[k]<a[l])
{
temp=a[k];
a[k]=a[l];
a[l]=temp;
temp=o[k];
o[k]=o[l];
o[l]=temp;
strcpy(t,old[k]);
strcpy(old[k],old[l]);
strcpy(old[l],t);
}
}
}
for(k=0;k<j;k++)
{
for(l=k+1;l<j;l++)
{
if(a[k]==a[l])
{
if(o[k]>o[l])
{
temp=a[k];
a[k]=a[l];
a[l]=temp;
temp=o[k];
o[k]=o[l];
o[l]=temp;
strcpy(t,old[k]);
strcpy(old[k],old[l]);
strcpy(old[l],t);
}
}
}
}
for(i=0;i<j;i++) printf("%s\n",old[i]);
for(i=0;i<n;i++)
{
if(age[i]<60) printf("%s\n",num[i]);
}
}
|
9 | 4256 |
struct patient
{
char id[10];
int age;
struct patient *next;
};
struct patient *creat(int n)
{
struct patient *head,*p1,*p2;
int i;
p1=(struct patient *)malloc(len);
scanf("%s %d",p1->id,&p1->age);
p1->next=NULL;
head=p1;
p2=p1;i=1;
do
{
p1=(struct patient *)malloc(len);
scanf("%s %d",p1->id,&p1->age);
p1->next=NULL;
i++;
p2->next=p1;
p2=p1;
}while(i<n);
return(head);
}
struct patient *tiao(struct patient *head,int n)
{
struct patient *p1;
int t,i;
char s[10];
p1=head;
for(i=0;i<n;i++)
{
p1=head;
do
{
if(p1->age<(p1->next)->age&&(p1->next)->age>=60)
{
t=p1->age;
p1->age=(p1->next)->age;
(p1->next)->age=t;
strcpy(s,p1->id);
strcpy(p1->id,(p1->next)->id);
strcpy((p1->next)->id,s);
}
p1=p1->next;
}while(p1->next);
}
return(head);
}
void print(struct patient *head)
{
struct patient *p;
p=head;
do
{
printf("%s\n",p->id);
p=p->next;
}while(p);
}
void main()
{
struct patient *head;
int n;
scanf("%d",&n);
head=creat(n);
head=tiao(head,n);
print(head);
}
|
9 | 4257 | 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 | 4258 | 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 | 4259 | int main()
{
struct pa
{
char ID[10];
int age;
}
*p;
int n, i, k, num=0, m=0;
scanf("%d",&n);
p=(struct pa*)malloc(sizeof(struct pa)*n);
for(i=0;i<n;i++)
{
scanf("%s%d",p[i].ID, &p[i].age);
if(p[i].age>=60) num++;
}
int w=0;
for(i=0;i<n;i++)
{
if(p[i].age>=60)
{
struct pa q=p[i];
for(k=i;k>w;k--)
{
p[k]=p[k-1];
}
p[w]=q;
w++;
}
}
for(i=num-1;i>0;i--)
{
for(k=0;k<i;k++)
{
if(p[k].age<p[k+1].age)
{
struct pa q=p[k];
p[k]=p[k+1];
p[k+1]=q;
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",p[i].ID);
}
free(p);
return 0;
}
|
9 | 4260 |
int main()
{
int i,j,k,n;
char a[11];
int b;
scanf("%d",&n);
struct patient
{
char num[11];
int age;
}pat[100];
for(i=0;i<n;i++){
scanf("%s%d",pat[i].num,&pat[i].age);
}
for(i=0;i<n;i++){
for(j=0;j<n-1-i;j++){
if(pat[j].age<pat[j+1].age&&pat[j+1].age>=60){
for(k=0;k<10;k++){
a[k]=pat[j].num[k];
pat[j].num[k]=pat[j+1].num[k];
pat[j+1].num[k]=a[k];
}
b=pat[j].age;
pat[j].age=pat[j+1].age;
pat[j+1].age=b;
}
}
}
for(i=0;i<n;i++){
printf("%s\n",pat[i].num);
}
return 0;
} |
9 | 4261 |
struct mice
{
int wei;
char color[100];
struct mice *next;
};
struct mice *creat(int c)
{
struct mice *head;
struct mice *p1,*p2;
struct mice *kok;
kok=(struct mice*)malloc(LEN);
kok->wei=0;strcpy(kok->color,"\0");
int t;
t=0;
p1=p2=(struct mice*)malloc(LEN);
scanf("%s %d",p1->color,&p1->wei);
head=NULL;
while(t<c)
{
t=t+1;
if(t==1)
{head=p1;}
else
{
p2->next=p1;
p2=p1;
p1=(struct mice*)malloc(LEN);
scanf("%s %d",p1->color,&p1->wei);
}
}
p2->next=p1;
p2=p1;
p2->next=kok;
return(head);
}
void mun(struct mice *hoih,int io)
{
int i,j,k;
k=0;
struct mice *bt;
bt=hoih;
char str[100];
for(i=0;i<io;i++)
{
for(j=0;j<io-i;j++)
{
if(hoih->wei<(hoih->next)->wei&&(hoih->next)->wei>=60)
{
k=hoih->wei;
hoih->wei=(hoih->next)->wei;
(hoih->next)->wei=k;
strcpy(str,hoih->color);
strcpy(hoih->color,(hoih->next)->color);
strcpy((hoih->next)->color,str);
}
hoih=hoih->next;
}
hoih=bt;
}
return;
}
void main()
{
int n,h;
struct mice *creat(int c);
struct mice *p,*he;
scanf("%d",&n);
p=creat(n);
he=p;
void mun(struct mice *hoih,int io);
mun(p,n);
p=he;
for(h=0;h<n;h++)
{
printf("%s\n",p->color);
p=p->next;
}
}
|
9 | 4262 | struct patient{
char id[10];
int age;
struct patient* next;
struct patient* last;
};
char temp[10];
int main()
{
struct patient *p1,*p2,*head,p[N];
int n,i,j,tmp;
scanf("%d",&n);
memset(p,0,sizeof(p));
head=p+1;
for(i=1;i<=n;i++)
{
scanf("%s %d",p[i].id,&p[i].age);
p[i].last=p+i-1;
p[i].next=p+i+1;
}
head->last=NULL;
p[i].next=NULL;
for(i=n;i>1;i--)
{
for(j=1;j<n;j++)
{
if((p+j+1)->age>=60&&(p+j+1)->age>(p+j)->age)
{
memcpy(temp,(p+j)->id,sizeof(temp));
memcpy((p+j)->id,(p+j+1)->id,sizeof(temp));
memcpy((p+j+1)->id,temp,sizeof(temp));
tmp=(p+j)->age;
(p+j)->age=(p+j+1)->age;
(p+j+1)->age=tmp;
}
}
}
for(;head!=NULL;head=head->next)
printf("%s\n",head->id);
} |
9 | 4263 | 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 | 4264 | struct bingren
{
char id[10];
int o;
}bingren[201];
void main()
{
int n,i,j,y,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",bingren[i].id,&bingren[i].o);
}
for(i=0,j=100;i<n;i++)
{
if(bingren[i].o>=60)
{
bingren[j]=bingren[i];
j++;
}
}
y=j;
for(j=0;j<y-1;j++)
{
for(i=100;i<y-j;i++)
{
if(bingren[i].o<bingren[i+1].o)
{
bingren[200]=bingren[i];
bingren[i]=bingren[i+1];
bingren[i+1]=bingren[200];
}
}
}
for(i=100;i<y;i++)
{
printf("%s\n",bingren[i].id);
}
for(i=0;i<n;i++)
{
if(bingren[i].o<60)
printf("%s\n",bingren[i].id);
}
}
|
9 | 4265 | struct ILL{
char id[10];
int age;
};
int main()
{
struct ILL ill[100];
int n,i,k,j=0,Age[100],x;
char a[100][10],b[10];
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s",ill[i].id);
scanf("%d",&ill[i].age);
if (ill[i].age>=60)
{ strcpy(a[j],ill[i].id);
Age[j]=ill[i].age;
j++;
}
}
for (i=0;i<j-1;i++){
for (k=0;k<j-i-1;k++){
if (Age[k]<Age[k+1]){
strcpy(b,a[k+1]);
strcpy(a[k+1],a[k]);
strcpy(a[k],b);
x=Age[k];
Age[k]=Age[k+1];
Age[k+1]=x;
}
}
}
for (i=0;i<j;i++){
puts(a[i]);
}
for (i=0;i<n;i++){
if (ill[i].age<60){
printf("%s\n",ill[i].id);
}
}
return 0;
}
|
9 | 4266 | int main()
{
struct date
{
char a[10];
int num;
struct date *next;
};
struct date *p1,*p2,*head;
int n,i,temp,j,compare;
char tem[10];
scanf("%d",&n);
head=p1=p2=(struct date *)malloc(len);
scanf("%s %d",head->a,&head->num);
head->next=NULL;
head=p1;
for(i=2;i<=n;i++)
{
p2=(struct date *)malloc(len);
scanf("%s %d",p2->a,&p2->num);
p2->next=NULL;
p1->next=p2;
p1=p2;
}
for(i=n-1;i>=1;i--)
{
p1=head;p2=p1->next;
for(j=1;j<=i;j++)
{
compare=strcmp(p1->a,p2->a);
if(p1->num<60&&p2->num>=60)
{
strcpy(tem,p1->a);
strcpy(p1->a,p2->a);
strcpy(p2->a,tem);
temp=p2->num;
p2->num=p1->num;
p1->num=temp;
}
if(p1->num>=60&&p2->num>=60&&p1->num<p2->num)
{
strcpy(tem,p1->a);
strcpy(p1->a,p2->a);
strcpy(p2->a,tem);
temp=p2->num;
p2->num=p1->num;
p1->num=temp;
}
p1=p2;
p2=p1->next;
}
}
p1=p2=head;
for(i=1;i<=n;i++)
{
printf("%s\n",p2->a);
p1=p2;
p2=p1->next;
}
return 0;
} |
9 | 4267 | 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 | 4268 | int main()
{
struct patient
{
char id[10];
int age;
} a[100],m,k;
int i,j,n,num=0;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%s %d",a[i].id,&a[i].age);
for (i=0;i<n;i++)
{
if(a[i].age>=60)
{
num++;
m=a[i];
for (j=i;j>0;j--)
a[j]=a[j-1];
a[0]=m;
}
}
for (i=0;i<num;i++)
{
for (j=i+1;j<num;j++)
{
if (a[i].age<=a[j].age)
{
k=a[i];
a[i]=a[j];
a[j]=k;
}
}
}
for (i=0;i<n;i++)
printf("%s\n",a[i].id);
return 0;
} |
9 | 4269 |
struct patient {
int order;
int age;
char id[10];
};
int cmp(const void *a, const void *b) {
const struct patient *pa = (const struct patient *) a;
const struct patient *pb = (const struct patient *) b;
if ((pa->age >= 60) && (pb->age < 60)) {
return -1;
}
else if ((pa->age < 60) && (pb->age >= 60)) {
return 1;
}
else if ((pa->age >= 60) && (pa->age != pb->age)) {
return pb->age - pa->age;
}
else {
return pa->order - pb->order;
}
}
int main() {
int i, num;
struct patient pat[100];
scanf("%d", &num);
for (i = 0; i < num; ++i) {
pat[i].order = i;
scanf("%s %d", pat[i].id, &(pat[i].age));
}
qsort(pat, num, sizeof(struct patient), cmp);
for (i = 0; i < num; ++i) {
printf("%s\n", pat[i].id);
}
}
|
9 | 4270 | int main()
{
int x[100],y[100],z[100],a,b=1,c=1,d=1,e=1,f,g,h,j,k,n;
char o[100][10],p[100][10],q[100][10],r[100][10];
scanf("%d",&n);
for(a=1;a<=n;a++)
{
scanf("%s",o[a]);
scanf("%d",&x[a]);
if(x[a]>=60)
{
strcpy(p[b],o[a]);
b++;
y[c]=x[a];
c++;
}
else
{
strcpy(q[d],o[a]);
d++;
z[e]=x[a];
e++;
}
}
for(f=1;f<=b-2;f++)
{
for(g=1;g<=b-2;g++)
{
if(y[g]<y[g+1])
{
h=y[g];
y[g]=y[g+1];
y[g+1]=h;
strcpy(r[1],p[g]);
strcpy(p[g],p[g+1]);
strcpy(p[g+1],r[1]);
}
}
}
for(j=1;j<=b-1;j++)
{
printf("%s\n",p[j]);
}
for(k=1;k<=d-1;k++)
{
printf("%s\n",q[k]);
}
return 0;
} |
9 | 4271 |
struct student
{
char num[200];
int sum;
struct student *next;
};
void main()
{
int n,i;
struct student *p1,*p2,*p3,*head;
scanf("%d",&n);
for (i=0;i<n;i++)
{
p2=(struct student*)malloc(sizeof(struct student));
if(i==0)
{head=p2;p3=head;}
scanf("%s %d",p2->num,&p2->sum);
p2->next=NULL;
if(p2->sum>=60){
if(i==1){
if(head->sum>=p2->sum){
head->next=p2;
p2->next=NULL;p3=p2;
}
else{p1=head;
p2->next=head;
head=p2;
}
}
if(i>1){
for(p1=head;p1->next!=NULL;p1=p1->next){
if(p1->sum>=p2->sum&&(p1->next->sum)<p2->sum){
p2->next=p1->next;
p1->next=p2;
break;
}
}
if(p2->next==NULL){
if(p2->sum>head->sum){
p2->next=head;
head=p2;
}
if(p2->sum<p1->sum){
p2->next=NULL;p3=p2;
p1->next=p2;
}
}
}
}
else{
if(i!=0){
p2->next=NULL;
p3->next=p2;p3=p2;}
}
}
p1=head;
for (i=0;(i<n&&p1!=NULL);i++)
{
printf("%s\n",p1->num);
p1=p1->next;
}
} |
9 | 4272 |
int main()
{
int n,i,j,h=0,k=1,b=0;
char a[120][20],c[120][20];
int y[120],Z[155][100]={0},cy[120];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d",a[i],&y[i]);
}
for(i=60;i<=150;i++)
{
for(j=1;j<=n;j++)
{
Z[i][h]=0;
if(i==y[j])
{
Z[i][h]=j;
h++;
}
}
h=0;
}
for(i=1;i<=n;i++)
{
if(y[i]<60)
{
strcpy(c[k],a[i]);
cy[k]=y[i];
b=k;
k++;
}
}
h=0;
for(i=150;i>=60;i--)
{
for(h=0;h<=10;h++)
{
if(Z[i][h]==0) break;
else
{
printf("%s\n",a[Z[i][h]]);
}
}
}
for(i=1;i<=b;i++)
{
printf("%s\n",c[i]);
}
return 0;
}
|
9 | 4273 | struct a
{int year;
char id[10];
struct a *next;
};
struct a *create(int n)
{struct a *p1,*p2,*head;
int i;
p1=(struct a*)malloc(len);
scanf("%s%d",p1->id,&p1->year);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<n;i++)
{p1=(struct a*)malloc(len);
scanf("%s%d",p1->id,&p1->year);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return head;
}
void main()
{
struct a *head,*p,*q,*t[100];
int m,i,j=0,k;
scanf("%d",&m);
head=create(m);
p=head;
for(i=0;i<m;i++)
{if(p->year>=60){t[j]=p;j++;}
p=p->next;
}
for(k=0;k<j-1;k++)
for(i=0;i<j-1-k;i++)
if(t[i]->year<t[i+1]->year)
{p=t[i];
t[i]=t[i+1];
t[i+1]=p;
}
for(i=0;i<j;i++)
printf("%s\n",t[i]->id);
p=head;
j=0;
for(i=0;i<m;i++)
{if(p->year<60){t[j]=p;j++;}
p=p->next;
}
for(i=0;i<j;i++)
printf("%s\n",t[i]->id);
}
|
9 | 4274 | struct bingren{
char id[1000];
int age;
}bin[101];
int main(int argc, char* argv[])
{ int n;
scanf("%d",&n);
int i,j,k=0,l=0,e,a[100];
char xiao[101][1000],da[101][1000],c[1000];
for(i=0;i<n;i++){
scanf("%s %d",&bin[i].id,&bin[i].age);
}
for(i=0;i<n;i++){
if(bin[i].age<60){
strcpy(xiao[k],bin[i].id);
k++;}
else {
strcpy(da[l],bin[i].id);
a[l]=bin[i].age;
l++;}
}
for(i=0;i<l;i++){
for(j=0;j<l-i;j++){
if(a[j]<a[j+1]){
strcpy(c,da[j+1]);
strcpy(da[j+1],da[j]);
strcpy(da[j],c);
e=a[j+1];a[j+1]=a[j];a[j]=e;
}
}
}
for(i=0;i<l;i++){
printf("%s\n",da[i]);
}
for(i=0;i<k;i++){
printf("%s\n",xiao[i]);
}
return 0;
}
|
9 | 4275 | struct bin
{
char num[10];
int age;
}t,b[100],c[100],a[100];
void main()
{
int n,i,j=0,k=0,p,q;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",a[i].num,&a[i].age);
if(a[i].age>=60)
{
b[j]=a[i];
j++;
}
p=j;
if(a[i].age<60)
{
c[k]=a[i];
k++;
}
q=k;
}
for(j=1;j<p;j++)
for(i=0;i<p-j;i++)
{
if(b[i].age<b[i+1].age)
{
t=b[i];
b[i]=b[i+1];
b[i+1]=t;
}
}
for(i=0;i<p;i++)
printf("%s\n",b[i].num);
for(i=0;i<q;i++)
printf("%s\n",c[i].num);
} |
9 | 4276 |
int main()
{
int n,age[100],i,j;
char id[100][11],str[11];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",id[i],&age[i]);
}
for(i=110;i>=60;i--)
{
for(j=0;j<n;j++)
{
if(age[j]==i)
{
printf("%s\n",id[j]);
age[j]=0;
}
}
}
for(i=0;i<n;i++)
{
if(age[i]!=0)
printf("%s\n",id[i]);
}
return 0;
}
|
9 | 4277 |
struct peo{
char id[11];
int age;
};
int main(){
struct peo people[100];
struct peo sixty[100];
int n,b=0,i,j,k,e;
char a[11];
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].age=people[i].age;
strcpy(sixty[i].id,people[i].id);
b+=1;
}else{
strcpy(sixty[i].id,"0000");
sixty[i].age=0;
}
}
for(k=0;k<n-1;k++){
for(i=n-1;i>k;i--){
if(sixty[i-1].age<sixty[i].age){
e=sixty[i-1].age;
sixty[i-1].age=sixty[i].age;
sixty[i].age=e;
strcpy(a,sixty[i-1].id);
strcpy(sixty[i-1].id,sixty[i].id);
strcpy(sixty[i].id,a);
}
}
}
for(i=0;i<b;i++){
printf("%s\n",sixty[i].id);
}
for(i=0;i<n;i++){
if(people[i].age<60){
printf("%s\n",people[i].id);
}
}
return 0;
}
|
9 | 4278 | typedef struct {
char id[20];
int age;
} patient;
int main()
{
patient a[100],b[100],c[100],temp;
int n,i,j,k=0,l=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",a[i].id,&a[i].age);
if(a[i].age>=60)
{for(j=0;j<20;j++)
{b[k].id[j]=a[i].id[j];
b[k].age=a[i].age;}k++;}
else {for(j=0;j<20;j++)
{c[l].id[j]=a[i].id[j];}l++;}
}
for(i=k-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(b[j].age<b[j+1].age)
{
temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
}
}
}
for(i=0;i<k;i++)
printf("%s\n",b[i].id);
for(i=0;i<l;i++)
printf("%s\n",c[i].id);
} |
9 | 4279 | 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 | 4280 | struct patient
{
char num[10];
int age;
}pat[100];
int main()
{
int n,i,m,k,f,j;
char e[10];
m=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",&pat[i].num,&pat[i].age);
if(pat[i].age>=60){
strcpy(e,pat[i].num);
f=pat[i].age;
for(k=i;k>m;k--){
strcpy(pat[k].num,pat[k-1].num);
}strcpy(pat[m].num,e);
pat[m].age=f;
m++;
}
}for(i=0;i<m;i++){
for(k=0;k<i;k++){
if(pat[i].age>pat[k].age){
f=pat[i].age;
strcpy(e,pat[i].num);
for(j=i;j>k;j--){
pat[j].age=pat[j-1].age;
strcpy(pat[j].num,pat[j-1].num);
}pat[k].age=f;
strcpy(pat[k].num,e);
}
}
}
for(i=0;i<n;i++){
printf("%s\n",pat[i].num);
}
return 0;
} |
9 | 4281 |
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 | 4282 | 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 | 4283 |
struct staff
{
char id[20];
int age;
struct staff*next;
};
void main()
{
int n,k=0,max=59;
struct staff*head,*p,*q,*pre;
scanf("%d",&n);
struct staff *p1,*p2;
p1=(struct staff*)malloc(LEN);
scanf("%s %d",p1->id,&p1->age);
head=p2=p1;
if(p1->age>=60) k++;
while(n-1)
{
n--;
p1=(struct staff *)malloc(LEN);
scanf("%s %d",p1->id,&p1->age);
if(p1->age>=60) k++;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
//printf("<%d>",k);
while(k)
{
p=head;
k--;
while(p)
{
if(p->age>max)
{
max=p->age;
q=p;
}
p=p->next;
}
printf("%s\n",q->id);
if(q==head)
{
head=q->next;
free(q);
}
else
{
if(q->next==NULL)
{
p=head;
while(p)
{
pre=p;
p=p->next;
if(p==q)
{
free(q);
pre->next=NULL;
break;
}
}
}
else
{
p=head;
while(p)
{
pre=p;
p=p->next;
if(p==q)
{
p=p->next;
pre->next=p;
free(q);
break;
}
}
}
}
max=59;
}
p=head;
while(p)
{
printf("%s\n",p->id);
p=p->next;
}
}
|
9 | 4284 | struct pat
{
char num[10];
int age;
struct pat *next;
};
struct pat *creat(int n)
{
struct pat *p1,*p2,*head;
int i;
p2=head=p1=(struct pat *)malloc(sizeof(struct pat));
for(i=0;i<n;i++)
{
scanf("%s %d",p1->num,&p1->age);
if(i==0)
head=p1;
p2->next=p1;
p2=p1;
p1=(struct pat *)malloc(sizeof(struct pat));
}
p2=NULL;
return head;
}
void array(struct pat *head,int n)
{
int i,j,ta;
char str[10];
struct pat *p1,*p2;
p1=head;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
p2=p1;
p1=p1->next;
if((p1->age)>(p2->age)&&(p1->age)>=60)
{
strcpy(str,p2->num);
strcpy(p2->num,p1->num);
strcpy(p1->num,str);
ta=p1->age;
p1->age=p2->age;
p2->age=ta;
}
}
p1=head;
}
}
void main()
{
int n;
scanf("%d",&n);
struct pat *p;
p=creat(n);
array(p,n);
int i;
for(i=0;i<n;i++)
{
printf("%s\n",p->num);
p=p->next;
}
}
|
9 | 4285 | int main()
{
int n;
scanf("%d",&n);
char a[n][100];
int b[n],i,j,c[n],d[n],k;
for(i=0;i<n;i++)
scanf("%s%d",a[i],&b[i]);
for(i=0;i<n;i++)
{
c[i]=0;
d[i]=n;
for(j=0;j<n;j++)
{
if(b[j]>=60&&b[j]>c[i])
{
for(k=0;k<i;k++)
{
if(j==d[k])
break;
}
if(k==i)
{
c[i]=b[j];
d[i]=j;
}
}
}
if(d[i]!=n&&b[d[i]]>=60)
printf("%s\n",a[d[i]]);
}
for(i=0;i<n;i++)
{
if(b[i]<60)
printf("%s\n",a[i]);
}
getchar();
getchar();
}
|
9 | 4286 | struct bing
{
char a[10];
int age;
};
struct bing bing[1000];
int main()
{
int n,i,j=1,v=1,k,t[1000],m,p[1000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%d",&bing[i].a,&bing[i].age);
if(bing[i].age>=60)
{
t[j]=i;
j++;
}
else
{
p[v]=i;
v++;
}
}
j--;
v--;
if(j!=0)
{
for(i=1;i<j;i++)
for(k=1;k<j-i+1;k++)
if(bing[t[k]].age<bing[t[k+1]].age)
{
m=t[k];
t[k]=t[k+1];
t[k+1]=m;
}
}
for(i=1;i<=j;i++)
printf("%s\n",bing[t[i]].a);
for(i=1;i<=v;i++)
printf("%s\n",bing[p[i]].a);
getchar();
getchar();
getchar();
}
|
9 | 4287 | int main()
{
int n,i,j,k,f,g,t;
scanf("%d",&n);
int p[n],e[n],d[n];
char a[n][100],b[n][100],c[n][100],s[100];
for(i=0;i<n;i++)
{
scanf("%s %d",a[i],&p[i]);
}
j=0,k=0;
for(i=0;i<n;i++)
{
if(p[i]>=60)
{
e[j]=p[i];
strcpy(b[j],a[i]);
j++;
}
else
{
strcpy(c[k],a[i]);
k++;
}
}
for(f=0;f<j-1;f++)
{
for(g=0;g<j-1-f;g++)
{
if(e[g]<e[g+1])
{
t=e[g+1];
e[g+1]=e[g];
e[g]=t;
strcpy(s,b[g+1]);
strcpy(b[g+1],b[g]);
strcpy(b[g],s);
}
}
}
for(i=0;i<j;i++)
{printf("%s\n",b[i]);}
for(i=0;i<k;i++)
{printf("%s\n",c[i]);}
getchar();
getchar();
}
|
9 | 4288 | struct person
{
int age;
char num[10];
}pat[100],old[100],you[100],exchange;
int main()
{
int n,i,p,q,result;
int k=0,t=0;
int temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",pat[i].num);
scanf("%d",&pat[i].age);
if(pat[i].age>=60)
{
old[k].age=pat[i].age;
strcpy(old[k].num,pat[i].num);
k++;
}
else
{
strcpy(you[t].num,pat[i].num);
t++;
}
}
for(p=0;p<k;p++)
{
for(q=0;q<k-p;q++)
{
if(old[q].age<old[q+1].age)
{
exchange.age=old[q].age;
old[q].age=old[q+1].age;
old[q+1].age=exchange.age;
strcpy(exchange.num,old[q].num);
strcpy(old[q].num,old[q+1].num);
strcpy(old[q+1].num,exchange.num);
}
}
}
for(result=0;result<k;result++)
{
printf("%s\n",old[result].num);
}
for(result=0;result<t;result++)
{
printf("%s\n",you[result].num);
}
return 0;
}
|
9 | 4289 | struct
{
char id[11];
int nianling;
}bing[100];
int main()
{
int n,i,j,e;
int youxian[100]={0};
int zhengchang[100]={0};
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%s %d", bing[i].id,&bing[i].nianling);
if(bing[i].nianling>=60) youxian[i]=bing[i].nianling;
else zhengchang[i]=bing[i].nianling;
}
for(i=1;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(youxian[j]<youxian[j+1])
{
e=youxian[j+1];
youxian[j+1]=youxian[j];
youxian[j]=e;
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(bing[j].nianling==youxian[i])
{
printf("%s\n", bing[j].id);
bing[j].nianling=-1;
break;
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(bing[j].nianling==zhengchang[i])
{
printf("%s\n", bing[j].id);
bing[j].nianling=-1;
break;
}
}
}
return 0;
}
|
9 | 4290 |
//#include <math.h>
int main()
{
int n;
scanf("%d",&n);
struct pe{
char id[100];
int y;
}*p;
p=(struct pe *)malloc(sizeof(pe)*n);
int i,j;
for(i=0;i<n;i++){
scanf("%s %d",(p+i)->id,&(p+i)->y);
}
struct pe tp;
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if((p+j+1)->y>=60 && (p+j)->y<(p+j+1)->y){
tp=p[j+1];
p[j+1]=p[j];
p[j]=tp;
}
}
}
for(i=0;i<n;i++){
printf("%s\n",(p+i)->id);
}
return 0;
}
|
9 | 4291 | main()
{
int n,age[100],a[100],k=0,count=0,c[100],i,j;
char ID[100][100],id[100][100],string[100];
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%s %d",ID[i],&age[i]);
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
a[k]=age[i];
strcpy(id[k],ID[i]);
count++;
c[k]=k;
k++;
}
}
for(k=0;k<count;k++)
{
for(int j=k+1;j<count;j++)
{
if(a[k]<a[j])
{
int t=a[j];
a[j]=a[k];
a[k]=t;
strcpy(string,id[k]);
strcpy(id[k],id[j]);
strcpy(id[j],string);
int p=c[k];
c[k]=c[j];
c[j]=p;
}
}
}
for(k=0;k<count;k++)
{
for(int j=k+1;j<count;j++)
{
if(a[k]==a[j])
{
if(c[k]>c[j])
{
int t=a[j];
a[j]=a[k];
a[k]=t;
strcpy(string,id[k]);
strcpy(id[k],id[j]);
strcpy(id[j],string);
int p=c[k];
c[k]=c[j];
c[j]=p;
}
}
}
}
for(k=0;k<count;k++)
printf("%s\n",id[k]);
for(i=0;i<n;i++)
{
if(age[i]<60)
printf("%s\n",ID[i]);
}
getchar();
getchar();
}
|
9 | 4292 |
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 | 4293 | int main(){
int n,i;
int age[100],a,m=0,tmp1[100],d=0;
char zfc[100][11],tmp2[100][11];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",zfc[i]);
scanf("%d",&age[i]);
}
for(i=0;i<n;i++){
if(age[i]>=60){
strcpy(tmp2[m],zfc[i]);
tmp1[m]=age[i];
m++;
}
}
for(a=m-1;a>0;a--){
for(d=0;d<a;d++){
if(tmp1[d]<tmp1[d+1]){
char s[200];
strcpy(s,tmp2[d]);
strcpy(tmp2[d],tmp2[d+1]);
strcpy(tmp2[d+1],s);
int y;
y=tmp1[d];
tmp1[d]=tmp1[d+1];
tmp1[d+1]=y;
}
}
}
for(a=0;a<m;a++){
printf("%s\n",tmp2[a]);
}
for(i=0;i<n;i++){
if(age[i]<60){
printf("%s\n",zfc[i]);
}
}
return 0;
} |
9 | 4294 | int max(int a[],int n)
{ int i,s;
for(i=1,s=a[1];i<n;i++)
s=(s>=a[i])?s:a[i];
return (s);
}
main()
{ int a[200]={0},i,n,c[200]={0},e,t=1;
char b[200][12];
scanf("%d",&n);
for(i=1;i<=n;i++)
{ scanf("%s%d",b[i],&e);
if(e>=60)
a[i]=e;
else
c[i]=e;
}
for(;;)
{ t=max(a,n) ;
if (t==0)
break;
for(i=1;i<=n;i++)
{
if(a[i]==t)
{ printf("%s\n",b[i]);
a[i]=0;
}
}
}
for(i=1;i<=n;i++)
if(c[i]!=0)
printf("%s\n",b[i]);
}
|
9 | 4295 |
int main (){
int a[100],e[100],f[100];
char c[100][100],b[100][100],d[100][100],x[100];
int n,p=-1,q=-1,k,z,i;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s %d",c[i],&a[i]);
if(a[i]>=60){
p++;
e[p]=a[i];
strcpy(b[p],c[i]);
}
if(a[i]<60){
q++;
f[q]=a[i];
strcpy(d[q],c[i]);
}
}
for (k=1;k<=p+1;k++){
for (i=0;i<p+1-k;i++){
if(e[i]<e[i+1]){
z=e[i];
e[i]=e[i+1];
e[i+1]=z;
strcpy( x,b[i]);
strcpy( b[i],b[i+1]);
strcpy( b[i+1],x);
}
}
}
for(i=0;i<=p;i++){
printf("%s\n",b[i]);
}
for(i=0;i<=q;i++){
printf("%s\n",d[i]);
}
return 0;
} |
9 | 4296 | struct patient
{
char ID[11]; //?????
int age;
}pa[100]; //?????
int main(int argc, char* argv[])
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pa[i].ID,&pa[i].age);
} //??100?????
struct patient old[100];//????????????60??
int count=0;
for(i=0;i<n;i++)
{
if(pa[i].age>=60)
{
strcpy(old[count].ID,pa[i].ID);
old[count].age=pa[i].age;
count++;
pa[i].age=0;
}
}
int k,j,e;
char ex[11];
for(k=1;k<count;k++)
{
for(j=0;j<count-k;j++)
{
if(old[j].age<old[j+1].age)
{
e=old[j+1].age;
old[j+1].age=old[j].age;
old[j].age=e;
strcpy(ex,old[j].ID);
strcpy(old[j].ID,old[j+1].ID);
strcpy(old[j+1].ID,ex);
}
}
}
for(i=0;i<count;i++)
{
printf("%s\n",old[i].ID);
}
for(i=0;i<n;i++)
{
if(pa[i].age!=0)
{
printf("%s\n",pa[i].ID);
}
}
return 0;
} |
9 | 4297 | 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 | 4298 | int main()
{
int n,i,j,temp;
char t[10];
scanf("%d",&n);
int y[n];
char id[n][10];
for (i=0;i<n;i++)
scanf("%s %d",id[i],&y[i]);
for (i=1;i<n;i++)
{
if (y[i]>=60)
{ for (j=i;j>0;j--)
if (y[j-1]<y[j])
{
temp=y[j];
y[j]=y[j-1];
y[j-1]=temp;
strcpy(t,id[j]);
strcpy(id[j],id[j-1]);
strcpy(id[j-1],t);
}
}
}
for (i=0;i<n;i++)
printf("%s\n",id[i]);
}
|
9 | 4299 | struct person
{
char id[20];
int y;
};
void main()
{
int n,i,j,m=0,k=0,z;
struct person t,*s,*o,*y;
scanf("%d",&n);
s=(struct person *)malloc(n*sizeof(struct person));
o=(struct person *)malloc(n*sizeof(struct person));
y=(struct person *)malloc(n*sizeof(struct person));
for(i=0;i<n;i++)
{scanf("%s %d",(*(s+i)).id,&(*(s+i)).y);
if ((*(s+i)).y>=60) {*(o+k)=*(s+i);k++;}
else {*(y+m)=*(s+i);m++;}
}
for(i=0;i<k;i++)
{for(j=k-1;j>i;j--)
if (o[j].y>o[j-1].y) {t=o[j];o[j]=o[j-1];o[j-1]=t;}
printf("%s\n",(*(o+i)).id);
}
for(i=0;i<m;i++)
printf("%s\n",(*(y+i)).id);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.