label
stringlengths
1
2
index
stringlengths
1
5
code
stringlengths
87
8.24k
9
4000
void main() { int a=0,b=0,c=0,d=0,n=0,k=0,i=0; struct man { int number; char name[10]; }m[100],p[100],s; scanf("%d",&n); for(i=0;i<n;i++) scanf("%s %d",m[i].name,&m[i].number); for(i=0;i<n;i++) if(m[i].number>=60) { p[k]=m[i]; k++; } for(a=k-1;a>0;a--) { for(b=0;b<a;b++) if(p[b].numb...
9
4001
int main(){ int sz[100],aged[100]; char num[100][11],anum[100][11],q[100][11]; int n,i,k,j=0,s,p,e=0; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s",num[i]); scanf("%d",&sz[i]); }for(i=0;i<n;i++){ if(sz[i]>=60){ aged[j]=sz[i]; strcpy(anum[j],num[i]); j++; } }for(s=1;s<j;s++){ for(k=0;k<j-s;k...
9
4002
int old=0; struct seqs//???? { char id[11]; int age; struct seqs *next; }; struct seqs *build(int l)//?????????l { int i; struct seqs *head,*newnode,*p; head=(struct seqs *)malloc(len);//??????? scanf("%s %d",head->id,&head->age);//???????? p=head;//???p?????? if(head->age>=60) old++; for(i=1...
9
4003
int main(int argc, char* argv[]) { char id[100][100]; int age[100]; int n; int i,k; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s",id[i]); scanf("%d",&age[i]); } int e; char t[13]; char id1[100][13]; int age1[100]; char id2[100][13]; int age2[100]; int x=0,y=0; for(i=0;i<n;i++){ ...
9
4004
int main() { int n,i,a[150],tmp,j; char s[150][20],ts[20]; scanf("%d",&n); for (i=1;i<=n;i++) { scanf("%s",s[i]); scanf("%d",&a[i]); } for (i=1;i<n;i++) for (j=1;j<=n-i;j++) if (((a[j+1]>=60)&&(a[j]<60)) ||((a[j+1]>a[j])&&(a[j]>=60))) { memcpy(ts,s[j],sizeof(ts)...
9
4005
void main() { int n; scanf("%d\n",&n); struct patient { char num[10]; int age; }pa[100],pao[100],pay[100],blank; int i,j=0,k=0; for(i=0;i<n;i++) { scanf("%s",pa[i].num); scanf("%d",&pa[i].age); if(pa[i].age>=60) pao[j++]=pa[i]; else pay[k++]=pa[i]; } int t; for(i=0;i<j;i++) { for(t=i+1;t...
9
4006
int main(){ int i,j=0,k,m,n,e,x,s[100],t[100],v=0; char zfc[100][10],jg[100][10],h[100][10]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s",zfc[i]); scanf("%d",&s[i]); } for(i=0;i<n;i++){ if(s[i]>=60){ t[j]=i; j++; } } for(i=j;i>=0;i--){ ...
9
4007
int n; struct student { int a; struct student *next; char num[20]; }; struct student *creat() { struct student *head,*headtwo,*p1,*p2,*p3,*p4; p1=(struct student *)malloc(sizeof(struct student)); scanf("%s",p1->num); scanf("%d",&p1->a); head=(struct student *)malloc(sizeof(struct student)); head->next=p1; p...
9
4008
struct xinxi { char id[10]; int age; }; struct xinxi old[100]; void main() { int i,n,j; int maxage=0; scanf("%d",&n); for(i=0;i<n;i++) /*???????id???????????????????'\0'????????????????????????????????id,????????????'\0'????????????*/ { scanf("%s %d",old[i].id,&old[i].age); } for(i=0;i<n;i++...
9
4009
int main(){ int n,i,j; char id[NUM][LEN]; int nl[NUM]; char id_old[NUM][LEN],id_young[NUM][LEN]; int nl_old[NUM]; int a=0,b=0; scanf("%d",&n); char ids[LEN]; for(i=0;i<n;i++){ scanf("%s %d",&id[i],&nl[i]); if(nl[i]>=60){ strcpy(id_old[a],id[i]); nl_old[a]=nl[i]; a++; } else{ strcpy(id_youn...
9
4010
int main() { int n,i,s=0,j=0,k=0; struct patient{ int age; char id[10]; }patient[100],old[100],young[100],temp; cin>>n; for(i=0;i<n;i++) { cin>>patient[i].id>>patient[i].age; if(patient[i].age>=60) { old[k]=patient[i]; k++; } else { young[s]=patient[i]; s++; } } for(i=k-1;i>0;i--) ...
9
4011
struct patient { char id[20]; int age; }; int main() { int i,n,j,max,num=0; struct patient a[110],t; scanf("%d",&n); for(i=0;i<n;i++) scanf("%s%d",a[i].id,&a[i].age); for(i=0;i<n;i++) { if(a[i].age>=60) num++; } for(i=0;i<num;i++) { max=i; for(j=i;j<n;j++) { if(a[j].age>a[max].age) { m...
9
4012
int n; struct student { int a; char num[20]; struct student *next; }; struct student *creat() { struct student *head,*headtwo,*p1,*p2,*p3,*p4; p1=(struct student *)malloc(len); scanf("%s%d",p1->num,&p1->a); head=(struct student *)malloc(len); head->next=p1; p2=head; p1->next=NULL; headtwo=(struct student ...
9
4013
main() { int n,k,j,i,age,m,y; int b[1000]; char B[1000][100],C[1000][100],d[1000][100]; char a[1000]; scanf("%d",&n); y=0; k=0; for(i=0;i<=n-1;i++) { scanf("%s %d",a,&age); if(age<60) { strcpy(B[y],a); y++; } ...
9
4014
void main() { struct people { char num[10]; int age; }peo[100],pai[100],temp; int i,n; int j=0; int k=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %d",peo[i].num,&peo[i].age); } for(i=0;i<n;i++) { if(peo[i].age>=60) { pai[j]=peo[i]; j++; } } for(i=0;i<n;i++) { if(peo[i].age<60...
9
4015
void main() {int n; scanf ("%d",&n); struct patient { int num[10];int age;} patient[100]; struct a { int num[10];int age;} a[100]; int i,j=0;int t=0; for (i=0;i<n;i++) scanf ("%s %d",patient[i].num,&patient[i].age); for (i=0;i<n;i++) { if (patient[i].age>=60) {strcpy(a[j].num,patient[...
9
4016
int main() { int n,m=0,t; scanf("%d",&n); char a[n][100],s[n][100],r[100]; int b[n],c[n]; for(int i=0;i<n;i++) scanf("%s %d",a[i],&b[i]); for(int j=0;j<n;j++) { if(b[j]>=60) { c[m]=b[j],strcpy(s[m],a[j]); if(m!=0) ...
9
4017
struct queue { char ID[11]; int age; struct number * next; }; int r=1; struct queue * AppendNewNode(int n); void main() { int n,i,j,a[100]={0},temp; char temp_2[11]={""}; struct queue *head, *p,*pf,*temp_1; scanf("%ld",&n); head=AppendNewNode(n); p=head; while(p!=NULL) { scanf("%s %d\n",&p->ID,...
9
4018
struct p{ char id[10]; int age; }; void bubble(struct p a[100],int n) { int i,j; struct p temp; for(i=0;i<n-1;i++) { for(j=0;j<n-1;j++) { if(a[j].age>=60) { if(a[j+1].age>a[j].age) { temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } else { if(a[j+1].age>=60) { te...
9
4019
struct student { char str[10]; int a; struct student *next; }; struct student *creat(int n) { int i=0; struct student *head; struct student *p1,*p2; p1=p2=(struct student *)malloc(LEN); scanf("%s %d",&p1->str,&p1->a); head=NULL; while(i<n-1) { i=i+1; if(i==1) head=p1; else p2->next=p1; p2=p1; ...
9
4020
int main(){ int i,n,j; char s[100][11],z[11]; int g[100],c; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",s[i],&g[i]); } for(i=0;i<n;i++){ for(j=1;j<n-i;j++){ if(g[j-1]<g[j]&&g[j]>=60){ strcpy(z,s[j-1]);strcpy(s[j-1],s[j]);strcpy(s[j],z); c=g[j-1];g[j-1]=g[j];g[j]=c; } } } for(i=0;i<n-1;i+...
9
4021
void main() { int n,i,j=0,k=0,l; scanf("%d",&n); struct p { char id[10]; int age; }a[n],b[n],c[n],d; for(i=0;i<n;i++) { scanf("%s %d",&a[i].id,&a[i].age); if(a[i].age>=60) {b[j]=a[i];j++;} else {c[k]=a[i];k++;} } for(i=0;i<j-1;i++) for(l=0;l<j-1-i;l++) if(b[l].age<b[l+1].age) ...
9
4022
typedef struct { char id[11]; int age; }MAN; void sort(MAN* array, int nSize) { int i,j; for(i = 0; i < nSize ; i++) { for(j = nSize - 1; j > i; j--) { if( array[j].age >= 60 && array[j].age > array[j-1].age) { MAN temp = array[j]; array[j]= array[j-1]; array[j-1] = temp; } ...
9
4023
int main() { /*------------??------------*/ //????? int m,n; // float f,f1; // double d,d1; //???? int a[101],b[101]; // int a[101][2000]; //????? // char c[6000]; char c[101][11],d[101][11]; // int len; //???? // int r; // float r; // double r; // int r[501]; // int r[200][20]; // char r[5010]; // char r[1010][...
9
4024
struct ill { char id[11]; int age; struct ill*next; }; struct ill*creat(int n) {struct ill*head,*p1,*p2; int i; head=NULL; for(i=0;i<n;i++) {p1=(struct ill*)malloc(sizeof(struct ill)); scanf("%s %d",p1->id,&p1->age); if(i==0)head=p1; else p2->next=p1; p2=p1; } p2->next=NULL; return(head); } struct ill...
9
4025
struct person{ char str[10]; int age; }per[100],per1[100],per2[100]; int main(int argc, char* argv[]) { int n,i,j=0,k=0,x=0,t; char e[10]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",per[i].str,&per[i].age); if(per[i].age>=60){ strcpy(per1[j].str,per[i].str); per1[j].age=per[i].age; j++; } ...
9
4026
int main() { int n,i,age[MAX+10],num[MAX+10]; char id[MAX+10][ID_DIGITS+1]={0}; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s%d",id[i],&age[i]); num[i]=i; } int flag,tempnum,tempage,j; char tempid[ID_DIGITS+1]; for(i=0;i<n-1;i++){ for(j=n-1;j>i;j--){ flag=0; if(age[j]>=60&&age[j-1]<60)flag=1; else...
9
4027
int main(int argc, char* argv[]) { struct patient{ char ID[10]; int age; }pat[100],old[100]; int n,i,j,k=0,a; char b[10]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s%d",pat[i].ID,&pat[i].age); if(pat[i].age>=60){ strcpy(old[k].ID,pat[i].ID); old[k].age=pat[i].age; k++; } } for(i=0;i<k-1;i++)...
9
4028
int main() { int n,i,pass; struct patient { char id[L]; int age; }men[M],temp; scanf("%d",&n); for(i=0;i<n;i++) scanf("%s%d",men[i].id,&men[i].age); for(pass=1;pass<n;pass++) { for(i=n-1;i>pass-1;i--) { if(men[i].age>=60&&men[i].age>men[i-1].age) { temp=men[i]; men[i]=men[i-1]; men[i...
9
4029
struct sick {char name[10]; int age; }; int main() { int n,i,count=0,j; struct sick s[100],a[100],t; char b[3]; gets(b); n=atoi(b); for(i=0;i<n;i++) scanf("%s %d",s[i].name,&s[i].age); if(n==1) printf("%s",s[0].name); else {for(i=0;i<n;i++) if(s[i].age>=60) {a[count]=s[i]; count++; } for(i=0;i...
9
4030
struct patient { char name[10]; int age; }p[100],e,old[100],young[100]; int main() { int n,i,j=0,k=0,o=-1,y=-1; scanf("%d",&n); struct patient p[100],old[100],young[100]; for(i=0;i<n;i++){ scanf("%s %d",p[i].name,&p[i].age); if((p[i].age)>=60){ o++; old[j]=p[i]; j++; }else{ y++; young[k]...
9
4031
struct patient { char id[10]; int age; struct patient *next; struct patient *pre; }; void main() { void f(struct patient **head); struct patient *head,*p1,*p2; int n,i; scanf("%d",&n); p1=(struct patient *)malloc(sizeof(struct patient)); p2=p1;head=p1;p1->pre=NULL; scanf("%s %d",p1->id,&p1->age); for(i=0;i<...
9
4032
void main() { int n,i,j,k; struct patient { char id[10]; int age; }pa[1000],t; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %d",pa[i].id,&pa[i].age); } for(i=0;i<n;i++) { for(j=n-1;j>=0;j--) if(pa[j].age>pa[j-1].age&&pa[j].age>=60) { t=pa[j]; ...
9
4033
int main() { struct peo { char num[10]; int old; struct peo *next; }; struct peo *p,*p1,*p2,*p3,*head1,*head2,*head3; int n,i,j,k; p=p1=p2=p3=head1=head2=head3=(struct peo *)malloc (sizeof(struct peo)); scanf("%d\n",&n); for (i=1;i<=n;i++) { scanf("%s%d",&p1->num,&p1->old); if (i==1) hea...
9
4034
typedef struct { char ID[10]; int age; }patient; patient pat[100]; int cmp(const void*, const void*); int main() { int n; int i; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%s",pat[i].ID); scanf("%d",&pat[i].age); } qsort(pat,n,sizeof(patient),cmp); for (i=0...
9
4035
int main() { int n,i,m,j,k=0,a,b,c,winnum=0,win=2,year; char old[150][100]={0},id[100][100]={0},id0[100]={0},huiche[100]={0}; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s%d",&id0,&year); if(year>=60) { if(old[year][0]==0) { strcpy(old[year],id0); } else { huiche[0]=13; huiche[1]=0;...
9
4036
struct ill { char id[100]; int age; struct ill *next; }; void main() { struct ill *creat(int x); struct ill *p,*head; char *w[1000]; char *temp1; int n,i,j=0,k,temp; int *q; scanf("%d",&n); p=creat(n); head=p; q=(int *)malloc(n*sizeof(int)); for(i=0;i<n;i++) { if((*p).age>=60) {*(q+j)=(*p).age;*(...
9
4037
void main() { struct patient { char ID[10]; int age; }pa[100]; int n,i,t,j,k; char m[10],str[100][100]; int a[100],b[100]={0}; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %d",&pa[i].ID,&pa[i].age); a[i]=pa[i].age; strcpy(str[i],pa[i].ID); } for(i=0,j=0;i<n;i++,j++) { if(a[i]>=60) b[j]=a[i]; ...
9
4038
int main(){ int n, m=0, sz[100], i, j, sz2[100], e; char zf[100][20], f[20], zf2[100][20]; scanf("%d", &n); for(i=0;i<n;i++){ scanf("%s", zf[i]); scanf("%d", &sz[i]); } for(i=0;i<n;i++){ if(sz[i]>=60){ n--; strcpy(zf2[m],zf[i]); sz2[m]=sz[i]; m++; for(j=i;j<=n;j++){ strcpy(zf[j],zf[j+1]);...
9
4039
int main (){ int a[100],e[100],f[100]; char c[100][100],b[100][100],d[100][100],x[100]; int n,p=0,q=0,k,z,i; scanf("%d",&n); for (i=0;i<n;i++){ scanf("%s%d",c[i],&a[i]); if(a[i]>=60){ p++; e[i-q]=a[i]; strcpy(b[i-q],c[i]); } if(a[i]<60){ q++; f[i-p]=a[i]; strcpy(d[i-p],c[i]); } } for ...
9
4040
struct student { char num[10]; int age; }stu[100]; int main() { char c; int n,i,j; struct student*pstu=stu,e; pstu=&stu[0]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",stu[i].num,&stu[i].age); } for(j=0;j<n;j++){if(stu[j].age>=60){ for(i=j;i>0;i--){ ...
9
4041
struct BING { char id[10]; int old; }bing[100],temp; int main() { int i,j,k,n,p,max; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s%d",bing[i].id,&bing[i].old); } for(p=0;;p++){max=-1; for(i=0;i<n;i++){ ...
9
4042
struct pa { char id[11]; int age; struct pa *next; }; struct pa *insert(struct pa *head,struct pa * new1) { struct pa *p0,*p1,*p2; p1=head; p0=new1; if(head==NULL) { head=p0; p0->next=NULL; } else if(p0->age>=60) { while((p1->age>=p0->age)&&(p1->next!=NULL)) { p2=p1; p1=p1->next; } if(...
9
4043
void main() { int i,j=0,k=0,n,n1=-1,n2=-1,old=0; char xiao[100][10]; struct bingren { char id[10]; int age; }; struct bingren a[100]; struct bingren b[100]; struct bingren t; scanf("%d",&n); for(i=0;i<n;i++) scanf("%s%d",a[i].id,&a[i].age); for(i=0;i<n;i++) { if(a[i].age>=60) { b[j]=a[i...
9
4044
int main() { int num,i,j,l;//num?????? scanf("%d",&num); struct inf //?????????ID { char str[10]; int age; }infs[101]; struct f { char *p1; int m1; }old[101];//?????????? for(i=0;i<num;i++) { scanf("%s %d",infs[i].str,&infs[i].age); } for(i=0,j=0;i<num;i++)//???????????????????????????? if(infs...
9
4045
int main() { char s[100][100],a[100][100],b[100]; int n,i,j=0,sz[100],t,c; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",s[i],&sz[i]);} for(i=0;i<n;i++){ if(sz[i]<60){ strcpy(a[j],s[i]); j++;}} for(t=1;t<=n;t++){ for(i=0;i<n-t;i++){ if(sz[i]<sz[i+1]){ c=sz[i+1];sz[i+1]=sz[i];sz...
9
4046
struct patient { char id[10]; int age; struct patient * next; }; int n; struct patient * creat(int x) { struct patient * head; struct patient *p1,*p2; n=0; p1=p2=(struct patient *)malloc(LEN); scanf("%s %d\n",p1->id,&p1->age); head=NULL; while(n!=x) { n=n+1; if(n==1)head=p1; else p2->next=p1; p2=p1; ...
9
4047
int main() { int n,i,j,a[100],b[100],c[100]; char d[100][100]; scanf("%d",&n); for(i=0;i<n;i++) scanf("%s %d",d[i],&a[i]); for(j=0;j<=n;j++) if(a[j]>=60) b[j]=a[j]*1000-j; else b[j]=1000-j; for(j=0;j<=n;j++) c[j]=0; for(i=0;i<n;i++) for(j=0;j<n;j++) if(b[j]>=b[i]) c[i]++; for(i=0;i<n;i++) for(j=0;j<n;j++) if(c[j]==i+1)...
9
4048
struct a { char id[20]; int age; struct a * next; }; struct a * insert(struct a * head,struct a * s)/*??????????????????????*/ { struct a *p0,*p1,*p2; p1=head;/*???*/ p0=s;/*??????*/ if(head==NULL)/*?????*/ {head=p0;p0->next=NULL;} else{ //while((p0->age<p1->age)&&(p1->next!=NULL)) while((p0->age<=p1->age...
9
4049
struct mao { char name[10]; int age; }pat[100]; int main() { int max (int age[100],int n); int n,i,k; int age[100]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",pat[i].name,&pat[i].age); if(pat[i].age>=60) age[i]=200+pat[i].age; else age[i]=101-i; } for(i=0;i<n;i++) { ...
9
4050
int main() { int n,year[100],i,j,year2[100]={0},t,k; char num[100][10],num2[100][10],p; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s",num[i]); scanf("%d",&year[i]); } for(i=0;i<n;i++) { if(year[i]>=60) { for(k=0;k<10;k++) {num2[i][k...
9
4051
struct patient { char No[10]; int age; }grp1[100],grp2[100],grp3[100]; int main() { int n; scanf("%d",&n); int i; for(i=0;i<n;i++) { scanf("%s%d",&grp1[i].No,&grp1[i].age); } for(i=0;i<n;i++) { grp2[i].age=-1; grp3[i].age=-1; } for(i=0;i<n;i++) { if(grp1[i].age>=60) { s...
9
4052
int main() { int c,d,e,f,n,i; char a[100][10]; int b[100]; scanf ("%d",&n); for (i=0;i<n;i++) { scanf ("%s %d",a[i],&b[i]); } for (c=0;c<n;c++) { e=-1; for (i=0;i<n;i++) { if (b[i]>=60) { if (b[i]>e) { ...
9
4053
struct student{ char num[20]; int score; struct student * next; }; int n=0; struct student * creat(int numb); void print(struct student *head); struct student *maopao(struct student *head); int main() { int n; char ch; struct student *head; scanf("%d%c",&n,&ch); head=creat(n); head=maopao(head); print(head); ...
9
4054
struct patient { int age; char id[10]; struct patient *next; }; main() { int n,i,j,a=0,b=0; struct patient *p1,*p2,*head1=NULL,*head2=NULL,*q1,*q2,*temp,*last; scanf("%d",&n); for(i=0;i<n;i++) { p1=(struct patient*)malloc(LEN); scanf("%s %d",p1->id,&p1->age); q1=...
9
4055
struct people { char ID[10]; int age; }; void main() { int n, i, t; struct people peo[100]; struct people old[100]; void bubble(struct people a[100], int n); scanf("%d", &n); for(i=0; i<n; i++) { scanf("%s", peo[i].ID); scanf("%d", &peo[i].age); } t = 0; for(i=0; i<n; i++) { if(peo[i].age>=60) ...
9
4056
int n,i; struct man { char num[10]; int age; int nu; }stu[100]; int f(char *a,int b,int n1,char *c,int d,int n2) {int sum; if(b>=60&&d>=60) {if(b>d) sum=1; else if(b<d) sum=-1; else sum=n2-n1; } else if(b>=60&&d<60) sum=1; else if(b<60&&d>=60) sum=-1; else sum=n2-n1; return(sum); }...
9
4057
struct stu { char name[20]; int age; int order; struct stu *next; }; int main() { struct stu *p,*q,*t,*r,*head; int n,i,j; scanf("%d",&n); head=(struct stu *)malloc(l); q=head; for(i=0;i<n;i++) { p=(struct stu *)malloc(l); scanf("%s %d",p->name,&p->age); p->order=i; q->next=p; q=p; } q->next=NULL...
9
4058
struct Patient{ char id[10]; int age; struct Patient *next; struct Patient *pre; }; struct Patient *creat(int x); struct Patient *sort(struct Patient *); void print(struct Patient *); int main() { struct Patient *patient,*patient2; int n,i; scanf("%d",&n); patient=creat(n); patient2=sort(patient); print(pati...
9
4059
int main() { int n,sz[100],zs[100],i,k=0,m,a; char id[100][10],di[100][10],zfc[10]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %d",id[i],&(sz[i])); } for(i=0;i<n;i++) { if(sz[i]>=60) { zs[k]=sz[i]; strcpy(di[k],id[i]); k++; } } for(m=0;m<k-1;m++) { for(i=0;i<k-1-m;i++...
9
4060
struct people { char num[10]; int age; struct people *next; }; void main() { struct people *head,*p0,*p,*s; head=(struct people *)malloc(sizeof(struct people)); head->next=NULL; int n,i; scanf("%d",&n); for(i=0;i<n;i++) { p0=head; p=p0->next; s=(struct people *)malloc(sizeof(struct people)); s->next=N...
9
4061
struct a { char id[100]; int year; }p[100]; int main() { int n,i,j,k,t=0,r=0; int a[200]={0}; scanf("%d",&n); struct a b[100]; struct a c[100]; struct a temp; for(i=0;i<=n-1;i++) { scanf("%s %d",p[i].id,&p[i].year); } for(i=0;i<=n-1;i++) { if(p[i].year>=60) { b[t]=p[i]; t++; } } for(i=0;i<=...
9
4062
struct f { char *id; char id_[11]; int age; struct f*next; }; struct in { struct f*old; struct f*young; int num; }; int main() { int n,num_; scanf("%d",&n); struct f *p2,*p3; struct in *p1; struct in*cr(int x);//????????????????????? p1=cr(n); p3=p1->young; p2=p1->old; num_=p1->num; void sort (struct f...
9
4063
void main() { int n; int i,j=0,k; int t; int old[100]; int age[100]; char a[100][20]; char a1[100][20]; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%s",a[i]); scanf("%s",a1[i]); } for(i=1;i<=n;i++) { age[i]=atoi(a1[i]); if(age[i]>=60) { old[j]=i; j++; } } for(i=0;i<j;i++) for(...
9
4064
struct x {char a[10]; int b; };struct x y[100]; void main() {int n,i,j,m; char s[10]; scanf("%d",&n); for(i=0;i<n;i++) {scanf("%s %d",&y[i].a,&y[i].b); } for(j=0;j<n-1;j++) for(i=0;i<n-1-j;i++) {if(y[i].b<y[i+1].b&&y[i+1].b>=60) {strcpy(s,y[i].a); strcpy(y[i].a,y[i+1].a); strcpy(y[i+1].a,s); m=y[i].b;...
9
4065
struct s { char a[100]; int b; struct s *next; }; void main() { struct s *p1,*p2,*p0,*head,*insert(struct s *head,struct s *stud),*h; int i,j,k,m,n,t,x; scanf("%d",&n); head=0; p1=(struct s *)malloc(sizeof(struct s));h=(struct s *)malloc(sizeof(struct s)); p2=head=p1; p1->next=0;k=0;j=0; scanf("%s %d",p1->a,...
9
4066
main() { int n,i,j,k,m,l; int age[10000]; char ID[10000][10],order[10000][10]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %d",ID[i],&age[i]); } for(i=0;i<n;i++) { m=0; for(j=1;j<n-i;j++) ...
9
4067
struct patient{ char id[10]; int age; }; void bubble(struct patient p[],int m); void main() { struct patient p[200]; int n,i,t=100; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %d",p[i].id,&p[i].age); if(p[i].age>=60) { p[t]=p[i]; t++; p[i].age=0; } } bubble(p,t); for(i=100;i<t;i++) { ...
9
4068
int main() { struct patient { char id[10]; int age; }; int n, i, j, k; struct patient p[100]; scanf("%d", &n); for(i=0; i<n; i++) scanf("%s%d", p[i].id, &p[i].age); for(i=1; i<n; i++) { if (p[i].age >= 60) { j=0; while(j<i && p[j].age >= p[i].age) j++; if (j < i) { struct patien...
9
4069
int main(){ int i,n,j,k,e,m; int a[100]; char b[100][10]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",&b[i],&a[i]); } for(i=0;i<n;i++){ for(j=n-1;j>i;j--){ if(a[j]>=60&&a[j]>a[j-1]){ m=a[j]; a[j]=a[j-1]; a[j-1]=m; char t[10]; strcpy(t,b[j]); strcpy(b[j],b[j-1]); strcpy(...
9
4070
struct info { char num[10]; int age; }; struct info1 { char num1[10]; int age1; }; int main(int argc, char* argv[]) { struct info patient[101]; struct info1 old[101]; int n; scanf("%d",&n); int i,j; for(i=0,j=0;i<n;i++){ scanf("%s %d",&patient[i].num,&patient[i].age); if(patient[i].age>=60){ strcpy(ol...
9
4071
int main() { int n,t; int i,j=0,k,max; int age[100]; int age2[100]; char string[100][11]; int line[100]; scanf("%d",&n); for(i=0;i<=n-1;i++) scanf("%s %d",string[i],&age[i]); for(i=0;i<=n-1;i++) { if (age[i]>=60) { age2[j]=age[i]; ...
9
4072
int N; struct patient { char ID[20]; int age; struct patient*next; }; struct patient*creat() { struct patient*head,*p1,*p2; int i; p1=(struct patient*)malloc(LEN); scanf("%s %d",p1->ID,&p1->age); p1->next=NULL; head=p1; p2=p1; for(i=1;i<N;i++) { p1=(struct patient*)malloc(LEN); scanf("%s %d",p1->ID,...
9
4073
struct person { char num[11]; int yr; }pe[100],t; int main() { int n,i,e,k; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",pe[i].num,&pe[i].yr); } for(k = 0 ; k < n ; k++){ for(i = 0; i <n-k-1 ; i++){ if((pe[i+1].yr>=60)&&(pe[i].yr<pe[i+1].yr)){ t=pe[i]; pe[i]=pe[i+1]; pe[i+1]=t; } } } ...
9
4074
struct pat { char num[10]; int age; int x; }p[100],P[100],s; int main() { int n,i,j,k; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",p[i].num,&p[i].age); if(p[i].age>=60) p[i].x=p[i].age; else p[i].x=0; } for(i=0;i<n;i++){ s.age=-1; s.x=-1; char k[10]; for(j=0;j<n;j++){ if(s.x<p[j...
9
4075
struct hospital { char ID [13]; int age; struct hospital *next; }; int main() { void change(struct hospital *); int n; scanf("%d",&n); int i; struct hospital *p,*head; p=(struct hospital *)malloc(sizeof(struct hospital)); head=p; for(i=0;i<n-1;i++) { scanf("%s %d",p->ID,&p->age); p->next=(struct hospita...
9
4076
struct Patient{ char id[10]; int age,arranged; }; int main() { int n,i,t=0,j; struct Patient pai[100],orderd[100]; cin>>n; for(i=0;i<n;i++) { cin>>pai[i].id>>pai[i].age; pai[i].arranged=0; } for(i=0;i<n;i++) { if(pai[i].age>=60) { orderd[t]=pai[i]; pai[i].arranged =1; t++; } } for(i=0...
9
4077
main() { int i,k,j,l,n,w,max,old; int q=0; char d[101][10]; int a[101]; int b[101]; int c[101]; scanf("%d",&n); old=0; for(i=1;i<=n;i++) scanf("%s %d",d[i],&a[i]); for(i=1;i<=n;i++) { b[i]=0; if(a[i]>=60) { b[i]=1; old=old+1; } } for(i=1;i<=old;i++) { max=0; for(j=1;j<=n;j++) { if(b[j]==1) { if(a[j]>max) { max=a[j]...
9
4078
void main() { int n, age[100]={0}, i, j, k, old[101]={0}, oldn, youngn; char id[101][20]={0}, oldid[101][20]={0}, youngid[101][20]={0}; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%s%d",id[i],&age[i]); for(i=1,j=1,k=1;i<=n;i++) { if(age[i]>=60) { old[j]=age[i]; strcpy(oldid[j],id[i]); j++; } else ...
9
4079
int main() { int n,i,j,age[100],e; char id[100][10],ex[10]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",id[i],&age[i]); } for(i=n-1;i>0;i--){ for(j=0;j<i;j++){ if((age[j]<age[j+1]&&age[j]>=60)||(age[j]<age[j+1]&&age[j+1]>=60)){ e=age[j]; age[j]=age[j+1]; age[j+1]=e; strcpy(ex,id[j]); ...
9
4080
main() { int n,b[100],d[100],j=0,k,l,t,i; scanf("%d",&n); char a[n][10],c[n][10];//??????? ???????????? for(i=0;i<n;i++) scanf("%s %d",a[i],&b[i]); k=0; for (i=0;i<n;i++) { if(b[i]>=60) { d[k]=b[i]; strcpy(c[k],a[i]); k++; } } ...
9
4081
struct Inf { char c[10]; int a; }; int main() { int n,o=0,y=0,t,i,j; char temp[10]; struct Inf inf[100],old[100],young[100]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s%d",inf[i].c,&inf[i].a); if(inf[i].a>=60) { strcpy(old[o].c,inf[i].c); old[o].a=inf[i].a; o++; } else { strcpy(young[y]...
9
4082
int main() { char id[100][10],a[10]; int n,i,j; int age[100],b; scanf("%d ",&n); for(i=0;i<n;i++) { scanf(" %s %d",&id[i],&age[i]); } for(j=n-1;j>0;j--) { for(i=n-1;i>0;i--) { if(age[i]>=60&&age[i-1]>=60) { if(age[i]>age[i-1]) { strcpy(a,id[i]);b=age[i]; strcpy(id[i],id[i-1]);ag...
9
4083
struct patience { int shunxu; char id[10]; int age; } pa[100]; int main() { int n,i,j,p=60,q=0; scanf("%d",&n); int a[n]; int b[n],c[n]; for(i=0;i<n;i++) { scanf("%s%d",&pa[i].id,&pa[i].age); } for(i=0;i<n;i++){ ...
9
4084
int main() { struct patient{ char ID[10];int a; }p[100],pr; int np,i,k; scanf("%d",&np); for(i=0;i<np;i++){ scanf("%s %d",p[i].ID,&p[i].a); } for(i=0;i<np;i++){ for(k=np-1;k>i;k--){ if(p[k].a>p[k-1].a&&p[k].a>=60){ pr=p[k];p[k]=p[k-1];p[k-1]=pr; } } printf("%s\n",p[i].ID); } return 0; }
9
4085
struct pat { char num[11]; int age; struct pat *next; }; void main() { int n,i; scanf("%d",&n); struct pat *head,*p1,*p2,*pre; p1=(struct pat *)malloc(sizeof(struct pat)); scanf("%s %d",p1->num,&p1->age); head=p1; p1->next=NULL; for(i=1;i<n;i++) { p1=(struct pat *)malloc(sizeof(struct pat)); scanf("%...
9
4086
main() { int i,n,a[100],j; struct patient { char id[10]; int age; } s[100]; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%s%d",s[i].id,&s[i].age); } while (1) { int max=0; for (i=0;i<n;i++) { if (s[i].age>s[max].age) max=i; } if (s[max].age>=60) { printf("%s\n",s[max].id); ...
9
4087
struct patient { char id[11]; int age,seq; struct patient *next; }; main() { int n,n1=0,n2=0,i,j,m,at; char id[10]; struct patient *head1,*head2,*p11,*p12,*p21,*p22,*t,*q; scanf("%d",&n); head1=NULL; head2=NULL; for(i=0;i<n;i++) { scanf("%s%d",id,&at); if(at>=60) { if(head1==NU...
9
4088
main() { int n,i; scanf("%d",&n); char ID[n][10]; int age[n]; for(i=0;i<=n-1;i++) { scanf("%s %d",ID[i],&age[i]); } char ID2[n][10]; int b[n]; int j=0,t,k; for(i=0;i<=n-1;i++) { if(age[i]>=60) { b[j]=age[i]; strcpy(ID2[j],ID[i]); j++; }...
9
4089
main() { int i,j,k,l,m,n; char id[200][200]; int age[100]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %d",id[i],&age[i]); } for(j=200;j>=60;j--) { for(i=0;i<n;i++) { if(age[i]==j) printf("%s\n",id[i]);} } for(i=0;i<n;i++) if(age[i]<60) printf("%s...
9
4090
int main(){ int n,i,t,k; scanf("%d",&n); char a[100][10],c[11]; int b[100]; for(i=0;i<n;i++){ scanf("%s %d",a[i],&b[i]); if(b[i]<60){ b[i]=0; } } for(k=1;k<=n;k++){ for(i=0;i<n-k;i++){ if(b[i]<b[i+1]){ t=b[i]; b[i]=b[i+1]; b[i+1]=t; strcpy(c, a[i]); strcpy(a[i], a[i+1]); strcpy(a[i+1], c); } } } for...
9
4091
int main() { int n,i,y,x=0; struct ID { int age; char a[10]; }ID[201]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s",ID[i].a); scanf("%d",&ID[i].age); } for(i=0;i<n;i++){ if(ID[i].age>=60){ ID[100+x]=ID[i]; ID[i].a[0]='\0'; x++; } } for(i=0;i<x-1;i++){ for(y=0;y<x-1-i;y++){...
9
4092
int main() { int n,i,j,k,b[100]={0},c[100]={0},d[100]={0},e[100]={0}; char a[100][100]; for(i=0;i<100;i++) { b[i]=i; } scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %d",&a[i],&c[i]); if(c[i]>59) { d[i]=c[i]; } else { e[i]=c[i]; } } for(i=0;i<n;i++) { for(j=0;j<n-1;j++) { if(d...
9
4093
struct people { int order; char ID[10]; int age; }per[100]; struct old { int orders; char IDs[10]; int ages; }elder[100]; int main() { int n,i,j,t,m,q,r; char p[10]; int b[100],c[100]; scanf("%d",&n); for(i=0;i<=(n-1);i++) { per[i].order=i; scanf("%s %d",per[i].ID,&per[i].age); b[i]=strlen(per[i...
9
4094
void main(int argc, char* argv[]) { struct student { char ID[10]; int age; } stu[100],stud[100]; int a[100],b[100],i,c,j,x,n; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s",&stu[i].ID); scanf("%d",&stu[i].age); } int k=0; for(i=0;i<n;i++){ if(stu[i].age>=60){a[k]=stu[i].age;b[k]=i;k++;} } f...
9
4095
int main() { int n; int p,q; scanf("%d", &n); struct patient{ char id[20]; int age; }pa1[100],pa2[100],t; int i; for(i=0;i<n;i++) { scanf("%s%d", pa1[i].id, &pa1[i].age); } for(i=0;i<n;i++) { strcpy(pa2[i].i...
9
4096
int main() { int n,i,j,s=0,e,z=0; int a[100],c[100],x[100]; char b[100][10],d[100][10],y[100][10]; char f[100][10]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s %d",b[i],&a[i]); } for(i=0;i<n;i++){ if(a[i]>=60){ c[s]=a[i]; strcpy(d[s],b[i]); s++; }else{ x[z]=a[i]; strcpy(y[z...
9
4097
struct Patient { char id[10]; int age; int num; }patient[100]; int main () { int n; int a,b,c; scanf ("%d", &n); int i,j,k=0; for (i=0;i<=n-1;i++) { scanf ("%s %d", &patient[i].id, &patient[i].age); patient[i].num = i; } int s[100]; for (i=0;i<=99...
9
4098
int main() { int n; int i,j; scanf("%d",&n); char bh[999][999]; int nl[999]; for(i=1;i<=n;i++) { scanf("%s %d",bh[i],&nl[i]); } int pd[999],k=0; for(i=1;i<=n;i++) { if(nl[i]>=60) { k++; pd[k]=i; } } int e; for(i=1;i<k;i++) { for(j=1;j<=k-i;j++) { if (nl[pd[j]]<nl[pd[j+1]]) { ...
9
4099
int main() { struct br { char id[10]; int age; } *patients,t; int n,i,j; scanf("%d",&n); patients=(struct br *)malloc(sizeof(struct br)*n); for (i=0; i<n; i++) { scanf("%s%d", patients[i].id, &patients[i].age); } for (i=0; i<n; i++) { for (j=n-1; j>i; j--) { if (pati...