label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
9 | 4400 |
int num,n=0;
struct pa
{
char id[10];
int age;
int o;
}*p;
int operate()
{
struct pa *pi,*pj;
int agem=0,om=0;
for(pi=p;pi<p+num;pi++)
{
if(pi->o==0)
continue;
for(pj=p;pj<p+num;pj++)
{
if(pj->age<pi->age)
pi->o++;
}
if(pi->o>om)
om=pi->o;
}
return om;
}
void print(int om)
{
int k;
struct pa *pi;
for(k=om;k>=0;k--)
for(pi=p;pi<p+num;pi++)
{
if(pi->o==k)
{
if(n==0)
{
printf("%s",pi->id);
n++;
}
else
printf("\n%s",pi->id);
}
}
}
main()
{
scanf("%d",&num);
struct pa *pi;
int om;
p=(struct pa*)malloc(num*sizeof(struct pa));
for(pi=p;pi<p+num;pi++)
{
scanf("%s %d",pi->id,&pi->age);
if(pi->age>=60)
pi->o=1;
else pi->o=0;
}
om=operate();
print(om);
} |
9 | 4401 |
struct Ill {
char a[10];
int age;
};
int main()
{
int n, i, k;
int m,l = 0;
int j = 0;
struct Ill illMan[100], illOld[100], temp,illOld1[100];
scanf("%d",&n);
for (i = 0; i < n; i++) {
scanf("%s %d",illMan[i].a,&illMan[i].age);
}
for (i = 0; i < n; i++) {
if (illMan[i].age >= 60) {
illOld1[j] = illMan[i];
j++;
}
}
for (i = 0; i < j; i++) {
m = 0;
for (k = 0; k < j; k++) {
if (m < illOld1[k].age) {
m = illOld1[k].age;
}
}
for (k = 0; k < j; k++) {
if (illOld1[k].age == m) {
illOld[l] = illOld1[k];
illOld1[k].age = 0;
l++;
break;
}
}
}
for (i = 0; i < j; i++) {
printf("%s\n",illOld[i].a);
}
for (i = 0; i < n; i++) {
if (illMan[i].age < 60) {
printf("%s\n",illMan[i].a);
}
}
return 0;
} |
9 | 4402 | int main()
{
int n,i,a[100],j=0,c[100],z,r;
char s[100][10],b[100][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",s[i],&a[i]);
if(a[i]>=60){
c[j]=a[i];
strcpy(b[j],s[i]);
j++;
}
}
for(z=j-1;z>0;z--)
{
for(r=0;r<z;r++)
{
if(c[r]<c[r+1]){
int tep;
char m[10];
tep=c[r+1];
c[r+1]=c[r];
c[r]=tep;
strcpy(m,b[r]);
strcpy(b[r],b[r+1]);
strcpy(b[r+1],m);
}
}
}
for(i=0;i<j;i++)
{
printf("%s\n",b[i]);
}
for(i=0;i<n;i++)
{
if(a[i]<60){
printf("%s\n",s[i]);
}
}
return 0;
} |
9 | 4403 | struct sick
{
char num[10];
int age;
};
int main()
{
int i,j,n;
int s;
char swap[10];
struct sick all[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&all[i].num);
scanf("%d",&all[i].age);
}
for(i=1;i<n;i++){
for(j=i;j>0;j--){
if(all[j].age>=60&&all[j].age>all[j-1].age){
s=all[j].age;
all[j].age=all[j-1].age;
all[j-1].age=s;
strcpy(swap,all[j].num);
strcpy(all[j].num,all[j-1].num);
strcpy(all[j-1].num,swap);
}
else{
break;
}
}
}
for(i=0;i<n;i++){
puts(all[i].num);
}
return 0;
}
|
9 | 4404 | int main(){
int n;
scanf("%d",&n);
char id[100][10];
int age[100];
int oldno=0;
int xu[100];
char shunxu[100][10];
for(int i=0;i<n;i++){
scanf("%s %d",id[i],&age[i]);
}
for(int j=0;j<n;j++){
if(age[j]>=60){
xu[oldno]=age[j];
strcpy(shunxu[oldno],id[j]);
oldno++;
}
}
int num=oldno;
int e;
char tem[10];
for(int k=0;k<n;k++){
if(age[k]<60){
xu[oldno]=age[k];
strcpy(shunxu[oldno],id[k]);
oldno++;
}
}
for(int x=1;x<=num;x++){
for(int y=0;y<num-x;y++){
if(xu[y]<xu[y+1]){
e=xu[y];
xu[y]=xu[y+1];
xu[y+1]=e;
strcpy(tem,shunxu[y]);
strcpy(shunxu[y],shunxu[y+1]);
strcpy(shunxu[y+1],tem);
}
}
}
for(int z=0;z<n;z++){
printf("%s\n",shunxu[z]);
}
return 0;
} |
9 | 4405 | int main()
{
struct patient
{
char a[10];
int age;
}pat[100];
int n,i,m,b[100],l=0,p,q=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",pat[i].a,&pat[i].age);
}
for(i=0;i<n;i++)
{
if(pat[i].age>=60)
{
l=l+1;
b[l]=pat[i].age;
}
}
for(i=1;i<=l;i++)
{
for(m=i+1;m<=l;m++)
if(b[i]<b[m])
{
p=b[i];
b[i]=b[m];
b[m]=p;
}
}
for(i=1;i<=l;i++)
{
for(m=1;m<=l;m++)
{
if(b[i]==b[m])
{
if(i!=m)b[m]=0;
}
}
}
for(i=1;i<=l;i++)
{
for(m=0;m<n;m++)
if(pat[m].age==b[i])printf("%s\n",pat[m].a);
}
for(i=0;i<n;i++)
if(pat[i].age<60)printf("%s\n",pat[i].a);
return 0;
} |
9 | 4406 | struct patient
{
char id[10];
int age;
struct patient *next;
};
void sort(struct patient *head,struct patient *s)
{
struct patient *pre=head,*p=pre->next;
if(s->age>=60)
{
while(p!=NULL&&s->age<=p->age)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
else
{
while(pre->next!=NULL)pre=pre->next;
pre->next=s;
}
}
void main()
{
int n,i;
scanf("%d",&n);
struct patient *head,*p;
head=(struct patient*)malloc(LEN);
head->next=NULL;
for(i=0;i<n;i++)
{
p=(struct patient*)malloc(LEN);
scanf("%s %d",p->id,&p->age);
p->next=NULL;
sort(head,p);
}
p=head->next;
while(p!=NULL)
{
printf("%s\n",&p->id);
p=p->next;
}
} |
9 | 4407 |
struct patient
{
char id[10];
int age;
struct patient *next;
};
struct patient *sort(struct patient *head,char d[10],int a)
{
struct patient *pp,*p,*s;
p=head;
pp=p;
p=p->next;
s=(struct patient *)malloc(LEN);
strcpy(s->id,d);
s->age=a;
while(p!=NULL&&p->age>=a)
{
pp=p;
p=p->next;
}
s->next=p;
pp->next=s;
}
struct patient *creat(struct patient *hhead,char d[10],int a)
{
struct patient *p,*pp,*s;
p=hhead;
pp=p;
p=p->next;
while(p!=NULL)
{
pp=p;
p=p->next;
}
s=(struct patient*)malloc(LEN);
s->age=a;
strcpy(s->id,d);
s->next=p;
pp->next=s;
}
void main()
{
struct patient *head,*hhead,*p1,*p2;
int n,a,i;
char d[10];
scanf("%d",&n);
head=(struct patient*)malloc(LEN);
head->next=NULL;
hhead=(struct patient*)malloc(LEN);
hhead->next=NULL;
for(i=0;i<n;i++)
{
scanf("%s %d\n",d,&a);
if(a>=60)
sort(head,d,a);
else creat(hhead,d,a);
}
p1=head->next;
p2=hhead->next;
while(p1!=NULL)
{
printf("%s\n",p1->id);
p1=p1->next;
}
while(p2!=NULL)
{
printf("%s\n",p2->id);
p2=p2->next;
}
}
|
9 | 4408 | struct patient{
char id[10];
int age;
}pat[100],order[100],buffer[100],swap;
int main (){
int i,j=0,m=0,n,k,p,q;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf ("%s%d",pat[i].id,&pat[i].age);
}
for(i=0;i<n;i++){
if (pat[i].age>=60){
order[j]=pat[i];
j++;}
}
for(i=0;i<n;i++){
if (pat[i].age<60){
buffer[m]=pat[i];
m++;}
}
for(p=1;p<j;p++){
for(q=0;q<j-p;q++){
if (order[q].age<order[q+1].age){
swap=order[q+1];
order[q+1]=order[q];
order[q]=swap;
}
}
}
for(q=0;q<j;q++){
printf("%s",order[q].id);
printf ("\n");}
for(i=0;i<m;i++){
printf("%s",buffer[i].id);
printf("\n");}
}
|
9 | 4409 |
int main()
{
char str[100][100];//ID
int s1[100],sz[100],t[100];
int n,i,p,k;
scanf("%d",&n);//???
int j=0;
for(i=0;i<n;i++)
{
scanf("%s %d",str[i],&sz[i]);//id
if(sz[i]>=60)//panduannianling
{
t[j]=i;//cunrulingyishuzu
s1[j]=sz[i];
j++;
}//gongyou 'j' ren
}
for(k=1;k<=j;k++)//paixu
{
for(p=0;p<j-k;p++)
{
if(s1[p]<s1[p+1])//congdadaoxiao
{
int e,f;
e=s1[p+1];
s1[p+1]=s1[p];
s1[p]=e;
f=t[p+1];
t[p+1]=t[p];
t[p]=f;
}
}
}
for(p=0;p<j;p++)
{
printf("%s\n",str[t[p]]);
}
for(i=0;i<n;i++)
{
if(sz[i]<60)
printf("%s\n",str[i]);
}
return 0;
}
|
9 | 4410 | int main()
{
struct bingren
{
char num[10];
int age;
};
int n;
scanf("%d",&n);
struct bingren u[1000];
int i;
for(i=0;i<n;i++)
{
scanf("%s %d",&u[i].num,&u[i].age);
}
struct bingren v[1000];
int j=0;
for(i=0;i<n;i++)
{
if(u[i].age>59)
{v[j]=u[i];
j++;
}
}
int k;
struct bingren e;
for(k=1;k<j;k++)
{
for(i=0;i<j-k;i++)
{
if(v[i].age<v[i+1].age)
{
e=v[i+1];
v[i+1]=v[i];
v[i]=e;
}
}
}
for(i=0;i<j;i++)
{
printf("%s\n",v[i].num);
}
for(i=0;i<n;i++)
{if(u[i].age<60)
{printf("%s\n",u[i].num);}
}
return 0;
}
|
9 | 4411 | struct patient{
int num;
char hao[20];
int age;
struct patient *next;
};
struct ans{
int numan;
char haoan[20];
int agean;
struct ans *nextan;
};
void main()
{
struct patient *head,*p1,*p2;
struct ans *headan,*ans1,*ans2;
int i,j,max,n,shu;
shu=0;
scanf("%d",&n);
p1=(struct patient*)malloc(sizeof(struct patient));
scanf("%s %d",p1->hao,&p1->age);
p1->num=1;
head=p1;
p2=p1;
for(i=0;i<n-1;i++)
{
p1=(struct patient*)malloc(sizeof(struct patient));
scanf("%s %d",p1->hao,&p1->age);
p2->next=p1;
p1->num=i+2;
p2=p1;
}
p2->next=NULL;
max=0;
p1=head;
for(j=0;j<n;j++)
{
if(max<p1->age)max=p1->age;
p1=p1->next;
}
p1=head;
for(j=0;j<n;j++)
{
if(max==p1->age)
{
ans1=(struct ans*)malloc(sizeof(struct ans));
strcpy(ans1->haoan,p1->hao);
printf("%s\n",ans1->haoan);
ans1->agean=max;
headan=ans1;
ans2=ans1;
p1->num=-1;
p1->age=-1;
shu=shu+1;
break;
}
p1=p1->next;
}
for(i=0;i<n-1;i++)
{
max=0;
p1=head;
for(j=0;j<n;j++)
{
if(max<p1->age)max=p1->age;
p1=p1->next;
}
if(max<60)break;
p1=head;
for(j=0;j<n;j++)
{
if(max==p1->age)
{
ans1=(struct ans*)malloc(sizeof(struct ans));
strcpy(ans1->haoan,p1->hao);
printf("%s\n",ans1->haoan);
ans1->agean=max;
headan=ans1;
ans2=ans1;
p1->num=-1;
p1->age=-1;
shu=shu+1;
break;
}
p1=p1->next;
}
}
for(i=0;i<n-shu;i++)
{
max=101;
p1=head;
for(j=0;j<n;j++)
{
if(max>p1->num&&p1->num!=-1)max=p1->num;
p1=p1->next;
}
p1=head;
for(j=0;j<n;j++)
{
if(max==p1->num)
{
ans1=(struct ans*)malloc(sizeof(struct ans));
strcpy(ans1->haoan,p1->hao);
printf("%s\n",ans1->haoan);
ans1->numan=max;
headan=ans1;
ans2=ans1;
p1->num=-1;
p1->age=-1;
break;
}
p1=p1->next;
}
ans2->nextan=NULL;
}
} |
9 | 4412 |
int main()
{
int n,t;
char tc[16];
struct per
{
char id[16];
int a;
}a[100];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s %d",a[i].id,&a[i].a);
}
for(int j=n-1;j>0;j--)
{
for(int r=0;r<j;r++)
{
if(a[r].a>59&&a[r+1].a>59&&a[r].a<a[r+1].a)
{
strcpy(tc,a[r+1].id);
strcpy(a[r+1].id,a[r].id);
strcpy(a[r].id,tc);
t=a[r+1].a;
a[r+1].a=a[r].a;
a[r].a=t;
r=0;
}
if(a[r].a<=59&&a[r+1].a>59)
{
strcpy(tc,a[r+1].id);
strcpy(a[r+1].id,a[r].id);
strcpy(a[r].id,tc);
t=a[r+1].a;
a[r+1].a=a[r].a;
a[r].a=t;
r=0;
}
}
}
for(int f=0;f<n;f++)
{
printf("%s\n",a[f].id);
}
return 0;
}
|
9 | 4413 | int main(){
int n,i,j,b;
struct{
char hao[10];
int ni;
int pa;
}dk[100],t,p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",&(dk[i].hao),&(dk[i].ni));
}
for(i=0;i<n-1;i++){
for(j=0;j<n-i-1;j++){
if((dk[j].ni<60)&&(dk[j+1].ni>=60)){
t=dk[j];
dk[j]=dk[j+1];
dk[j+1]=t;
}
}
}
for(i=0;i<n-1;i++){
for(j=0;j<n-1-i;j++){
if((dk[j+1].ni>=60)&&(dk[j].ni>=60)&&(dk[j].ni<dk[j+1].ni)){
p=dk[j];
dk[j]=dk[j+1];
dk[j+1]=p;
}
}
}
b=strlen(dk[0].hao);
for(i=0;i<n;i++){
for(j=0;j<b;j++){
printf("%c",dk[i].hao[j]);
}
printf("\n");
}
return 0;
}
|
9 | 4414 | main()
{
int n,oversix=0,undersix=0,osix[100],usix[100],t;
char noosix[100][100]={0},nousix[100][100]={0},a[100][100]={0};
char s[100][100]={0};
scanf("%d",&n);
int b[100];
for(int i=0;i<n;i++)
{
scanf("%s %d",a[i],&b[i]);
}
for(int i=0;i<n;i++)
{
if(b[i]>=60)
{
oversix++;
osix[oversix-1]=b[i];
strcpy(noosix[oversix-1],a[i]);
}
else
{
undersix++;
usix[undersix-1]=b[i];
strcpy(nousix[undersix-1],a[i]);
}
}
for(int j=0;j<oversix-1;j++)
for(int i=0;i<oversix-1-j;i++)
if(osix[i]<osix[i+1])
{
t=osix[i];
strcpy(s[i],noosix[i]);
osix[i]=osix[i+1];
strcpy(noosix[i],noosix[i+1]);
osix[i+1]=t;
strcpy(noosix[i+1],s[i]);
}
for(int i=0;i<oversix;i++)
printf("%s\n",noosix[i]);
for(int i=0;i<undersix;i++)
printf("%s\n",nousix[i]);
getchar();
getchar();
}
|
9 | 4415 | void main()
{
struct br
{ char no[10];
int s;
}a[100],b[100],r;
int n,i,j,t=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{ scanf("%s %d",a[i].no,&a[i].s);
if (a[i].s>=60) { b[t]=a[i];t=t+1;}
}
for (i=0;i<t-1;i++)
for (j=0;j<t-1-i;j++)
if (b[j].s<b[j+1].s) {r=b[j];b[j]=b[j+1];b[j+1]=r;}
for (i=0;i<t;i++)
printf("%s\n",b[i].no);
for (i=0;i<n;i++)
if (a[i].s>=60) continue;
else printf("%s\n",a[i].no);
} |
9 | 4416 | void main()
{
int a[100],n,i,j,k=0,d[100],p;
char b[100][10],c[10],str[100][10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",str[i],&a[i]);
for(i=0;i<n;i++)
if(a[i]>=60)
{
d[k]=a[i];
strcpy(b[k],str[i]);
k++;
}
for(i=0;i<k;i++)
for(j=0;j<k-i-1;j++)
if(d[j]<d[j+1])
{
p=d[j+1];
d[j+1]=d[j];
d[j]=p;
strcpy(c,b[j+1]);
strcpy(b[j+1],b[j]);
strcpy(b[j],c);
}
for(i=0;i<k;i++)
printf("%s\n",b[i]);
for(i=0;i<n;i++)
if(a[i]<60)
printf("%s\n",str[i]);
} |
9 | 4417 | struct pati
{
char ID[10];
int age;
}p[100];
void main()
{
int i,j,n,p2[100]={0},p3[100]={0},t=0,r=0,tem;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",p[i].ID,&p[i].age);
if(p[i].age>=60)
{
p2[t]=p[i].age;
t++;
}
}
for(i=0;i<t-1;i++)
for(j=0;j<t-1-i;j++)
{
if(p2[j]<p2[j+1])
{
tem=p2[j+1];
p2[j+1]=p2[j];
p2[j]=tem;
}
}
for(i=0;i<t;i++)
{
if(i>0)
{
if(p2[i]!=p2[i-1])
{
p3[r]=p2[i];
r++;
}
}
else
{
p3[r]=p2[i];
r++;
}
}
t=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(p[j].age==p3[t])
{
printf("%s\n",p[j].ID);
}
}
t++;
}
for(i=0;i<n;i++)
if(p[i].age<60)
printf("%s\n",p[i].ID);
} |
9 | 4418 |
int main(){
int sixty[100];
int n,i,j,a;
struct patient{
char num[11];
int age;
}peo[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",peo[i].num,&peo[i].age);
if(peo[i].age>=60){
sixty[i]=peo[i].age;
}else{
sixty[i]=0;
}
}
for(j=0;j<n-1;j++){
for(i=n-1;i>j;i--){
if(sixty[i-1]<sixty[i]){
a=sixty[i-1];
sixty[i-1]=sixty[i];
sixty[i]=a;
}
}
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(sixty[i]==peo[j].age&&sixty[i]!=sixty[i-1]){ printf("%s\n",peo[j].num);
}
}
}
for(i=0;i<n;i++){
if(peo[i].age<60){
printf("%s\n",peo[i].num);
}
}
return 0;
} |
9 | 4419 | void main()
{
int i,j=0,s,t,k=0,n;
struct patient{
char ID[10];
int age;
};
struct patient p[100],d[100],c[100],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",p[i].ID,&p[i].age);
}
for(i=0;i<n;i++)
{
if(p[i].age>=60)
d[j++]=p[i];
else c[k++]=p[i];
}
s=j;
t=k;
for(i=1;i<s;i++)
{
for(j=0;j<s-i;j++)
{
if(d[j].age<d[j+1].age)
{
temp=d[j];
d[j]=d[j+1];
d[j+1]=temp;
}
}
}
for(i=0;i<s;i++)
{
printf("%s\n",d[i].ID);
}
for(i=0;i<t;i++)
printf("%s\n",c[i].ID);
}
|
9 | 4420 | main()
{
int n,i,j,f;
int k=0;
scanf("%d",&n);
char a[100][2000],e[11];
char d[100][2000];
int b[100];
int c[100];
for(i=0;i<=n-1;i++)
scanf("%s %d",a[i],&b[i]);
for(i=0;i<n;i++)
{
if(b[i]>=60)
{
c[k]=b[i];
strcpy(d[k],a[i]);
k++;
}
}
for(j=k-2;j>=0;j--)
{
for(i=j;i<=k-2;i++)
{
if(c[i]<c[i+1])
{
strcpy(e,d[i]);
strcpy(d[i],d[i+1]);
strcpy(d[i+1],e);
f=c[i];c[i]=c[i+1];c[i+1]=f;
}
}
}
for(i=0;i<k;i++)
printf("%s\n",d[i]);
k=0;
for(i=0;i<n;i++)
{
if(b[i]<60)
{
c[k]=b[i];
strcpy (d[k],a[i]);
k++;
}
}
for(i=0;i<k;i++)
printf("%s\n",d[i]) ;
}
|
9 | 4421 |
struct peo{
char id[11];
int age;
};
int main(){
struct peo people[100];
int sixty[100];
int n,b=0,i,j,k,e;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",people[i].id,&people[i].age);
if(people[i].age>=60){
sixty[i]=people[i].age;
b+=1;
}else{
sixty[i]=0;
}
}
for(k=0;k<n-1;k++){
for(i=n-1;i>k;i--){
if(sixty[i-1]<sixty[i]){
e=sixty[i-1];
sixty[i-1]=sixty[i];
sixty[i]=e;
}
}
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(sixty[i]==people[j].age&&sixty[i]!=sixty[i-1]){
printf("%s\n",people[j].id);
}
}
}
for(i=0;i<n;i++){
if(people[i].age<60){
printf("%s\n",people[i].id);
}
}
return 0;
} |
9 | 4422 | int main()
{
char id[100][10],id1[100][10],t[10];
int n,i,j,b,age[100],age1[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",id[i]);
scanf("%d",&age[i]);
strcpy(id1[i],id[i]);
age1[i]=age[i];
}
for(i=0;i<n-1;i++){
for(j=0;j<n-i-1;j++){
if(age1[j]<age1[j+1]){
b=age1[j];
age1[j]=age1[j+1];
age1[j+1]=b;
strcpy(t,id1[j]);
strcpy(id1[j],id1[j+1]);
strcpy(id1[j+1],t);
}
}
}
for(i=0;i<n;i++){
if(age1[i]>=60)
printf("%s\n",id1[i]);
}
for(i=0;i<n;i++){
if(age[i]<60)
printf("%s\n",id[i]);
}
return 0;
} |
9 | 4423 | struct h{
char name[11];
int age;
};
void main(){
int i,k,n;
scanf("%d",&n);
struct h p[100];
for(i=0;i<n;i++){
scanf("%s %d",p[i].name,&p[i].age);
}
for(k=100;k>59;k--){
for(i=0;i<n;i++){
if(k==p[i].age)
printf("%s\n",p[i].name);
}
}
for(i=0;i<n;i++){
if(p[i].age<60)
printf("%s\n",p[i].name);
}
} |
9 | 4424 | void main()
{
struct b
{
char id[10];
int age;
};
int n,i,j,k;
struct b a[100],temp,c[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&a[i].id,&a[i].age);
for(i=0,j=0;i<n;i++)
if(a[i].age>=60)
{
c[j]=a[i];
j++;
}
for(i=j-1;i>=1;i--)
for(k=j-1;k>j-i-1;k--)
if(c[k].age>c[k-1].age)
{
temp=c[k];
c[k]=c[k-1];
c[k-1]=temp;
}
for(i=0;i<j;i++)
printf("%s\n",c[i].id);
for(i=0;i<n;i++)
if(a[i].age<60)
printf("%s\n",a[i].id);
}
|
9 | 4425 | main()
{
char ID[N][L],IDup60[N][L],IDunder60[N][L],s[L];
int b,h,i,j,k,l,m,max=0,n,o,p,q,t=0,u=0,YearOld[N],YearOldup60[N],id[N],idup60[N];
scanf("%d",&n);
for(h=0;h<n;h++)
{
scanf("%s %d",ID[h],&YearOld[h]);
id[h]=0;
}
for(i=0;i<n;i++)
{
for(j=0;ID[i][j]!='\0';j++)
{
id[i]=10*id[i];
id[i]=id[i]+(ID[i][j]-'0');
}
}
for(m=0;m<n;m++)
{
if(YearOld[m]>max)
max=YearOld[m];
}
for(k=0;k<=max;k++)
{
for(l=0;l<n;l++)
{
if(YearOld[l]==max-k&&max-k>=60)
{
YearOldup60[t]=YearOld[l];
idup60[t]=id[l];
strcpy(IDup60[t],ID[l]);
t++;
}
}
}
for(b=0;b<n;b++)
{
if(YearOld[b]<60)
{
strcpy(IDunder60[u],ID[b]);
u++;
}
}
for(p=0;p<t;p++)
{
printf("%s\n",IDup60[p]);
}
for(q=0;q<u;q++)
{
printf("%s\n",IDunder60[q]);
}
} |
9 | 4426 | void main()
{
int n,i,j=0,k=0,m,a[100],b[100],c[100];
char p[100][30],q[100][30],r[100][30],s[1][30];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",r[i],&a[i]);
for(i=0;i<n;i++)
{
if(a[i]>=60)
{
strcpy(p[j],r[i]);
b[j]=a[i];
j++;
}
if(a[i]<60)
{
strcpy(q[k],r[i]);
c[k]=a[i];
k++;
}
}
for(k=0;k<j-1;k++)
{
for(i=0;i<j-k-1;i++)
if(b[i]<b[i+1])
{
m=b[i];
b[i]=b[i+1];
b[i+1]=m;
strcpy(s,p[i]);
strcpy(p[i],p[i+1]);
strcpy(p[i+1],s);
}
}
for(i=0;i<j;i++)
printf("%s\n",p[i]);
for(i=0;i<n-j;i++)
printf("%s\n",q[i]);
} |
9 | 4427 | struct patient{
char id[10];
int age;
};
int main(){
int j,max,t=1,n,i;
struct patient p[101];
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%s%d",p[i].id,&p[i].age);
for (;t!=0;){
max=59;t=0;
for (i=1;i<=n;i++){
if (p[i].age>max) {max=p[i].age; t=i;}
}
if (t!=0) printf("%s\n",p[t].id);
p[t].age=0;
}
for (i=1;i<=n;i++)
if (p[i].age!=0) printf("%s\n",p[i].id);
} |
9 | 4428 | void main()
{
struct p
{
char num[11];
int age;
};
struct p c[101];
int n,i,t=0,s,h,l=0;
int a[100],b[100],d[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",c[i].num,&c[i].age);
for(i=0;i<n;i++)
{
if(c[i].age>=60)
{
a[t]=c[i].age;
c[i].age=0;
b[t]=i;
t++;
}
}
if(t>0)
{
leap:
s=a[0];
h=0;
for(i=0;i<t;i++)
{
if(a[i]>s)
{
s=a[i];
h=i;
}
}
printf("%s\n",c[b[h]].num);
l++;
a[h]=0;
if(l<t)
goto leap;
}
for(i=0;i<n;i++)
{
if(c[i].age!=0)
printf("%s\n",c[i].num);
}
} |
9 | 4429 | struct info
{
int num;
char data[10];
struct info*next;
int tip;
};
struct info*create(int n)
{
struct info *p1,*pre,*p2,*head,*tail;
int i,t;
head=(struct info*)malloc(sizeof(struct info));
p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %d",p1->data,&p1->num);
head->next=p1;
p1->next=NULL;
tail=p1;
i=0;
while(i<n-1)
{
t=0;
p1=(struct info*)malloc(sizeof(struct info));
scanf("%s %d",p1->data,&p1->num);
p1->next=NULL;
if(p1->num>=60)
{
for(pre=head,p2=head->next;p2!=NULL&&p2->num>=60;pre=pre->next,p2=p2->next)
{
if(p2->num<p1->num)
{
pre->next=p1;
p1->next=p2;
t=1;
break;
}
}
if(t==0)
{
pre->next=p1;
p1->next=p2;
if(p2==NULL)
{tail=p1;}
}
}
else
{
tail->next=p1;
tail=p1;
}
i++;
}
return head;
}
void print(struct info *head)
{
struct info *p;
p=head->next;
while(p!=NULL)
{
printf("%s\n",p->data);
p=p->next;
}
}
int main()
{
int n;
struct info *head;
scanf("%d",&n);
head=create(n);
print(head);
}
|
9 | 4430 | struct people
{char id[10];
int age;
}p[100];
void main()
{
int n,i,a[100],b[100],j,k,m=0;
char str[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&p[i].id,&p[i].age);
for(i=0,j=0,k=0;i<n;i++)
{
if(p[i].age>=60)
{
a[j++]=i;
m++;
}
else b[k++]=i;
}
for(i=0;i<m-1;i++)
for(j=0;j<m-1-i;j++)
{
if(p[a[j]].age<p[a[j+1]].age)
{
int t=p[a[j]].age;
p[a[j]].age=p[a[j+1]].age;
p[a[j+1]].age=t;
strcpy(str,p[a[j]].id);
strcpy(p[a[j]].id,p[a[j+1]].id);
strcpy(p[a[j+1]].id,str);
}
}
if(m!=0)
{
printf("%s",p[a[0]].id);
for(i=1;i<m;i++)
printf("\n%s",p[a[i]].id);
for(i=0;i<n-m;i++)
printf("\n%s",p[b[i]].id);
}
else
{
printf("%s",p[b[0]].id);
for(i=1;i<n;i++)
printf("\n%s",p[b[i]].id);
}
}
|
9 | 4431 | struct patient
{
char num[11];
int age;
}sick[101];
int main()
{
int n,i,j,k,r,s;
s=0;
r=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",sick[i].num);
scanf("%d",&sick[i].age);
}
int old[101]={0};
int young[101]={0};
for(i=0;i<n;i++){
if(sick[i].age>=60){
for(j=0;j<=s;j++){
if(sick[i].age>sick[old[j]].age||j==s){
if(j==s){
old[s]=i;
s=s+1;
break;
}
else{
for(k=s;k>=j;k--){
old[k+1]=old[k];
}
old[j]=i;
s=s+1;
break;
}
}
}
}
else{
young[r]=i;
r=r+1;
}
}
for(i=0;i<s;i++){
printf("%s\n",sick[old[i]].num);
}
for(i=0;i<r;i++){
printf("%s\n",sick[young[i]].num);
}
return 0;
} |
9 | 4432 |
struct pt
{
char id[10];
int age;
};
void main()
{
int n,i,j,old;
struct pt p[100],o[100],tem;
char cao;
scanf("%d",&n);
scanf("%c",&cao);
old=0;
for(i=0;i<n;i++)
{
scanf("%s %d",p[i].id,&p[i].age);
if(p[i].age>=60) {o[old]=p[i];old++;}
}
for(i=0;i<old-1;i++)
{
for(j=0;j<old-1;j++)
{
if(o[j+1].age>o[j].age)
{
tem=o[j];
o[j]=o[j+1];
o[j+1]=tem;
}
}
}
for(i=0;i<old;i++) printf("%s\n",o[i].id);
for(i=0;i<n;i++)
{
if(p[i].age<60)
{
printf("%s\n",p[i].id);
}
}
} |
9 | 4433 | int main()
{
int n,i,j,a[100],e;
char s[100][100],str[100];
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%s %d",s[i],&a[i]);
}
for(j=1;j<n;j++){
for(i=0;i<n-j;i++){
if(a[i]>=60&&a[i+1]>=60){
if(a[i]>=a[i+1]){
continue;
}
if(a[i]<a[i+1]){
strcpy(str,s[i+1]);
strcpy(s[i+1],s[i]);
strcpy(s[i],str);
e=a[i+1];
a[i+1]=a[i];
a[i]=e;
}
}
if(a[i]>=60&&a[i+1]<60){
continue;
}
if(a[i]<60&&a[i+1]>=60){
strcpy(str,s[i+1]);
strcpy(s[i+1],s[i]);
strcpy(s[i],str);
e=a[i+1];
a[i+1]=a[i];
a[i]=e;
}
if(a[i]<60&&a[i+1]<60){
continue;
}
}
}
for(i=0;i<n;i++){
printf("%s\n",s[i]);
}
return 0;
}
|
9 | 4434 | int main()
{
int i,j,n,k,l,z;
int a[100],b[100],f[100];
char d[30],c[100][30],e[100][30];
scanf("%d",&n);
for(i=0,z=0;i<n;i++)
{
scanf("%s",c[i]);
scanf("%d",&a[i]);
if(a[i]>=60)
{b[z]=a[i];f[z]=z;strcpy(e[z],c[i]);a[i]=0;z++;}
}
for(i=0;i<z;i++)
{
for(j=i+1;j<z;j++)
{
if(b[j]>b[i])
{
strcpy(d,e[i]);strcpy(e[i],e[j]);strcpy(e[j],d);
k=b[i];b[i]=b[j];b[j]=k;
l=f[i];f[i]=f[j];f[j]=l;
}
if(b[i]==b[j])
{
if(f[i]>f[j])
{
strcpy(d,e[i]);strcpy(e[i],e[j]);strcpy(e[j],d);
k=b[i];b[i]=b[j];b[j]=k;
l=f[i];f[i]=f[j];f[j]=l;
}
}
}
}
for(i=0;i<z;i++)
printf("%s\n",e[i]);
for(i=0;i<n;i++)
{
if(a[i]!=0)
printf("%s\n",c[i]);
}
return 0;
} |
9 | 4435 | struct patient{
char num[20];
int age;
};
int main()
{
void bubble(struct patient a[],int len);
int n,i,old,sum,age,j;
struct patient a[100];
struct patient b[100];
char str[100]={'\0'};
char str1[100]={'\0'};
scanf("%d",&n);
for(i=0,j=0,sum=0;sum<=n;)
{
age=0;
strcpy(str,str1);
scanf("%s %d",str,&age);
if(age>=60){strcpy(a[i].num,str);a[i].age=age;i++;sum++;}
else{strcpy(b[j].num,str);b[j].age=age;j++;sum++;}
}
//printf("%d",i);
bubble(a,i);
old=i;
for(i=0;i<old;i++)
{
printf("%s\n",a[i].num);
}
for(i=0;i<j;i++)
{
printf("%s\n",b[i].num);
}
return 0;
}
void bubble(struct patient a[],int len)
{
int i,pass;
struct patient temp;//temp????????????
for(pass=1;pass<len;pass++)
{
for(i=0;i<len-pass;i++)
{
if(a[i].age<a[i+1].age)
{temp=a[i];a[i]=a[i+1];a[i+1]=temp;}
}
}
}
|
9 | 4436 | struct patient
{
char num[10];
int age;
} p[100];
void main()
{
int i,j=0,k=0,t,l,n;
char other[100][10],a[10];
struct patient old[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",p[i].num,&p[i].age);
for(i=0;i<n;i++)
{
if(p[i].age>=60)
{
strcpy(old[j].num,p[i].num);
old[j].age=p[i].age;
j++;
}
else
{
strcpy(other[k],p[i].num);
k++;
}
}
for(i=0;i<j-1;i++)
{
for(l=0;l<j-1-i;l++)
{
if(old[l].age<old[l+1].age)
{
t=old[l].age;
old[l].age=old[l+1].age;
old[l+1].age=t;
strcpy(a,old[l].num);
strcpy(old[l].num,old[l+1].num);
strcpy(old[l+1].num,a);
}
}
}
for(i=0;i<j;i++)
printf("%s\n",old[i].num);
for(i=0;i<k;i++)
printf("%s\n",other[i]);
}
|
9 | 4437 |
void main()
{
struct person
{
char id[10];
int age;
} m[100],b[100];
int n,t,i,j;
char temp[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",m[i].id);
strcpy(b[i].id,m[i].id);
scanf("%d",&m[i].age);
b[i].age=m[i].age;
}
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
{
if(m[j].age<m[j+1].age)
{
t=m[j].age;
m[j].age=m[j+1].age;
m[j+1].age=t;
strcpy(temp,m[j].id);
strcpy(m[j].id,m[j+1].id);
strcpy(m[j+1].id,temp);
}
}
for(i=0;i<n;i++)
if(m[i].age>=60) printf("%s\n",m[i].id);
for(i=0;i<n;i++)
if(b[i].age<60) printf("%s\n",b[i].id);
}
|
9 | 4438 | int main(){
struct ID{
char x[100];
int y;
}da[100],xiao[100],p[100],e;
int s,m=0,n=0;
scanf("%d\n",&s);
for(int i=0;i<s;i++){
scanf("%s %d",&(p[i].x),&(p[i].y));
if(p[i].y>=60){
da[m]=p[i];
m++;
}else{
xiao[n]=p[i];
n++;
}
}
for(int b=1;b<=m;b++){
for(int v=0;v<m-b;v++){
if(da[v].y<da[v+1].y){
e=da[v];
da[v]=da[v+1];
da[v+1]=e;
}
}
}
int h,f;
for(int z=0;z<m;z++){
f=strlen(da[z].x);
for(int g=0;g<f;g++){
if(g!=f-1){
printf("%c",da[z].x[g]);
}else{
printf("%c\n",da[z].x[g]);
}
}
}
for(int a=0;a<n;a++){
h=strlen(xiao[a].x);
for(int j=0;j<h;j++){
if(j!=h-1){
printf("%c",xiao[a].x[j]);
}else{
printf("%c\n",xiao[a].x[j]);
}
}
}
return 0;
}
|
9 | 4439 | struct st
{
char s[11];
int n;
struct st *next;
};
struct st *creat(int m)
{
struct st *head,*p1,*p2;
int i;
for(i=0;i<m;i++)
{
p1=(struct st *)malloc(len);
if(i==0)head=p1;
else p2->next=p1;
scanf("%s %d",p1->s,&p1->n);
p2=p1;
}
p2->next=NULL;
return(head);
}
void line(struct st *head,int m)
{
struct st *p,*p1,*p2;
p=head;
int i,j,t;
for(i=0;i<m;i++)
{
p1=p;
p2=p1->next;
for(j=1;j<m;j++)
{
char ss[11]={'\0'};
if(p1->n>=60)
{
if(p2->n>p1->n)
{
strcpy(ss,p1->s);
strcpy(p1->s,p2->s);
strcpy(p2->s,ss);
t=p1->n;
p1->n=p2->n;
p2->n=t;
}
}
else
{
if(p2->n>=60)
{
strcpy(ss,p1->s);
strcpy(p1->s,p2->s);
strcpy(p2->s,ss);
t=p1->n;
p1->n=p2->n;
p2->n=t;
}
}
p1=p1->next;
p2=p2->next;
}
}
for(i=0;i<m;i++)
{
printf("%s\n",p->s);
p=p->next;
}
}
void main()
{
struct st *p;
void line(struct st *head,int m);
struct st *creat(int m);
int m,i,j;
scanf("%d",&m);
p=creat(m);
line(p,m);
}
|
9 | 4440 | struct person
{
char ID[10];
int age;
} per[100];
int main()
{
int i,n,j,k=0,a[100]={0},num=0,temp1;
char b[100][10]={0},temp2[10]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",per[i].ID,&per[i].age);
for(i=0;i<n;i++)
{
if(per[i].age>=60)
{
a[k]=per[i].age;
strcpy(b[k],per[i].ID);
k++;
num++;
}
}
for(j=0;j<num;j++)
{
for(k=0;k<num-j;k++)
if(a[k]<a[k+1])
{
temp1=a[k];
a[k]=a[k+1];
a[k+1]=temp1;
strcpy(temp2,b[k]);
strcpy(b[k],b[k+1]);
strcpy(b[k+1],temp2);
}
}
for(i=0,k=num;i<n;i++)
{
if(per[i].age<60)
{a[k]=per[i].age;
strcpy(b[k],per[i].ID);
k++;
num++;}
}
for(k=0;k<num-1;k++)
printf("%s\n",b[k]);
printf("%s",b[num-1]);
}
|
9 | 4441 | int main()
{
int i,j,n,e;
char q[11];
struct point
{
char name[11];
int age;
}
p[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",&p[i].name,&p[i].age);
}
for(j=0;j<n;j++)
{
for(i=0;i<n-1;i++)
{
if((p[i].age>60||p[i].age==60)&&(p[i+1].age>60||p[i+1].age==60)&&p[i].age<p[i+1].age||p[i].age<60&&(p[i+1].age>60||p[i+1].age==60))
{
e=p[i].age;
p[i].age=p[i+1].age;
p[i+1].age=e;
strcpy(q,p[i].name);
strcpy(p[i].name,p[i+1].name);
strcpy(p[i+1].name,q);
}
}
}
for(i=0;i<n;i++)
{
printf("%s",p[i].name);
if(i!=n-1)
{
printf("\n");
}
}
return 0;
}
|
9 | 4442 | void main()
{
int n,i,d=0,q,j;
int b[101],f[101];
char a[101][10],c[101][10],e[101][10];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %d",a[i],&b[i]);
}
q=n-1;j=0;
for(i=n-1;i>=0;i--)
{
if (b[i]<60)
{
strcpy(c[q],a[i]);
q=q-1;
}
}
for (i=0;i<n;i++)
{
if (b[i]>=60)
{
strcpy(c[j],a[i]);
f[j]=b[i];
d=d+1;
j=j+1;
}
}
for (i=0;i<d;i++)
{
for (j=0;j<d-1;j++)
{
if (f[j]<f[j+1])
{
f[100]=f[j];
f[j]=f[j+1];
f[j+1]=f[100];
strcpy(c[100],c[j]);
strcpy(c[j],c[j+1]);
strcpy(c[1+j],c[100]);
}
}
}
for(i=0;i<n;i++)
printf("%s\n",c[i]);
} |
9 | 4443 | int main()
{
struct patient
{
int id[7];
int age;
}patient[100];
int i,n,max=0,k;
scanf("%d\n",&n);
for(i=0;i<n;i++)scanf("%s %d\n",patient[i].id,&patient[i].age);
for(i=0;i<n;i++)
{
if(patient[i].age>max)max=patient[i].age;
}
for(k=max;k>59;k--)
{
for(i=0;i<n;i++)if(patient[i].age==k)printf("%s\n",patient[i].id);
}
for(i=0;i<n;i++)
{
if(patient[i].age<60)printf("%s\n",patient[i].id);
}
} |
9 | 4444 | void main()
{
struct pa
{ char m[10];
int a;
};
struct pa p[100],t,s={"0",0},pp[100];
int n,i,j=0,m=0,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",&p[i].m,&p[i].a);
for(i=0;i<n;i++)
{if(p[i].a>=60)m++;}
for(j=0;j<m;j++)
{t=s;k=100;
for(i=0;i<n;i++)
{if(p[i].a>=60&&p[i].a>t.a){t=p[i];k=i;}}
pp[j]=t;p[k]=s;
}
for(i=0;i<n;i++)
if(p[i].a<60&&p[i].a>0){pp[j]=p[i];j++;}
for(i=0;i<n;i++)
printf("%s\n",pp[i].m);
} |
9 | 4445 | void main()
{
int n,i,j;
struct
{
char ID[10];
int a;
int p;
} s[100],t;
/* char ID[100][10];
int a[100];
int p[100];*/
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%d",s[i].ID,&s[i].a);
s[i].p=i;
}
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if( ((s[i].a<60)&&(s[j].a>=60)) || ((s[i].a>=60)&&(s[j].a>=60)&&(s[i].a<s[j].a)) || ((s[i].a>=60)&&(s[j].a>=60)&&(s[i].a==s[j].a)&&(s[i].p>s[j].p)) || ((s[i].a<60)&&(s[j].a<60)&&(s[i].p>s[j].p)))
{
t=s[i];
s[i]=s[j];
s[j]=t;
}
for(i=1;i<=n;i++)
printf("%s\n",s[i].ID);
} |
9 | 4446 |
struct patient
{
char id[15];
int age;
struct patient *ne;
};
struct patient *lian(int n)
{
int i;
struct patient *head;
struct patient *p;
struct patient *q;
head=(struct patient *)malloc(sizeof(struct patient));
scanf("%s%d",head->id,&head->age);
head->ne=0;
q=head;
for(i=1;i<n;i++)
{
p=(struct patient *)malloc(sizeof(struct patient));
scanf("%s%d",p->id,&p->age);
p->ne=0;
q->ne=p;
q=p;
}
return head;
}
int main()
{
int n,max,i,sign,b=5000;
struct patient *head;
struct patient *p;
scanf("%d",&n);
head=lian(n);
for(;;)
{
for(p=head,max=-1,sign=0;p!=NULL;p=p->ne)
{
if(((p->age)>=60)&&max<(p->age)&&((p->age)<b))
{
max=p->age;
sign=1;
}
}
b=max;
if(sign==0)
break;
for(p=head;p!=NULL;p=p->ne)
{
if((p->age)==max)
{
printf("%s\n",p->id);
}
}
}
for(p=head;p!=NULL;p=p->ne)
{
if((p->age)<60)
printf("%s\n",p->id);
}
return 0;
} |
9 | 4447 | void main()
{
int n,i,j;
struct p{
char id[30];
int ag;
}a[105],temp;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",a[i].id,&a[i].ag);
}
for(i=0;i<n-1;i++){
for(j=1;j<n-i;j++){
if(a[j-1].ag>=60&&a[j].ag>=60){
if(a[j-1].ag<a[j].ag){
temp=a[j-1];
a[j-1]=a[j];
a[j]=temp;
}
}
else if(a[j-1].ag<60&&a[j].ag>=60){
temp=a[j-1];
a[j-1]=a[j];
a[j]=temp;
}
}
}
for(i=0;i<n;i++)printf("%s\n",a[i].id);
} |
9 | 4448 | int main()
{
int n;
scanf("%d",&n);
int i,j;
char id[100][10];
int age[100];
char oid[100][10];
int oage[100];
for(i=0;i<n;i++)
{
scanf("%s",id[i]);
scanf("%d",&age[i]);
}
int k=0;
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
oage[k]=age[i];
strcpy(oid[k],id[i]);k++;
}
}
for(i=1;i<k;i++)
{
for(j=0;j<k-i;j++)
{
if(oage[j]<oage[j+1])
{
int e;
e=oage[j];
oage[j]=oage[j+1];
oage[j+1]=e;
char f[10];
strcpy(f,oid[j]);
strcpy(oid[j],oid[j+1]);
strcpy(oid[j+1],f);
}
}
}
for(i=0;i<k;i++)
{
printf("%s\n",oid[i]);
}
for(i=0;i<n;i++)
{
if(age[i]<60)printf("%s\n",id[i]);
}
return 0;
}
|
9 | 4449 | int main()
{
int n,a[100],l[100],b[100],i=0,j,k,p=0,q=0,t=0;
char s[100][12],lao[100][13]={'\0'},bu[100][13]={'\0'},w[12]={'\0'};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",&s[i],&a[i]);
if(a[i]>=60)l[p]=a[i],strcpy(lao[p],s[i]),p++;
else b[q]=a[i],strcpy(bu[q],s[i]),q++;}
for(i=0;i<p;i++){
for(j=0;j<p-1;j++){
if(l[j]<l[j+1])t=l[j],l[j]=l[j+1],l[j+1]=t,strcpy(w,lao[j]),strcpy(lao[j],lao[j+1]),strcpy(lao[j+1],w);
}}
for(i=0;i<p;i++){printf("%s\n",lao[i]);}
for(i=0;i<q;i++){printf("%s\n",bu[i]);}
} |
9 | 4450 | int main()
{
struct patient
{
char num[11];
int age;
}
pat[101],t;
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&pat[i].num,&pat[i].age);
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if((pat[j].age<60&&pat[j+1].age>=60)||(pat[j].age>=60&&pat[j+1].age>pat[j].age))
{
t=pat[j];
pat[j]=pat[j+1];
pat[j+1]=t;
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",pat[i].num);
}
return 0;
} |
9 | 4451 | struct pa{
char id[10];
int age;
struct pa* next;
}*head,*p,*p2;
int main()
{
int i,j,n,t;
char tid[10];
scanf("%d",&n);
head=(struct pa*)malloc(sizeof(struct pa));
p=(struct pa*)malloc(sizeof(struct pa));
scanf("%s %d",p->id,&p->age);
head->next=p;
p->next=NULL;
p2=p;
for(i=1;i<n;i++)
{
p=(struct pa*)malloc(sizeof(struct pa));
scanf("%s %d",p->id,&p->age);
p2->next=p;
p2=p;
p2->next=NULL;
}
// for(p=head->next;p!=NULL;p=p->next)printf("%s\n",p->id);
for(i=0;i<n;i++) //???????????, ????GE?????
{
for(p=head->next;p->next!=NULL;p=p->next)
{
if(p->next->age>=60 && p->next->age>p->age) //???????..?????????.
{ t=p->age,p->age=p->next->age,p->next->age=t;
strcpy(tid,p->id),strcpy(p->id,p->next->id),strcpy(p->next->id,tid);
}
}
}
p=head->next;
for(i=0;i<n;i++)
{
printf("%s\n",p->id);
p=p->next;
}
return 0;
} |
9 | 4452 | struct mouse
{
char id[10];
int age;
struct mouse *next;
};
struct mouse *creat(int n)
{
struct mouse *head,*p1,*p2;
int i;
for(i=0;i<n;i++)
{
if(i==1) head=p1;
if(i>1) p2->next=p1;
p2=p1;
p1=(struct mouse *)malloc(sizeof(struct mouse));
scanf("%s %d",p1->id,&p1->age);
}
p2->next=p1;p1->next=NULL;
return(head);
}
struct mouse *order(struct mouse *head,int n)
{
struct mouse *p1,*p2;
int i,j,x;
char a[10];
for(i=1;i<n;i++)
{
p2=head;p1=p2->next;
for(j=0;j<n-i;j++)
{
if(p2->age<p1->age&&p1->age>=60)
{
x=p2->age;p2->age=p1->age;p1->age=x;
strcpy(a,p2->id);strcpy(p2->id,p1->id);strcpy(p1->id,a);
}
p2=p1;p1=p1->next;
}
}
return(head);
}
main()
{
struct mouse *head,*p;
int i,n;
scanf("%d",&n);
head=creat(n);
head=order(head,n);
p=head;
for(i=0;i<n;i++)
{
printf("%s\n",p->id);
p=p->next;
}
}
|
9 | 4453 | main()
{
int n,m[100];
int t,i,j;
char str[100][10],s[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",str[i],&m[i]);
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
{
if(m[i]>=60)
{if(m[i+1]>=60)
{if(m[i+1]>m[i])
{strcpy(s,str[i]);strcpy(str[i],str[i+1]);strcpy(str[i+1],s);t=m[i];m[i]=m[i+1];m[i+1]=t;}
}
else {strcpy(s,str[i]);strcpy(str[i],str[i+1]);strcpy(str[i+1],s);t=m[i];m[i]=m[i+1];m[i+1]=t;}}
if(m[i]<60)
{
if(m[i+1]>=60) {strcpy(s,str[i]);strcpy(str[i],str[i+1]);strcpy(str[i+1],s);t=m[i];m[i]=m[i+1];m[i+1]=t;}
}
}
for(i=0;i<n;i++)
printf("%s\n",str[i]);
}
|
9 | 4454 | int main()
{
int n,i,j,s=-1,t=-1,k,age[100],e[100],h[100];
char a[100][10],b[100][10],c[100][10],f[10];
scanf("%d",&n);
for(i=0;i<=(n-1);i++)
{
scanf("%s %d",a[i],&age[i]);
}
for(i=0;i<=(n-1);i++)
{
if(age[i]>=60)
{
s=s+1;
e[s]=age[i];
strcpy(b[s],a[i]);
}
else
{
t=t+1;
h[t]=age[i];
strcpy(c[t],a[i]);
}
}
for(j=0;j<s;j++)
{
for(i=0;i<s-j;i++)
{
if(e[i]<e[i+1])
{
k=e[i];
e[i]=e[i+1];
e[i+1]=k;
strcpy(f,b[i]);
strcpy(b[i],b[i+1]);
strcpy(b[i+1],f);
}
}
}
for(i=0;i<=s;i++)
{
printf("%s\n",b[i]);
}
for(i=0;i<=t;i++)
{
printf("%s\n",c[i]);
}
getchar();
getchar();
return 0;
}
|
9 | 4455 | int main()
{
char id[100][10];
int o[100],n,i,j,s[100],b=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",id[i]);
scanf("%d",&o[i]);
}
for(i=0;i<n;i++)
{
if(o[i]>=60)
{
s[b]=o[i];
b++;
}
}
for(i=0;i<b;i++)
{
for(j=b-1;j>i;j--)
{
if(s[j]>s[j-1])
{
t=s[j];
s[j]=s[j-1];
s[j-1]=t;
}
}
}
for(i=0;i<b-1;i++)
{
if(s[i]==s[i+1])
s[i]=-1;
}
for(i=0;i<b;i++)
{
for(j=0;j<n;j++)
{
if(o[j]==s[i])
printf("%s\n",id[j]);
}
}
for(i=0;i<n;i++)
{
if(o[i]<60)
printf("%s\n",id[i]);
}
return 0;
}
|
9 | 4456 | int main()
{
int n,a[100],i,num=0,m[100],j;
char c[100][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c[i]);
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]>=60)
{
for(j=0;j<n;j++)
{
if(a[i]>=a[j])
{
num=num+1;
}
}
m[i]=num;
num=0;
}
}
for(j=n;j>0;j--)
{
for(i=0;i<n;i++)
{
if(a[i]>=60)
{
if(m[i]==j)
{
printf("%s\n",c[i]);
}
}
}
}
for(i=0;i<n;i++)
{
if(a[i]<60)
{
printf("%s\n",c[i]);
}
}
return 0;
} |
9 | 4457 |
int main()
{
int n,i,j,k;
int slotnum;
char slot[100];
scanf("%d",&n);
char s1[100][100];
int s2[100];
char a1[100][100];
int a2[100];
int anum=0;
char b1[100][100];
int b2[100];
int bnum=0;
for(i=0,j=0,k=0;i<n;i++)
{
scanf("%s %d",s1[i],&s2[i]);
if(s2[i]>=60)
{
strcpy(a1[j],s1[i]);
a2[j]=s2[i];
j++;
anum++;
}
if(s2[i]<60)
{
strcpy(b1[k],s1[i]);
b2[k]=s2[i];
k++;
bnum++;
}
}
for(i=anum-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(a2[j]<a2[j+1])
{
strcpy(slot,a1[j]);
strcpy(a1[j],a1[j+1]);
strcpy(a1[j+1],slot);
slotnum=a2[j];
a2[j]=a2[j+1];
a2[j+1]=slotnum;
}
}
}
for(i=0;i<anum;i++)
{
printf("%s\n",a1[i]);
}
for(i=0;i<bnum;i++)
{
printf("%s\n",b1[i]);
}
return 0;
} |
9 | 4458 | int main()
{
int n,sz[100],i=0,a[100],b[100],p=0,q=0,m=0;
char sz1[100][100],a1[100][100],b1[100][100],e[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",sz1[i],&sz[i]);
for(i=0;i<n;i++)
{
if(sz[i]>=60)
{
a[p]=sz[i];
strcpy(a1[p],sz1[i]);
p++;
}
if(sz[i]<60)
{
b[q]=sz[i];
strcpy(b1[q],sz1[i]);
q++;
}
}
for(i=1;i<p;i++)
{
for(m=0;m<p-i;m++)
{
if(a[m]<a[m+1])
{
int t = a[m];
a[m] = a[m+1];
a[m+1] = t;
strcpy(e,a1[m]);
strcpy(a1[m],a1[m+1]);
strcpy(a1[m+1],e);
}
}
}
for(i=0;i<p;i++)
printf("%s\n",a1[i]);
for(m=0;m<q;m++)
printf("%s\n",(b1[m]));
return 0;
}
|
9 | 4459 | int main()
{
struct data
{
int age;
char id[10];
}o[101],y[101],tmp;
int no=0,ny=0;
int i,j,n;
cin>>n;
for(i=0;i<n;i++)
{
cin>>tmp.id>>tmp.age;
if(tmp.age>=60)
{
o[no]=tmp;
no++;
}
else
{
y[ny]=tmp;
ny++;
}
}
for(i=no-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(o[j].age<o[j+1].age)
{
o[100]=o[j];
o[j]=o[j+1];
o[j+1]=o[100];
}
}
}
for(i=0;i<no;i++)
cout<<o[i].id<<endl;
for(i=0;i<ny;i++)
cout<<y[i].id<<endl;
return 0;
} |
9 | 4460 | struct patient
{
char id[10];
int age;
}pa[100];
void main()
{
int n,i,j,max=59,m,t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",pa[i].id,&pa[i].age);
for(i=0;i<n;i++)
if(pa[i].age>59)t++;
for(j=0;j<t;j++)
{
for(i=0;i<n;i++)
if(pa[i].age>max)
{
max=pa[i].age;
m=i;
}
printf("%s\n",pa[m].id);
pa[m].age=0;
max=59;
}
for(i=0;i<n;i++)
if(pa[i].age<=59&&pa[i].age!=0)
printf("%s\n",pa[i].id);
}
|
9 | 4461 | void main()
{
struct patient
{char id[10];
int a;
}all[100],old[100],temp;
int n,j=0,k,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",all[i].id,&all[i].a);
if(all[i].a>=60)
{
old[j]=all[i];
j=j+1;
}
}
for(i=j-1;i>0;i--)
{
for(k=0;k<i;k++)
{
if(old[k].a<old[k+1].a)
{
temp=old[k];
old[k]=old[k+1];
old[k+1]=temp;
}
}
}
for(i=0;i<j;i++)
{
printf("%s\n",old[i].id);
}
for(i=0;i<n;i++)
{
if(all[i].a<60)
printf("%s\n",all[i].id);
}
} |
9 | 4462 |
struct data
{
char id[100];
int age;
};
int main()
{
struct data old[1000];
struct data young[1000];
struct data temp;
int n,i,p=0,q=0,len1,len2,k;
char id[100];
int age;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",id, &age);
if(age>=60){
old[p].age=age;
strcpy(old[p].id,id);
p++;
}else{
young[q].age=age;
strcpy(young[q].id,id);
q++;
}
}
len1=p;
len2=q;
for(k=1;k<len1;k++){
for(i=0;i<len1-k;i++){
if(old[i].age<old[i+1].age){
temp=old[i+1];
old[i+1]=old[i];
old[i]=temp;
}
}
}
for(i=0;i<len1;i++){
printf("%s\n",old[i].id);
}
for(i=0;i<len2;i++){
printf("%s\n",young[i].id);
}
return 0;
}
|
9 | 4463 | int main()
{
char a[110],b[100][1000];
int n,i,y,l,j,p=0,q=0,c[1000],d[1000],e[1000],m,s,g[1000],v[1000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %d",a,&y);
l=strlen(a);
for(j=0;j<l;j++)
{b[i-1][j]=a[j];} //??ID
b[i-1][l]='\0';
c[i-1]=y;//????
}
for(i=0;i<n;i++)//????
{
if(c[i]>=60)
{
d[p]=c[i];
g[p]=i;
p++;
}
else if(c[i]<60)
{
e[q]=c[i];
v[q]=i;
q++;
}
}
for(j=0;j<=p-1;j++)
{
for(i=0;i<=p-1;i++)
{
if(d[i]>m)
{ m=d[i];
s=i;
}
else if(d[i]<=m);
}
printf("%s\n",b[g[s]]);
m=0;
d[s]=0;
}
for(i=0;i<=q-1;i++)
printf("%s\n",b[v[i]]);
} |
9 | 4464 | struct hospital
{
char ID[11];
int age;
}old[100],young[100],all[100],temp;
void sequence(struct hospital matrix[],int n)
{
int i,j;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(matrix[j].age<matrix[j+1].age)
{
temp=matrix[j];
matrix[j]=matrix[j+1];
matrix[j+1]=temp;
}
}
}
}
/*
??????????????????
{
int i,j,k;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(matrix[j].age>matrix[k].age)
{
k=j;
}
}
if(k!=i)
{
temp=matrix[i];
matrix[i]=matrix[k];
matrix[k]=temp;
}
}
}
*/
int main()
{
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s %d",all[i].ID,&all[i].age);
}
int oi=0,yi=0;
for(i=0;i<n;i++)
{
if(all[i].age>=60)
{
old[oi]=all[i];
oi++;
}
else
{
young[yi]=all[i];
yi++;
}
}
sequence(old,oi);
for(i=0;i<oi;i++)
{
printf("%s\n",old[i].ID);
}
for(i=0;i<yi;i++)
{
printf("%s\n",young[i].ID);
}
return 0;
}
|
9 | 4465 | int main(){
char s[100][MAX+1];
char g[100][MAX+1];
int h[100];
int k[100],a,i,j;
char q[100];
int n,e;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s[i]);
scanf("%d",&k[i]);
}
a=0;
j=0;
for(i=0;i<n;i++){
if(k[i]>=60){
a++;
h[j]=k[i];
strcpy(g[j],s[i]);
j++;
k[i]=0;
}
}
for(i=1;i<=a;i++){
for(j=0;j<a-i;j++){
if(h[j]<h[j+1]){
e=h[j];
h[j]=h[j+1];
h[j+1]=e;
strcpy(q,g[j]);
strcpy(g[j],g[j+1]);
strcpy(g[j+1],q);
}
}
}
for(i=0;i<a;i++){
printf("%s\n",g[i]);
}
for(i=0;i<n;i++){
if(k[i]!=0)
printf("%s\n",s[i]);
}
return 0;
} |
9 | 4466 |
struct pat
{
char id[11];
int age;
struct pat *next;
};
void find(struct pat *head,struct pat *s)
{
struct pat *pre=head,*p=pre->next;
while(p!=NULL&&s->age<=p->age)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
void sort(struct pat *head,int x,char name[11])
{
struct pat *pre=head,*p=pre->next,*s;
s=(struct pat*)malloc(sizeof(struct pat));
s->age=x;
strcpy(s->id,name);
s->next=NULL;
if(x>=60) find(head,s);
else
{
while(p!=NULL)
{
pre=p;
p=p->next;
}
pre->next=s;
s->next=p;
}
}
int main()
{
struct pat *head,*p;
int n,x,i;
char name[11];
head=(struct pat*)malloc(sizeof(struct pat));
head->next=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",name,&x);
sort(head,x,name);
}
p=head->next;
while(p!=NULL)
{
printf("%s\n",p->id);
p=p->next;
}
return 0;
} |
9 | 4467 |
struct patient{
char A[10];
int age;
};
int main(){
int i,n,k,max,count;
struct patient inter;
struct patient *p;
scanf("%d",&n);
struct patient *sick=(struct patient*)malloc(sizeof(struct patient)*n);//??
struct patient *waitlist=(struct patient*)malloc(sizeof(struct patient)*n);//??
count=0;//????
for(i=0;i<n;i++){
scanf("%s %d",sick[i].A,&sick[i].age);
}//??
p=waitlist;
for (i=0;i<n;i++)
{
if (sick[i].age>=60)
{
*p=sick[i];
p++;
count++;
}
}//????
for (i=0;i<n;i++)
{
if (sick[i].age<60)
{
*p=sick[i];
p++;
}
}//?????
for (i=1;i<count;i++)
{
for (k=0;k<count-i;k++)
{
if (waitlist[k].age<waitlist[k+1].age)
{
inter=waitlist[k+1];
waitlist[k+1]=waitlist[k];
waitlist[k]=inter;
}
}
}//????
for (i=0;i<n;i++)
{
printf("%s\n",waitlist[i].A);
}
return 0;
} |
9 | 4468 | int main()
{
int n,i,j,y[200],p[200];
char a[100][11];
scanf("%d",&n);
for(i=0;i<200;i++)
{
p[i]=200-i;
}
for(i=0;i<n;i++)
{
scanf("%s %d",a[i],&y[i]);
}
for(i=0;i<=140;i++)
{
for(j=0;j<n;j++)
{
if(y[j]==p[i])
printf("%s\n",a[j]);
}
}
for(i=0;i<n;i++)
{
if(y[i]<60)
printf("%s\n",a[i]);
}
getchar();
getchar();
} |
9 | 4469 |
int main(){
char id[100][10],old[100][10],yog[100][10];
int n,i,m=0,l=0,age[100],oag[100],yag[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",id[i]);
scanf("%d",&(age[i]));
if(age[i]>=60){
oag[m]=age[i];
strcpy(old[m],id[i]);
m++;
}else{
yag[l]=age[i];
strcpy(yog[l],id[i]);
l++;
}
}
char e_id[1][10];
int e_age,k;
for(k=1;k<=m;k++){
for(i=0;i<m-k;i++){
if(oag[i]<oag[i+1]){
strcpy(e_id[0],old[i]);
strcpy(old[i],old[i+1]);
strcpy(old[i+1],e_id[0]);
e_age=oag[i];
oag[i]=oag[i+1];
oag[i+1]=e_age;
}
}
}
for(i=0;i<m;i++){
puts(old[i]);
}
for(i=0;i<l;i++){
puts(yog[i]);
}
return 0;
}
|
9 | 4470 | int main()
{
int n, i, j, temp, num1 = 0, num2 = 100, age[100], flag[100];
char id[100][10], str[10];
cin >> n;
for (i = 0; i < n; i ++)
{
cin.get();
cin >> id[i] >> age[i];
if (age[i] < 60)
flag[i] = num1 ++;
else
flag[i] = num2 ++;
}
for (i = 0; i < n - 1; i ++)
{
for (j = i + 1; j < n; j ++)
{
if (age[i] < age[j] && age[j] >= 60)
{
temp = flag[i];
flag[i] = flag[j];
flag[j] = temp;
temp = age[i];
age[i] = age[j];
age[j] = temp;
strcpy(str, id[i]);
strcpy(id[i], id[j]);
strcpy(id[j], str);
}
}
}
for (i = 0; i < n - 1; i ++)
{
for (j = i + 1; j < n; j ++)
{
if (age[i] == age[j] && age[i] >= 60 && age[j] >= 60 && flag[i] > flag[j] || age[i] < 60 && age[j] < 60 && flag[i] > flag[j])
{
temp = flag[i];
flag[i] = flag[j];
flag[j] = temp;
temp = age[i];
age[i] = age[j];
age[j] = temp;
strcpy(str, id[i]);
strcpy(id[i], id[j]);
strcpy(id[j], str);
}
}
}
for (i = 0; i < n; i ++)
cout << id[i] << endl;
return 0;
}
|
9 | 4471 |
struct patient
{ char id[10];
int year;
}pat[100];
int arrange(struct patient peop[],int num);
int main()
{
int i,j=0,k,n,max;
struct patient *ppat[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",pat[i].id,&pat[i].year);
for(i=0;i<n;i++){
if(pat[i].year>=60){
ppat[j]=pat+i;j++;
}
}
struct patient *p;
for(i=0;i<j-1;i++){
for(k=0;k<j-1-i;k++){
if((*ppat[k]).year < (*ppat[k+1]).year){
p=ppat[k];
ppat[k]=ppat[k+1];
ppat[k+1]=p;
}
}
}
for(i=0;i<j;i++)
printf("%s\n",ppat[i]->id);
for(i=0;i<n;i++){
if(pat[i].year<60)
printf("%s\n",pat[i].id);
}
return 0;
}
|
9 | 4472 | struct Info{
char sID[10];
int nAge;
};
void main(){
int i,n,j,l;
struct Info t;
scanf("%d",&n);
struct Info patients[100];
struct Info overpatients[100];
l=0;
for (i=0;i<n;i++){
scanf("%s%d",patients[i].sID,&patients[i].nAge);
if (patients[i].nAge>=60){//?????60?????????
overpatients[l]=patients[i];
l++;
}
}
for (i=0;i<l-1;i++)
for (j=1;j<l-i;j++){
if (overpatients[j-1].nAge<overpatients[j].nAge){
t=overpatients[j-1];
overpatients[j-1]=overpatients[j];
overpatients[j]=t;
}
}
for (i=0;i<l;i++){
printf("%s\n",overpatients[i].sID);
}
for (i=0;i<n;i++)
if (patients[i].nAge<60){
printf("%s\n",patients[i].sID);
}
}
|
9 | 4473 | main()
{
char senior[100][10];
char junior[100][10];
char temp[10];
int list[100]={0};
int se[100];
int ju[100];
int n,i,j,k,nums,numj,year;
scanf("%d",&n);
nums=-1; numj=-1;
for (i=1;i<=n;i++)
{
scanf("%s",temp);
scanf("%d",&year);
if (year>=60)
{
nums++;
strcpy(senior[nums],temp);
se[nums]=year;
list[nums]=nums;
}
else
{
numj++;
strcpy(junior[numj],temp);
ju[numj]=year;
}
}
for (i=0;i<nums;i++)
for (j=i+1;j<=nums;j++)
if ((se[i]<se[j]))
{
year=se[i]; se[i]=se[j]; se[j]=year;
year=list[i]; list[i]=list[j]; list[j]=year;
strcpy(temp,senior[i]);
strcpy(senior[i],senior[j]);
strcpy(senior[j],temp);
}
else if (se[i]==se[j] && list[i]>list[j])
{
year=se[i]; se[i]=se[j]; se[j]=year;
year=list[i]; list[i]=list[j]; list[j]=year;
strcpy(temp,senior[i]);
strcpy(senior[i],senior[j]);
strcpy(senior[j],temp);
}
// for (i=0;i<numj;i++)
// for (j=i+1;j<=numj;j++)
// if (strcmp(junior[i],junior[j])>0)
// {
// year= ju[i]; ju[i]=ju[j]; ju[j]=year;
// strcpy(temp,junior[i]);
// strcpy(junior[i],junior[j]);
// strcpy(junior[j],temp);
// }
for (i=0;i<=nums;i++)
{
//printf("%d ",list[i]);
puts(senior[i]);
}
for (i=0;i<=numj;i++)
puts(junior[i]);
return 0;
}
|
9 | 4474 | struct patient
{
char ID[11];
int age;
struct patient *next;
}
main()
{
int i,n;
struct patient *old,*young,*ot,*yt,*p;
struct patient *paixu(struct patient* h);
scanf("%d", &n);
ot=NULL;
yt=NULL;
for(i=0;i<n;i++)
{
p=(struct patient *)malloc(len);
scanf("%s %d",p->ID,&p->age);
p->next=NULL;
if (p->age<60)
{
if (yt)
yt->next=p;
else
young=p;
yt=p;
}
else
{
if(ot)
ot->next=p;
else
old=p;
ot=p;
}
}
old=paixu(old);
while(old)
{
printf("%s\n",old->ID);
old=old->next;
}
while(young)
{
printf("%s\n",young->ID);
young=young->next;
}
}
struct patient *paixu(struct patient* h)
{
struct patient* hh=h,*before,*after;
h=h->next;
hh->next=NULL;
while(h)
{
before=hh;
if(before->age<h->age)
{
hh=h;
after=h->next;
h->next=before;
h=after;
}
else
{
while (before->next)
{
if(before->next->age>=h->age)
before=before->next;
else
break;
}
after=h->next;
h->next=before->next;
before->next=h;
h=after;
}
}
return hh;
}
|
9 | 4475 |
int main()
{
int renshu,nianling[1000][2],bijiao[1000][2];
char id[1000][1000];
scanf("%d",&renshu);
int i,j,k;
j=0;
k=0;
for(i=0;i<renshu;i++)
{
scanf("%s%d",id[i],&nianling[i][0]);
}
for(i=0;i<renshu;i++)
{
if(nianling[i][0]<60);
else
{
nianling[i][1]=i;
bijiao[k][0]=nianling[i][0];
bijiao[k][1]=i;
k++;
}
}
int zhongjian[2],l;
l=k;
bijiao[l][0]=10000;
for(i=0;i<l;i++)
{
for(j=0;j<l;j++)
{
if(bijiao[j][0]>bijiao[j+1][0])
{
zhongjian[0]=bijiao[j+1][0];
zhongjian[1]=bijiao[j+1][1];
bijiao[j+1][0]=bijiao[j][0];
bijiao[j+1][1]=bijiao[j][1];
bijiao[j][0]=zhongjian[0];
bijiao[j][1]=zhongjian[1];
}
else if(bijiao[j][0]==bijiao[j+1][0]&&bijiao[j][1]<bijiao[j+1][1])
{
zhongjian[0]=bijiao[j+1][0];
zhongjian[1]=bijiao[j+1][1];
bijiao[j+1][0]=bijiao[j][0];
bijiao[j+1][1]=bijiao[j][1];
bijiao[j][0]=zhongjian[0];
bijiao[j][1]=zhongjian[1];
}
else;
}
}
for(i=0;i<l;i++)
{
for(j=0;j<renshu;j++)
{
if(bijiao[l-1-i][0]==nianling[j][0]&&bijiao[l-i-1][1]==nianling[j][1])
printf("%s\n",id[j]);
else;
}
}
for(j=0;j<renshu;j++)
{
if(nianling[j][0]<60)
printf("%s\n",id[j]);
else;
}
getchar();
getchar();
} |
9 | 4476 | struct patient
{
char ID[15];
int age;
struct patient *next;
};
int n;
struct patient *create()
{
struct patient *head,*p1,*p2;
p1=(struct patient*)malloc(LEN);
scanf("%s %d",p1->ID,&p1->age);
head=p1;
p2=p1;
p1->next=NULL;
int i=1;
do
{
if(i==n)break;
p1=(struct patient*)malloc(LEN);
scanf("%s %d",p1->ID,&p1->age);
p2->next=p1;
p2=p1;
p1->next=NULL;
i++;
}while(1);
return(head);
}
struct patient *findmax(struct patient *head)
{
struct patient *max;
struct patient *p;
max = head;
p=head->next;
while(p)
{
if(p->age>max->age)
max=p;
p=p->next;
}
return(max);
}
struct patient *del(struct patient *head,struct patient *needdel)
{
struct patient *p,*ppre;
printf("%s\n",needdel->ID);
p=head;
while(p&&needdel!=p)
{ppre=p;
p=p->next;}
if(p==head)
{
head=p->next;
free(p);
}
else if (p)
{
ppre->next=p->next;
free(p);
}
return(head);
}
void print(struct patient *head)
{
struct patient *p;
p=head;
while(p)
{
printf("%s\n",p->ID);
p=p->next;
}
}
int main()
{
scanf("%d",&n);
struct patient *head,*p;
head=create();
p = head;
do
{
p = findmax(head);
if(p->age<60)break;
head=del(head,p);
}while(1);
print(head);
}
|
9 | 4477 | int main(){
int n,age[100],oage[100];
char ID[100][10],old[100][10],young[100][10];
scanf("%d",&n);
int i,m;
for(i=0;i<n;i++){
scanf("%s%d",ID[i],&age[i]);
}
int k=0,j=0;
for(i=0;i<n;i++){
if(age[i]<60){
strcpy(young[k],ID[i]);
k++;
}
else{
oage[j]=age[i];
strcpy(old[j],ID[i]);
j++;
}
}
for(i=150;i>=60;i--){
for(m=0;m<j;m++){
if(oage[m]==i){
printf("%s\n",old[m]);
}
}
}
for(i=0;i<k;i++){
printf("%s\n",young[i]);
}
return 0;
}
|
9 | 4478 | main()
{
int n;
int amount_lao=0,amount_yiban=0;
char c[11];
int shuru;
int i,j,k,s,p;
struct xinxi
{
char id[11];
int age;
};
struct xinxi laoren[100];
struct xinxi common[100];
struct xinxi temp;
scanf("%d",&n);
for(p=0;p<n;p++)
{
scanf("%s %d",c,&shuru);
if(shuru<60)
{
strcpy(common[amount_yiban].id,c);
common[amount_yiban].age=shuru;
amount_yiban++;
}
else if(shuru>=60)
{
strcpy(laoren[amount_lao].id,c);
laoren[amount_lao].age=shuru;
amount_lao++;
}
}
for(i=0;i<amount_lao-1;i++)
{
for(j=0;j<amount_lao-i-1;j++)
{
if(laoren[j].age<laoren[j+1].age)
{
strcpy(temp.id,laoren[j].id);
temp.age=laoren[j].age;
strcpy(laoren[j].id,laoren[j+1].id);
laoren[j].age=laoren[j+1].age;
strcpy(laoren[j+1].id,temp.id);
laoren[j+1].age=temp.age;
}
}
}
for(k=0;k<amount_lao;k++)
{
puts(laoren[k].id);
printf("\n");
}
for(s=0;s<amount_yiban;s++)
{
puts(common[s].id);
printf("\n");
}
getchar();
getchar();
}
|
9 | 4479 | struct sick
{
char *num;
int age;
struct sick *next;
};
struct sick *range(int N)
{
struct sick *pnew,*ppre,*p,*head,*last;
pnew=(struct sick *)malloc(len);
pnew->num=(char *)malloc(100*sizeof(char));
pnew->next=NULL;
scanf("%s %d",pnew->num,&pnew->age);
head=last=pnew;
int i;
for(i=2;i<=N;i++)
{
pnew=(struct sick *)malloc(len);
pnew->num=(char *)malloc(100*sizeof(char));
pnew->next=NULL;
scanf("%s %d",pnew->num,&pnew->age);
int j;
if (pnew->age<60)
{
last->next=pnew;
last=pnew;
}
else
{
if(pnew->age>head->age)
{
pnew->next=head;
head=pnew;
}
else
{
ppre=head;
p=head->next;
for(j=2;p!=NULL;j++)
{
if(pnew->age>p->age)
{
ppre->next=pnew;
pnew->next=p;
break;
}
else
{
ppre=ppre->next;
p=p->next;
}
}
}
if(pnew->next==NULL)
{
last->next=pnew;
last=pnew;
}
}
}
return(head);
}
void print(struct sick *head,int N)
{
struct sick *p=head;
int i;
for(i=1;i<=N;i++)
{
printf("%s\n",p->num);
p=p->next;
}
}
void main()
{
int N;
scanf("%d",&N);
struct sick *head=range(N);
print(head,N);
}
|
9 | 4480 | struct patient
{
char id[10];
int age;
}p[100],old[100],temp;
void main()
{
int i,j,n,count=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",p[i].id);
scanf("%d",&p[i].age);
if(p[i].age>=60)
{
old[count]=p[i];
count++;
}
}
for(i=0;i<count;i++)
{
for(j=0;j<count-i;j++)
{
if(old[j+1].age>old[j].age)
{
temp=old[j];
old[j]=old[j+1];
old[j+1]=temp;
}
}
}
for(i=0;i<count;i++)
{
printf("%s\n",old[i].id);
}
for(i=0;i<n;i++)
{
if(p[i].age<60)
{
printf("%s\n",p[i].id);
}
}
} |
9 | 4481 | long exp(int a)
{
int def1,expo=1;
for(def1=1;def1<=a;def1++)
expo=expo*10;
return expo;
}
main()
{
int n,i,j,comp,idlenth,sw=0,test=0,advnum=0,arradv=1,arrdis,cache;
int bubble,maxage,maxid,maxnum,maxright,print;
scanf("%d",&n);
int age[n+1],adv[n+1],ord[n+1],alrscan[n+1],numord[n+1],right[n+1];
getchar();
long id[n+1];
for(i=1;i<=n;i++)
{
ord[i]=numord[i]=i;
alrscan[i]=0;
right[i]=0;
}
for(i=1;i<=n;i++)
scanf("%d %d",&id[i],&age[i]);
for(i=1;i<=n;i++)
{
if(age[i]>=60)
{
adv[i]=1;
right[i]+=age[i]*1000;
right[i]+=1000000;
advnum++;
}
else
adv[i]=0;
}
for(i=1;i<=n;i++)
{
right[i]+=n-i+1;
alrscan[i]=0;
}
for(i=1;i<=n;i++)
{
maxright=0;
for(j=1;j<=n;j++)
{
if(right[j]>maxright&&alrscan[j]==0)
{maxright=right[j];
maxnum=j;}
}
ord[i]=maxnum;
alrscan[maxnum]=1;
}
for(idlenth=1;test!=n;idlenth++)
{
test=0;
for(j=1;j<=n;j++)
if(id[j]<exp(idlenth-1))
test++;
}
idlenth--;
for(i=1;i<=n;i++)
{
for(j=1;j<=idlenth;j++)
{
if(id[ord[i]]<exp(idlenth-j-1))
printf("0");
}
printf("%d\n",id[ord[i]]);
//printf("%d %d %d\n",id[ord[i]],numord[ord[i]],right[ord[i]]);
}
/*arrdis=advnum+1;
for(i=1;i<=n;i++)
{
if(adv[i]==1)
{
ord[arradv]=i;
arradv++;
}
else
{
ord[arrdis]=i;
arrdis++;
}
}
//printf("adv=%d,dis=%d",arradv,arrdis);
for(bubble=advnum;bubble>=1;bubble--);
{
for(i=1;i<bubble;i++)
{
if(age[ord[i+1]]>age[ord[i]])
{
cache=ord[i+1];
ord[i+1]=ord[i];
ord[i]=cache;
}
}
}
for(bubble=n;bubble>=advnum+1;bubble--);
{
for(i=advnum+1;i<bubble;i++)
{
if(id[ord[i+1]]>id[ord[i]])
{
cache=ord[i+1];
ord[i+1]=ord[i];
ord[i]=cache;
}
}
}
for(idlenth=1;test!=n;idlenth++)
{
test=0;
for(j=1;j<=n;j++)
if(id[j]<exp(idlenth-1))
test++;
}
idlenth--;
for(i=1;i<=n;i++)
{
for(j=1;j<=idlenth;j++)
{
if(id[ord[i]]<exp(idlenth-j-1))
printf("0");
}
printf("%d\n",id[ord[i]]);
}*/
getchar();
getchar();
return 0;
}
|
9 | 4482 | struct rat
{
char num[11];
int age;
struct rat *next;
};
int n;
struct rat *creat(void)
{
struct rat *head,*p1,*p2;
int i;
p1=p2=(struct rat*)malloc(LEN);
head=p1;
scanf("%s%d",p1->num,&p1->age);
for(i=2;i<=n;i++)
{
p2->next=p1;
p2=p1;
p1=(struct rat*)malloc(LEN);
scanf("%s%d",p1->num,&p1->age);
}
p2->next=p1;
p1->next=NULL;
return(head);
}
struct rat *sort(struct rat *head,int count)
{
struct rat *p1,*p2,*p3,*temp;
int i,j;
for(j=1;j<=count-1;j++)
{
p1=head;
p2=p1->next;
p3=p2;
for(i=0;i<count-j;i++)
{
if(p1->age<p2->age)
{
temp=p2->next;
p2->next=p1;
p1->next=temp;
if(i==0)
{
head=p2;
p2=temp;
}
else
{
p3->next=p2;
p3=p2;
p2=temp;
}
}
else
{
if(i==0)
{
p3=head=p1;
p1=p1->next;
p2=p2->next;
}
else
{
p1=p1->next;
p2=p2->next;
p3=p3->next;
}
}
}
}
return(head);
}
struct rat *del(struct rat *head,int t)
{
struct rat *p1,*p2;
int i;
p1=head;
for(i=1;i<=t;i++)
{
if(p1->age<60)
{
if(i==1)
head=p1;
p2=p1;
p1=p1->next;
continue;
}
if(p1->age>=60)
{
if(i==1)
{
head=p1->next;
break;
}
p2->next=p1->next;
break;
}
}
return(head);
}
void main()
{
struct rat *head,*p1,*s,*p2,*p3;
int i,count=0,t;
scanf("%d",&n);
t=n;
head=creat();
p1=head;
p3=p2=(struct rat*)malloc(LEN);
for(i=1;i<=n;i++)
{
if(p1->age>=60)
{
if(count==0)
s=p2;
p2->age=p1->age;
strcpy(p2->num,p1->num);
p3->next=p2;
p3=p2;
p2=(struct rat*)malloc(LEN);
count++;
}
p1=p1->next;
}
s=sort(s,count);
for(i=1;i<=count;i++)
{
head=del(head,t);
t=t-1;
}
p1=s;
for(i=1;i<=count;i++)
{
printf("%s\n",p1->num);
p1=p1->next;
}
p1=head;
for(i=1;i<=(n-count);i++)
{
printf("%s\n",p1->num);
p1=p1->next;
}
}
|
9 | 4483 | struct patient
{char num[20];
int age; };
int main()
{struct patient a[100],b[100],c[100],temp;
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d",a[i].num,&a[i].age);}
int j=0,k=0,m;
for (i=0;i<n;i++)
{if (a[i].age>=60) {b[j]=a[i];j++;}
else {c[k]=a[i];k++;}
}
for (i=0;i<j;i++)
{for (m=0;m<j-i;m++)
{if (b[m].age<b[m+1].age)
{temp=b[m];b[m]=b[m+1];b[m+1]=temp;}}}
for (i=0;i<j;i++)
{printf("%s\n",b[i].num);}
for(i=0;i<k;i++)
{printf("%s\n",c[i].num);}
}
|
9 | 4484 | struct Student
{
char id[10];
int age;
}ill[100];
int main()
{
int i,j,n,q;
char p[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",&ill[i].id,&ill[i].age);
for(j=0;j<n-1;j++)
for(i=n-1;i>j;i--){
if(ill[i].age>=60&&ill[i].age>ill[i-1].age){
strcpy(p,ill[i].id); q=ill[i].age;
strcpy(ill[i].id,ill[i-1].id); ill[i].age=ill[i-1].age;
strcpy(ill[i-1].id,p); ill[i-1].age=q;
}
}
for(i=0;i<n;i++)
printf("%s\n",ill[i].id);
} |
9 | 4485 | void main()
{
int n,age[100],age1[100],t1,i,j,l1=0,l2=0;
char id[100][10],t2[10]={" "},a[100][10]={" "},b[100][10]={" "};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",&id[i],&age[i]);
if(age[i]>=60)
{
strcpy(a[l1],id[i]);
age1[l1]=age[i];
l1+=1;
}
else
{
strcpy(b[l2],id[i]);
l2+=1;
}
}
for(i=1;i<l1;i++)
{
for(j=0;j<l1-i;j++)
{
if(age1[j]<age1[j+1])
{
t1=age1[j];
age1[j]=age1[j+1];
age1[j+1]=t1;
strcpy(t2,a[j]);
strcpy(a[j],a[j+1]);
strcpy(a[j+1],t2);
}
}
}
for(i=0;i<l1;i++)
printf("%s\n",a[i]);
for(j=0;j<l2;j++)
printf("%s\n",b[j]);
} |
9 | 4486 | typedef struct data *pdata;
struct data
{
char a[20];
int b;
pdata next;
};
pdata sort(int n)
{
pdata p=NULL,q=NULL,s=NULL,head=NULL;
head=(pdata)malloc(sizeof(struct data));
head->next=NULL;
int i;
for (i=0;i<n;i++)
{
s=(pdata)malloc(sizeof(struct data));
scanf("%s %d",s->a,&(s->b));
if(s->b>=60)
{
q=head;
p=head->next;
while (p)
{
if(p->b<s->b) break;
q=q->next;
p=p->next;
}
q->next=s;
s->next=p;
}
else
{
q=head;
p=head->next;
while(p)
{
q=q->next;
p=p->next;
}
q->next=s;
s->next=NULL;
}
}
return head;
}
int main()
{
int n,i;
pdata p,head;
scanf("%d",&n);
head=sort(n);
p=head->next;
for(i=0;i<n;i++)
{
printf("%s\n",p->a);
p=p->next;
}
} |
9 | 4487 | struct patient
{
char a[100];
int age;
}pat[110],pat1[110];
void bubble(int n)
{
int i,j;
struct patient temp;
for(i=1;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(pat1[j].age<pat1[j+1].age)
{
temp=pat1[j];
pat1[j]=pat1[j+1];
pat1[j+1]=temp;
}
}
}
}
void main()
{
int n,i,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pat[i].a,&pat[i].age);
if(pat[i].age>=60)
pat1[k++]=pat[i];
}
bubble(k);
for(i=0;i<k;i++)
printf("%s\n",pat1[i].a);
for(i=0;i<n;i++)
{
if(pat[i].age<60)
printf("%s\n",pat[i].a);
}
}
|
9 | 4488 | int main(){
struct patient {
char id[11];
int age;
}*p,*p60_up,*p60_low,t;
int n,i,j,k=0;
scanf ("%d",&n);
p = (struct patient *) malloc( sizeof(struct patient) * n );
for(i=0;i<n;i++){
scanf("%s",&(p[i].id));
scanf("%d",&(p[i].age));
}
for(i=0;i<=n;i++){
if(p[i].age>=60){
k++;
}
}
p60_up = (struct patient *) malloc( sizeof(struct patient) * k );
p60_low= (struct patient *) malloc( sizeof(struct patient) * (n-k) );
for(i=0,j=0;i<n;i++){
if(p[i].age>=60){
p60_up[j]=p[i];
j++;
}
}for(i=0,j=0;i<n;i++){
if(p[i].age<60){
p60_low[j]=p[i];
j++;
}
}
for( j = 1 ; j <= k ; j++){
for( i = 0; i < k - j; i++){
if(p60_up[i].age<p60_up[i+1].age){
t = p60_up[i+1];
p60_up[i+1] = p60_up[i];
p60_up[i] = t;
}
}
}
for(i=0;i<k;i++){
puts(p60_up[i].id);
}
free(p60_up);
for(i=0;i<n-k;i++){
puts(p60_low[i].id);
}
free(p60_low);
return 0;
} |
9 | 4489 | struct patient{
char id[10];
int age;
}a[100];
int main(){
int n,i,k,e;
char p[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",a[i].id,&a[i].age);
if(a[i].age>=60){
for(k=0;i-k>=1;k++){
if(a[i-k].age>a[i-k-1].age){
e=a[i-k].age;
a[i-k].age=a[i-k-1].age;
a[i-k-1].age=e;
strcpy(p,a[i-k].id);
strcpy(a[i-k].id,a[i-k-1].id);
strcpy(a[i-k-1].id,p);
}
}
}
}
for(i=0;i<n;i++){
printf("%s\n",a[i].id);
}
return 0;
} |
9 | 4490 | void main()
{
int n,i,j,k,t;
int a[100]={0},b[100]={0};
char id[100][20],temp[20],s[100][20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",id[i],&a[i]);
for(i=0,j=0;i<n;i++)
if(a[i]>=60)
{
b[j]=a[i];
strcpy(s[j],id[i]);
j=j+1;
}
for(i=0;i<j;i++)
for(k=0;k<j-i;k++)
if(b[k]<b[k+1])
{t=b[k];b[k]=b[k+1];b[k+1]=t;strcpy(temp,s[k]);strcpy(s[k],s[k+1]);strcpy(s[k+1],temp);}
for(k=0;k<j;k++)
printf("%s\n",s[k]);
for(i=0;i<n;i++)
if(a[i]<60)
printf("%s\n",id[i]);
} |
9 | 4491 | struct student
{
char num[10];
int o;
struct student *next;
};
struct student *create(int n)
{
struct student *head,*p1,*p2;
int i;
int scholar(struct student *p);
p1=(struct student*)malloc(len);
scanf("%s %d",p1->num,&p1->o);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<=n-1;i++)
{
p1=(struct student*)malloc(len);
scanf("%s %d",p1->num,&p1->o);
p1->next=NULL;
p2->next=p1;
p2=p1;
}
return head;
}
struct student *max(struct student *head)
{
struct student *p,*m;
m=head;
p=head->next;
while(p)
{
if(p->o>m->o) m=p;
p=p->next;
}
return m;
}
void main()
{
int n;
struct student *head,*m,*p;
struct student *create(int n);
struct student *max(struct student *head);
scanf("%d",&n);
head=create(n);
p=head;
for(;;)
{
m=max(p);
if(m->o>=60)
{
printf("%s\n",m->num);
m->o=-1;
}
else break;
}
p=head;
while(p)
{
if(p->o!=-1) printf("%s\n",p->num);
p=p->next;
}
}
|
9 | 4492 |
int main(){
int n,i,j;
struct ren{
char b[100];
int c;
}a[100],d[100],m;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",a[i].b,&a[i].c);
d[i]=a[i];
}
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if(d[j].c<d[j+1].c){
m=d[j+1];
d[j+1]=d[j];
d[j]=m;
}
}
}
for(i=0;i<n;i++){
if(d[i].c>=60){
printf("%s\n",d[i].b);
}
}
for(i=0;i<n;i++){
if(a[i].c<60){
printf("%s\n",a[i].b);
}
}
return 0;
}
|
9 | 4493 |
int main(){
int n,i,j,t;
struct ill{
char num[10];
int age,id;
}man[N],ex;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",man[i].num,&man[i].age);
man[i].id=i;
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(man[i].age<man[j].age)
{
ex=man[i];
man[i]=man[j];
man[j]=ex;
}
}
}
for(i=0;i<n;i++)
{
if(man[i].age<60)
{
t=i;
break;
}
}
for(i=0;i<t;i++)
{
for(j=i+1;j<t;j++)
{
if(man[i].age==man[j].age&&man[i].id>man[j].id)
{
ex=man[i];
man[i]=man[j];
man[j]=ex;
}
}
}
for(i=t;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(man[i].id>man[j].id)
{
ex=man[i];
man[i]=man[j];
man[j]=ex;
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",man[i].num);
}
for(i=0;i<n;i++);
return 0;
} |
9 | 4494 | int main(){
int age[N], n, i, k;
char id[N][LEN];
scanf("%d", &n);
for(i = 0; i < n; i++){
scanf("%s %d", id[i], &(age[i]));
}
int e; char e_id[LEN];
for(k = 1 ; k <= n; k++){
for(i = 0; i < n- k; i++){
if((age[i]<age[i+1]&&age[i]>=60)||(age[i]<60&&age[i+1]>=60)){
e = age[i+1];
strcpy(e_id, id[i+1]);
age[i+1] = age[i];
strcpy(id[i+1], id[i]);
age[i] = e;
strcpy(id[i], e_id);
}
}
}
for(i = 0; i < n; i++){
printf("%s\n", id[i]);
}
return 0;
} |
9 | 4495 | int main()
{
int n,i,j,t,m,x,k;
char a[100][100],b[100],c[100],d[100][100],e[100],f[100][100],s[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",a[i],&b[i]);
k=0;
for(i=0;i<n;i++)
{
if(b[i]>=60)
{c[k]=b[i];strcpy(d[k],a[i]);k++;}
}
for(i=0;i<k-1;i++)
{
for(j=0;j<k-1-i;j++)
{
if(c[j]<c[j+1]){t=c[j];c[j]=c[j+1];c[j+1]=t;strcpy(s,d[j]);strcpy(d[j],d[j+1]);strcpy(d[j+1],s);}
}
}
for(i=0;i<k;i++)
printf("%s\n",d[i]);
m=0;
for(i=0;i<n;i++)
{
if(b[i]<60){e[m]=b[i];strcpy(f[m],a[i]);m++;}
}
for(i=0;i<m;i++)
printf("%s\n",f[i]);
}
|
9 | 4496 | void main()
{
int n;
int i;
int j;
struct client
{
char num[11];
int age;
};
struct client line[100];
struct client temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",&line[i].num,&line[i].age);
for(i=0;i<n-1;i++)
for(j=0;j<n-1;j++)
{
if(line[j].age>=60&&line[j+1].age>=60)
{
if(line[j].age<line[j+1].age)
{
temp=line[j];
line[j]=line[j+1];
line[j+1]=temp;
}
}
if(line[j].age<60 && line[j+1].age>=60)
{
temp=line[j];
line[j]=line[j+1];
line[j+1]=temp;
}
}
for(i=0;i<n;i++)
printf("%s\n",line[i].num);
} |
9 | 4497 | struct patient
{
char id[10];
int age;
}pat[100],p[100];
void main()
{
int n,m=0,i,j=0,k,temp,a[40]={0},sum=1;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%s%d",pat[i].id,&pat[i].age);
for(i=0;i<n;i++)
{
if(pat[i].age>=60)
{ p[j++]=pat[i];m++;}
}
a[0]=p[0].age;
for(j=1;j<m;j++)
{ for(i=0;a[i]!=0;i++)
if(a[i]==p[j].age)break;
if(a[i]==0)
{a[i]=p[j].age;sum++;}
}
for(j=0;j<sum-1;j++)
{
k=j;
{
for(i=j+1;i<sum;i++)
if(a[i]>a[j])
{k=i;
temp=a[k];a[k]=a[j];a[j]=temp;}
}
}
for(k=0;k<sum;k++)
{ for(j=0;j<m;j++)
{
if(p[j].age==a[k])printf("%s\n",p[j].id);
}
}
for(i=0;i<n;i++)
{
if(pat[i].age<60)
printf("%s\n",pat[i].id);
}
} |
9 | 4498 | int main()
{
int n,i,j,k=0,t=0,y[100],x,a[100]={0},b[100];
char s[100][20],temp[20],s1[100][20],s2[100][20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",s[i],&y[i]);
}
for(i=0;i<n;i++)
{
if(y[i]>=60)
{
strcpy(s1[k],s[i]);
a[k]=y[i];
k++;
}
}
// for(i=0;i<k;i++)
// printf("%s %d@@\n",s1[i],a[i]);
for(i=0;i<k-1;i++)
for(j=0;j<k-i-1;j++)
if(a[j]<a[j+1])
{
x=a[j];
a[j]=a[j+1];
a[j+1]=x;
strcpy(temp,s1[j]);
strcpy(s1[j],s1[j+1]);
strcpy(s1[j+1],temp);
}
for(i=0;i<k;i++)
printf("%s\n",s1[i],a[i]);
for(i=0;i<n;i++)
{
if(y[i]<60)
{
strcpy(s2[t],s[i]);
t++;
}
}
for(i=0;i<t;i++)
printf("%s\n",s2[i]);
return 0;
}
|
9 | 4499 | struct pa{
char name[10];
int age;
struct pa *next;
};
void sort(struct pa *head,struct pa *s)
{
struct pa *p1,*p2;
p1=head->next;
p2=head;
while(p1&&p1->age>=s->age)
{
p2=p1;
p1=p1->next;
}
p2->next=s;
s->next=p1;
}
void creat(struct pa *head,struct pa *s)
{
struct pa *p2,*p1;
p1=head->next;
p2=head;
while(p1)
{
p2=p1;
p1=p1->next;
}
p2->next=s;
s->next=p1;
}
struct pa * input()
{
int i,n;
struct pa *s,*head1,*head2,*p1,*p2;
head1=(struct pa *)malloc(len);
head2=(struct pa *)malloc(len);
head1->next=NULL;
head2->next=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
s=(struct pa *)malloc(len);
scanf("%s%d",s->name,&s->age);
if(s->age>=60) sort(head1,s);
else creat(head2,s);
}
p1=head1->next;
p2=head1;
while(p1)
{
p2=p1;
p1=p1->next;
}
p2->next=head2->next;
return(head1);
}
void print(struct pa *head)
{
struct pa *p;
p=head->next;
while(p)
{
printf("%s\n",p->name);
p=p->next;
}
}
void main()
{
struct pa *head;
head=input();
print(head);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.