label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
9 | 4300 | void main()
{
struct people
{
char id[30];
int age;
}x[100],y[100],z;
int a,b,c,e,i,j=0,k=0,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",x[k].id,&x[k].age);
if(x[k].age>=60)
{
y[j].age=x[k].age;
strcpy(y[j].id,x[k].id);
j=j+1;
k=k-1;
}
k=k+1;
}
for(i=0;i<j;i++)
for(k=0;k<j-i-1;k++)
if(y[k].... |
9 | 4301 |
int main(){
struct patient{
char id[11];
int age;
} patients[100],old[100],young[100],jh;
int n,i,j,d,k;
j=-1;
d=-1;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",patients[i].id,&patients[i].age);
}
for(i=0;i<n;i++){
if(patients[i].age>=60){
d++;
old[d]=patients[i];
... |
9 | 4302 | struct patient
{
char ID[10];
int age;
struct patient *next;
};
struct patient * insert(struct patient *head,struct patient *another)
{
struct patient *p0,*p1,*p2;
p1=head;
p0=another;
if(p0->age<60)
{
while(p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
p1->next=p0;
p0->next=NULL;
}
else
{
while(... |
9 | 4303 |
struct patient
{
char id[11];
int age;
struct patient *next;
};
int main()
{
struct patient *head;
struct patient *create(int n);
void sort(struct patient *head);
int n;
scanf("%d",&n);
head=create(n);
sort(head);
return 0;
}
struct patient *create(int n)
{
... |
9 | 4304 |
struct bingren{
char id[20];
int age;
}bing[100]={'\0', 0};
struct laoren{
char oid[20];
int oage;
}lao[100]={'\0', 0};
void main()
{
int n, i, j=0, l;
struct laoren temp;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%s", bing[i].id);
scanf("%d", &bing[i].age);
}
for(i=0;i<n;i++)
{
if(bing[i].age>=60... |
9 | 4305 |
struct a60
{
char ID[10];
int age;
}a60[101];
struct u60
{
char ID[10];
int age;
}u60[100];
void sort(int n)
{
int i;
struct a60 *x;
for(i=1;i<n;i++)
{
for(x=a60; x<a60+n-i; x++)
{
if(x->age < (x+1)->age)
{
a60[100]=*x;
... |
9 | 4306 | struct ill
{
char num[20];
int age;
int turn;
struct ill *next;
};
void run(struct ill *head,int age,int turn,char *num)
{
struct ill *pre,*p,*s;
s=(struct ill *)malloc(sizeof(struct ill));
pre=head;
p=pre->next;
strcpy(s->num,num);
s->turn=turn;
s->age=ag... |
9 | 4307 | int main()
{
int n,a,i,j,sgh,sgh60;
sgh=0;
sgh60=0;
char d[10];
struct guahao
{
char ID[10];
int age;
}
gh[100],gh60[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",d,&a);
if(a>=60)
{
strcpy(gh60[sgh60].ID,d);
gh60[sgh60].age=a;
sgh60=sgh60+1;
}else
{
strcpy(gh[sgh].ID,d);
... |
9 | 4308 | 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",&yea... |
9 | 4309 | int main()
{
int n,i,j,k,m,t,b[100],e[100];
char a[100][20],c[100][20],d[100][20],str[20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",a[i],&b[i]);
for(i=0,j=0,k=0;i<n;i++)
{
if(b[i]>=60)
{
strcpy(c[j],a[i]);
e[j]=b[i];
j++;
... |
9 | 4310 |
struct pat
{
char id[30];
int age;
int num;
int flag;
struct pat *next;
struct pat *ns;
};
int n;
void sort(struct pat *head)
{
int i,j;
struct pat *q,*p,*max;
q=head;
for(i=0;i<n;i++)
{
p=head->next;
while(1)
{
if(p->flag)
break;
p=p->next;
}
max=p;
while(1)
{
if((p->num)>(ma... |
9 | 4311 | void main()
{
struct patient
{
char ID[10];
int age;
};
struct patient pat[100];
int n,i,j,huan;
char string[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pat[i].ID,&pat[i].age);
}
for(i=0;i<n;i++)
{
if(pat[i].age>=60)
{
for(j=i;j>0;j--)
{
if(pat[j].age>pat[j-1]... |
9 | 4312 | void main()
{
char ID[100][10]={'\0'},young[100][10]={'\0'},old[100][10]={'\0'},wae[100]={'\0'};
int age[100]={0},y[100]={0},o[100]={0};
int i,n;
int m=0,k=0,temp=0;
int a,b;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",ID[i],&age[i]);
for(i=0;i<n;i++)
{
if(age[i]<60)
{
strcpy(young[m],ID[i]);
y[m... |
9 | 4313 | int m=0;
struct patient
{
char id[32];
int age;
struct patient *next;
};
struct patient *find(struct patient *head)
{
struct patient *p,*ppre;
p=head;
while (p&&p->age>=60)
{
ppre=p;
p = p->next;
}
return ppre;
}
struct patient *create(int n)
{
struct patient *head=... |
9 | 4314 | void main(){
struct br{
char id[10];
int age;
}br[100], lr[100], temp;
int i, n, m, j;
scanf("%d", &n);
for(i=0, j=0; i<n;i++){
scanf("%s %d", br[i].id, &br[i].age);
if(br[i].age>=60){
lr[j]=br[i];
j++;
}
}
m=j;
for(i=1;i<m;i++){
for(j=1;j<=m-i;j++){... |
9 | 4315 | int main()
{
int n,i,j=0,m=0;
scanf("%d",&n);
char s1[100][10],s2[100][10],p1[100][10],p2[100][10],z1[100][10],z2[100][10],t[10];
for(i=0;i<n;i++)
{
scanf("%s",s1[i]);
scanf("%s",s2[i]);
}
for(i=0;i<n;i++)
{
if(s2[i][1]!='\0'&&strcmp(s2[i],"60")>=0)
{
strcpy(p1[j],s1[i]);
strcpy(... |
9 | 4316 | struct bing
{
char id[10];
int age;
int num;
}bing[100],temp;
int main ()
{
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&bing[i].id,&bing[i].age);
bing[i].num=i+1;
}
for(j=0;j<=n;j++)
{
for(i=0;i<n-1;i++)
{
if(bing[i+1].age>=60&&bing[i].age<bing[i+1].age)
{
temp=bing[i+1];
... |
9 | 4317 | struct Node;
typedef struct Node *pNode;
struct Node
{
int x;
char id[20];
pNode next;
};
pNode create()/*??head*/
{
pNode p;
p=(pNode)malloc(sizeof(struct Node));
p->next=NULL;
return p;
}
void sort(pNode head,int n)/*head???????n???*/
{
pNode p=NULL,q=NULL,s=NULL;
int i;
for (i=1;i<=n;i++)
{
s=(... |
9 | 4318 | int main()
{
struct student
{ char as[10];
int ag;
};
struct student stu[100];
struct student st[100];
struct student temp;
int n,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",stu[i].as,&stu[i].ag);
j=0;
for(i=0;i<n;i++){
if(stu[i].ag>59){
st[j]=stu[i];
stu[i].ag=0;
j++;
}
}
for(k=1;k<j;k++){
for(i=0;... |
9 | 4319 | struct person
{
char c[10];
int a;
struct person *next;
};
int main()
{
int i,n;
struct person *head,*p1,*p2,*p,*p0,*p3;
scanf("%d",&n);
i=0;
head=NULL;
while(i<n)
{
p1=(struct person*)malloc(len);
scanf("%s %d",p1->c,&p1->a);
if(i==0) { head=p1;p2=p1;}
else
{
p2->next=p1;
p2=p1;
}
i++;... |
9 | 4320 | struct bingren
{
char id[20];
int nian;
struct bingren *next;
};
int main()
{
int n,i;
struct bingren *p1,*head;
struct bingren temp;
char a[20]={'\0'};
int b=0;
scanf("%d",&n);
head=(struct bingren *)malloc(sizeof(struct bingren));
head->next=NULL;
scanf("%s%d",head->id,&head->nian);
p1=head;
for(i=1;i<n... |
9 | 4321 | int main()
{
int n,i,j=0,k,l;
struct patient
{
char num[10];
int age;
}p[100],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
do{scanf("%c",&p[i].num[j]);j++;}
while(p[i].num[j-1]!=' ');
p[i].num[j-1]='\0';
scanf("%d",&p[i].age);
j=0;
}
for(i=0;i<n;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(p[j].age>p[k].age) k=j;
if... |
9 | 4322 | int main()
{
int n,h,i,j,k,s,t,p;
scanf("%d",&n);
int a[n-1],c[n-1];
char string[n-1][10],b[n-1][10];
for(h=0;h<=n-1;h++)
{
scanf("%s %d",string[h],&a[h]);
}
for(p=0,j=0;p<=n-1;p++)
{
if(a[p]>=60)
{
c[j]=a[p];
strcpy(b[j],string[p]);
... |
9 | 4323 | void main()
{
struct patient
{
char ID[16];
int age;
int index;
};
int n,i,j,t,t1;
char str[16];
scanf("%d",&n);
struct patient pat[n];
for(i=0;i<n;i++)
{scanf("%s %d",pat[i].ID,&pat[i].age);
pat[i].index=i;}
for(i=0;i<n;i++)... |
9 | 4324 | int main()
{
int n,i,j,temp,m=0;
int patage[100];
struct patient
{
char num[20];
int age;
};
struct patient pat[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",pat[i].num,&pat[i].age);
for(i=0,j=0;i<n;i++)
if(pat[i].age>=60)
{
patage[j]=pat[i].age;
j++;
m++;
}
for(i=0;i<m;i++)
for... |
9 | 4325 | struct Patient
{
char num[10];
int age;
struct Patient *next;
};
int main()
{
void paixu(int n,struct Patient *head);
struct Patient *creat(int n);
int n,i;
struct Patient *head;
scanf("%d",&n);
head=creat(n);
paixu(n,head);
for(i=0;i<n;i++)
{
printf("%s\n",head->num);
head=head->next;
}
}
struct Pa... |
9 | 4326 | typedef struct Node
{
char ID[11];
int age;
struct Node *next;
}node;
node *creat(int n)
{
node *p1,*p2,*head;
int i;
p1=p2=(node *)malloc(sizeof(node));
head=p1;
for(i=0;i<n;i++)
{
p2=p1;
scanf("%s%d",p1->ID,&p1->age);
p1=(node *)malloc(sizeof(node));
p2->next=p1;
}
p2->next=NULL;
return(head);
}
v... |
9 | 4327 | struct student
{
char num[10];
int age;
}line[100];
void main()
{
int n,i,j,k,temp=0,m,e;
scanf("%d",&n);
int a[100]={0},b[100]={0};
char s[100][10],y[100][10];
char exchange[10];
for(i=0;i<n;i++)
{
scanf("%s%d",line[i].num,&line[i].age);
}
for(i=0;i<n;i++)
{
if(line[i].age>=60)
{
temp++;
}
}
j... |
9 | 4328 | struct stu
{char num[20];
int score;
struct stu * next;
};
void sort(struct stu * head,struct stu * q)
{
struct stu *pre=head,*p=pre->next,*s;
s=(struct stu *)malloc(sizeof(struct stu));
s->score=q->score;strcpy(s->num,q->num);
s->next=NULL;
if(s->score>=60){
while((p!=NULL)&&(q->score<=p->score))
{
pre=p;
p... |
9 | 4329 | int main()
{
int i,n,f=0,m=0,j;
struct
{
char id[10];
int age;
} bingren[100],t[100],l[100],c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",&bingren[i].id,&bingren[i].age);
}
for(i=0;i<n;i++)
{
if(bingren[i].age>=60)
t[f++]=bingren[i];
else if(bingren[i].age<60)
l[m++]=bingren... |
9 | 4330 | struct ID{
char idnum[100];
int old;
};
int main(){
struct ID ido[100];//???????
struct ID idy[100];//???????
struct ID id[100];//???????
struct ID e;
int n,i,a=0,b=0,j,l,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",id[i].idnum,&(id[i].old));
if(id[i].old>=60){/... |
9 | 4331 | int main()
{
int n,i,j,t,m,l;
int b[100],d[100],g[100];
char a[100][10],c[100][10],e[10],f[100][10];
m=0;
l=0;
t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",a[i],&b[i]);
}
for(i=0;i<n;i++)
{
if(b[i]>=60)
{
strcpy(c[m],a[i]);
... |
9 | 4332 |
int main()
{
struct Patient
{
int flag;
char id[10];
int age;
};
struct Patient p[100],p2[100],temp;
int n,i,t=0,k,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&p[i].id,&p[i].age);
p[i].flag=0;
if(p[i].age>=60)
{
t=t+1;
p[i].flag=1;
}
p2[i]=p[i];
}
/*
for(i=0;i<n-1;i++)
{
k=... |
9 | 4333 | struct patient
{
char num[10];
int age;
}a[100];
void main()
{
int max(int b[],int m);
int n,i,j=0,c[100],g;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%s%d",&a[i].num,&a[i].age);
for(i=0;i<n;i++)
c[i]=a[i].age;
g=max(c,n);
while (g>=60)
{
for(i=0;i<n;i++)
{if (c[i]==g)
... |
9 | 4334 | struct student{
char num[20];
int age;
struct student *next;
};
int n,i;
struct student *create()
{
struct student *head;
struct student *p1,*p2;
head=NULL;
scanf("%d",&i);
n=0;
p1=p2=(struct student *)malloc(len);
scanf("%s %d",p1->num,&p1->age);
while(n!=i-1)
{
n++;
if(n==1)
head=p1;
else
p2->nex... |
9 | 4335 | struct patient{
char ID[10];
int age;
};
void paixu(struct patient pat[],int n)
{
struct patient t;
int i;
int k;
for(k=1;k<n;k++){
for(i=0;i<n-k;i++){
if(pat[i].age<pat[i+1].age){
t=pat[i];
pat[i]=pat[i+1];
pat[i+1]=t;
}
}
}
}
int main()
{
struct patient pat;
struct patient oldpat... |
9 | 4336 |
struct patient
{
char ID[10];
int age;
struct patient *next;
};
struct patient *creat(void)
{
struct patient *head;
struct patient *p1,*p2;
int num;
scanf("%d",&num);
p2=NULL;
p1=(struct patient *)malloc(LEN);
head=p1;
while(num>0)
{
... |
9 | 4337 | main()
{
struct p
{char num[100];
int age;
} p[101];
int n,i,j,k,m=0;
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%s %d",&p[i].num,&p[i].age);
struct q
{char num[100];
int age;
} q[101];
for(i=1,j=1;i<=n;i++) {if(p[i].age>=60) {strcpy(q[j].num,p[i].num);q[j].age=p[i].age;j... |
9 | 4338 | struct pat
{
char num[10];
int age;
}pat[100],str[100],t;
int main()
{
int n,i,j,a=-1,temp;
int ch[100];
char c[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",pat[i].num,&pat[i].age);
if(pat[i].age>=60)
{
a++;
strcpy(str[a].num,pat[i].num);
str[a].age=pat[i].age... |
9 | 4339 | int main()
{
char string[100][100];
int age[100];
int age1[100];
int a[100];
int max,n,l,i,j,k,x;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",string[i],&age[i]);
j=0;
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
... |
9 | 4340 | int main()
{
int a[100],b[100],c[100],n,i,j,lao=0,you=0,t;
char e[100][10],f[100][10],g[100][10],s[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%d",e[i],&a[i]);
for(i=0;i<n;i++)
{
if(a[i]>=60)
{
b[lao]=a[i];
strcpy(f[lao],e[i]);
lao++;
}
else
{
c[you]=a[i];
strcpy(g[you],e[i]);
you... |
9 | 4341 | int main()
{
char s[100][10];
int n,z[100];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s%d",s[i],&z[i]);
}
for(int j=120;j>=60;j--)
{
for(int t=0;t<n;t++)
{
if(z[t]==j)
{
... |
9 | 4342 | int main()
{
int n,i,j;
scanf("%d",&n);
struct point
{
char id[10];
int age;
}
points[100],news[100],tmp;
for(i=0;i<n;i++)
{
scanf("%s %d",&points[i].id,&points[i].age);
}
for(i=n-1;i>=0;i--)
{
for(j=0;j<i;j++)
{
if(points[j+1].age>=60&&points[j+1].age>points[j].age)
{
tmp=points[j+1];
... |
9 | 4343 |
struct data
{
char id[11];
int age;
struct data *next;
};
void main ()
{
int i,n,k=0;
struct data *p1,*p2,*head;
struct data * sort( struct data *head,int n);
void print(struct data *head);
scanf ("%d",&n);
head=p1=p2=(struct data *)malloc(LEN);
head->next=NULL;
for (i=0;i<n;i++)
{
p1=(struct data *)malloc... |
9 | 4344 |
int main()
{
int n;
struct ren
{
char id[10];
int age;
} p[100];
struct ren t;
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",p[i].id,&p[i].age);
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(p[j].age<p[j+1].age && p[j+1].age>=60)
{
t=p[j];
p[j]=p[j+1];
p[j+1]=t;
... |
9 | 4345 | struct person
{
char id[20];
int y;
};
void main()
{
int n,i,j,m=0,k=0;
struct person t,*s,o[1000],y[1000];
scanf("%d",&n);
s=(struct person *)malloc(n*sizeof(struct person));
for(i=0;i<n;i++)
scanf("%s %d",s[i].id,&s[i].y);
for(i=0;i<n;i++)
if (s[i].y>=60) {o[k]=s[i];k++;}
else {y[m]=s[i];m++;}
for(i=0;... |
9 | 4346 | struct huanzhe
{char id[11];
int age;
}sick[110];
int panduan(int *p1,int *p2,int a,int b);
void paixu(int *p3,int *p4,int c);
int main(int argc, char* argv[])
{
int n,i,pan;
int ji[110]={1};
int zhangzhe[110];
int *pointer1,*pointer2;
pointer1=ji;
pointer2=zhangzhe;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%... |
9 | 4347 | struct pat{
char ID[10];
int age;
};
int main()
{
int n,i;
scanf("%d",&n);
struct pat * p[100];
struct pat * old[100];
struct pat * young[100],*temp;
for(i=0;i<n;i++){
p[i]=(struct pat*)malloc(len);
scanf("%s %d",p[i]->ID,&p[i]->age);
}
int k=0,j=0;
for(i=0;i<n;i++){
if(p[i]->age>=60){
old[k]=p[... |
9 | 4348 | int main (){
int a[100],e[100],f[100];
char c[100][100],b[100][100],d[100][100],x[100];
int n,p=-1,q=-1,k,z,i;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%s %d",c[i],&a[i]);
if(a[i]>=60){
p++;
e[p]=a[i];
strcpy(b[p],c[i]);
}
if(a[i]<60){
q++;
f[q]=a[i];
strcpy(d[q],c[i]);
}
}
for (k=1;... |
9 | 4349 | int main()
{
int n,i,j=0,k=0,a,e,f,b;
char id[N][11],ido[N][11],idy[N][11],m[11];
int nl[N],nlo[N];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",id[i],&nl[i]);
if(nl[i]<60)
{
strcpy(idy[j],id[i]);
j++;
}
if(nl[i]>=60)
{
... |
9 | 4350 |
struct patient{
char ID[10];
int age;
};
void bubble(struct patient * a[],int n);
void main()
{
int n,i,s=0;
struct patient p[100]={"0",0};
struct patient * pt[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&p[i].ID,&p[i].age);
pt[i]=&p[i];
}
bubble(pt,n);
for(i=0;i<n;i++)
{
if(pt[i]->a... |
9 | 4351 | int main(){
int i,j,n,k=0,b[100],c=0,eb;
char a[100][10],ea[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",a[i],&b[i]);
for(j=0;j<n;j++){
for(i=n-1;i>j;i--){
if(b[i]>b[i-1]&&b[i]>=60){
eb=b[i];
b[i]=b[i-1];
b[i-1]=eb;
strcpy(ea,a[i]);
strcpy(a[i],a[i-1]);
strcpy(a[i-1],ea);
}
}
}
f... |
9 | 4352 | struct p
{
char i[10];
int a;
struct p *next;
};
void main()
{
struct p *p1,*p2,*head,*head2,*q1,*q2;
int n,i,k=0,b=0,x=0;
scanf("%d",&n);
p1=p2=(struct p *)malloc(len);
scanf("%s %d",p1->i,&p1->a);
for(i=0;i<n;i++)
{
k++;
if(k==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct p *)malloc(len);
... |
9 | 4353 |
struct Patient
{
char id[10];
int age;
}a[100],e,b[100];
int main()
{
int n,J;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)
{
scanf("%s %d",a[i].id,&a[i].age);
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(a[j].id>a[j+1].id)
{
e=a[j];a[j]=a[j+1];a[j+1]=e;
}
}
}
j=0;
for(i=0;i<n;i++)
{
... |
9 | 4354 | int main()
{
int num,j,i,n,max,count,a[100];
//int order[100];
char s[100][10];
scanf("%d",&num);
for( i = 0;i < num;i++)
{
scanf("%s %d",s[i],&a[i]);//???s[i][10](?????)??s[i](??????)
}
n = 0;
for(count = 0;count < num;count++)
{
max = 59;
for(i = 0;i<num; i++)
... |
9 | 4355 | struct pa{//patient
char id[10];
int age;
int re;//register
}p[100],po[100],temp;
void main()
{
int n,i,j,pj=0,oldj=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",p[pj].id,&p[pj].age);
if(p[pj].age>=60)
{
po[oldj]=p[pj];
po[oldj].re=oldj;
oldj++;
}
else
{
p[pj].re=pj;
pj++;
}
}
... |
9 | 4356 | void main()
{
int n,i,b[100],c[100],j=0,k,mid,p,m=0,max;
struct patient
{
char id[20];
int age;
}a[100];
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++]=i;
}
else c[m++]=i;
}
for (i=0;i<j;i++)
{
max=i;
for (k=i;k<j;k++... |
9 | 4357 | int main()
{
char s[100][10];
int a[100],b[100],i,n,k,l,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d",s[i],&a[i]);
b[i]=a[i];
}
for(k=n-1;k>0;k--)
{
for(i=0;i<k;i++)
{
if(b[i]>b[i+1])
{
l=b[i];
b[i]=b[i+1];
b[i+1]= l;
}
}
}
i=n-1;
while(b[i]>=60)
{
for(j=0;j<n;j++)
... |
9 | 4358 | void main(){
int n,i,j,mid;
char M[11];
scanf("%d",&n);
struct patient{
char ID[11];
int age;
};
struct patient *per=(struct patient*)malloc(sizeof(struct patient)*n);
for(i=0;i<n;i++)
scanf("%s%d",per[i].ID,&per[i].age);
for(j=0;j<n;j++)
for(i=0;i<n-1;i++){
if(per[i].age<60&&per[i+1].age>=60){
m... |
9 | 4359 | int main()
{
int n,j,i;
scanf("%d",&n);
char a[n][10];
int b[n];
for(j=0;j<n;j++)
scanf("%s %d",a[j],&b[j]);
for(i=100;i>=60;i--)
{
for(j=0;j<n;j++)
{if(b[j]==i)
printf("%s\n",a[j]);
}
... |
9 | 4360 | struct information
{
char ID[10];
int age;
}*a;
void main()
{
int n,i,j,max,p,q=0;
scanf("%d",&n);
a=(struct information *)malloc(sizeof(struct information)*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>59) q++;
}
for(i=0;i<q;i++)
{
max=0;
for(j=0;j<n;j++)
{
... |
9 | 4361 |
char id[101][11];
int main()
{ int n;
int age[101],a[101];
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%s%d",id[i],&age[i]);
int j=i;
if (age[i]>=60)
{
for (;j>1&&age[a[j-1]]<age[i];j--)
a[j]=a[j-1];
}
a[j]=i;
}
for (i... |
9 | 4362 | int main(){
int age[N], n, i, k;
char id[N][LEN];
scanf("%d", &n);
for(i = 0; i < n; i++){
scanf("%s %d", id[i], &(age[i]));
}
int e; char e_id[10];
for(k = 1 ; k <= n; k++){
for(i = 0; i < n- k; i++){
if((age[i] <60&& age[i+1]>=60)||(age[i]>=60&&age[i+1]>=60&&age[i]<age[i+1])){
e = age[i+1];
strcpy(e_i... |
9 | 4363 | int n;
struct patients
{
char name[11];
int age;
}pat[100];
struct patold
{
char name[11];
int age;
}old[100];
struct patyoung
{
char name[11];
int age;
}young[100];
int y=0,o=0;
char nametemp[11];
int agetemp;
int main()
{
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&pat[i].name);
scanf("%d",... |
9 | 4364 | int main()
{
struct patients
{
char id[10];
int age;
}temp;
struct patients patient[100];
struct patients old[100];
int i,j,n,first;
scanf("%d",&n);
first=0;
for (i=0;i<n;i++){
scanf("%s",patient[i].id);
scanf ("%d",&patient[i].age);
if (patie... |
9 | 4365 |
struct st
{
int age,he;
char num[15];
struct st *next;
};
struct st *creat(int n)
{
struct st *head,*p1,*p2;
int i,h=105;
p1=(struct st *)malloc(sizeof(struct st));
p2=p1;
head=p1;
for (i=1;i<=n;i++)
{
p1=(struct st *)malloc(sizeof(struct st));
scanf("%s %d",p1->num,&p1->age);
if (p1->age >= 60)
p1... |
9 | 4366 |
struct p
{
char id[11];
int age;
};
int main()
{
void sort(int n,struct p a[101]);
int n,i;
struct p a[101];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",&a[i].id,&a[i].age);
}
sort(n,a);
return 0;
}
void sort(int n,struct p a[101])
{
... |
9 | 4367 | int main()
{
int i,n,t=0,e,num=0,k;
char z[10];
struct point
{
char ID[10];
int age;
}a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&a[i].ID);
scanf("%d",&a[i].age);
}
for(i=0;i<n;i++)
{
if(a[i].age>=60)
{
num=num+1;
}
}
int f=num;
for(i=0;i<n;i++)
{
if(a[i].age>=60)
{... |
9 | 4368 | struct patient
{
char id[20];
int age;
struct patient *next;
}*head,*p1,*p2;
struct patient *order(int n)
{
int i,j,t;
char a[20];
for(i=0;i<n-1;i++)
{
p1=head;p2=p1->next;
for(j=0;j<n-1-i;j++)
{
if(p2->age>=60&&p1->age<p2->age)
{
t=p1->age;p1->age=p2->age;p2->age=t;
strcpy(a,p1->i... |
9 | 4369 |
int main()
{
int n,i,j;
struct s
{char id[10];
int age;
};
struct s S[100],Si;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",S[i].id,&S[i].age);
}
for(i=0;i<n-1;i++){
for(j=0;j<n-i-1;j++){
if(S[j+1].age>=60){
if(S[j].age<S[j+1].age){
Si=S[j];
S[j]=S[j+1];
S[j+1]=Si;
}
}
}
... |
9 | 4370 |
struct man
{
char id[20];
int a;
struct man *next;
}*p,*head,*q;
void main()
{
struct man * insert(struct man *head,struct man *ill);
int n,i;
scanf("%d",&n);
head=NULL;
for(i=0;i<n;i++)
{
p=(struct man*)malloc(LEN);
scanf("%s %d",p->id,&p->a);
head=insert(head,p);
}
q=head;
while(q!=NULL)... |
9 | 4371 | struct person
{char ID[10];
int age;
}person[100];
void main()
{
int i,j=-1,k,n,max;
char s[100][10],a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&person[i].ID,&person[i].age);
for(i=0;i<n;i++)
{a[i]=person[i].age;
if(person[i].age>=60) j++;}
for(k=0;k<=j;k++)
{
max=0;
for(i=0;i<n;i++)
... |
9 | 4372 |
int main()
{
int n,i,t;
int u=0,k=0;
int a[N],b[N];
char s[N][10],h[N][10],j[N][10];
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%s %d", &s[i],&a[i]);
if(a[i]>=60){
b[u]=a[i];
strcpy(h[u],s[i]);
u++;
}
else{
strcpy(j[k],s[i]);
k++;
}
}
for(i=u-1;i>0;i--){
for(t=0;t<i;t++){
if(b[t]<b... |
9 | 4373 | void main()
{
int n,i,j,a[100],b[100],c[100]={0},t,sum=0;char s[100][10],sb[100][10],st[10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",s[i],a+i);if(a[i]>=60)
{
c[i]=1,b[sum]=a[i],strcpy(sb[sum],s[i]),sum++;
}}
for(i=1;i<sum;i++)for(j=0;j<sum-i;j++)if(b[j]<b[j+1])t=b[j],b[j]=b[j+1],b[j+1]=t,strcpy(st,sb... |
9 | 4374 | struct ren
{
char id[12];
int ye;
struct ren *next;
};
int main()
{
int n;
char c[12];
int y;
int r;
struct ren *p1, *p2,*head;
int i;
scanf("%d", &n);
head = (struct ren *)malloc(sizeof(struct ren));
scanf("%s %d", c, &y);
strcpy(head->id, c);
head->ye = y;
head->next = 0;
for (i = 2; i <= n; i++)
{
... |
9 | 4375 |
struct patients
{
int num;
char ID[10];
int age;
};
int main()
{
int n,i,j,y,o;
struct patients list[100],young[100],old[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
list[i].num=i;
scanf("%s %d",list[i].ID,&list[i].age);
}
y=0;
o=0;
for(i=0;i<n;i++)
{
if(list[i].age>=60){
old[o]=list[i];
o... |
9 | 4376 | struct node
{
char s[100];
int age,no;
}a[1000],b;
int check(int x,int y)
{
if(a[y].age<60 && a[x].age>=60) return 0;
if(a[y].age>=60 && a[x].age<60) return 1;
if(a[x].age<60 && a[y].age<60 && a[x].no>a[y].no) return 1;
if(a[x].age<60 && a[y].age<60 && a[x].no<a[y].no) return 0;
if(a[x].age>a[y].age) return 0;
if(a[x].... |
9 | 4377 | int main()
{ int n,i,j,k;
scanf("%d",&n);
struct p{
char num[100];
int age;
}pa[100],p[100],t;
for(i=0;i<n;i++)
{scanf("%s%d",&pa[i].num,&pa[i].age);}
i=n-1;
for(j=n-1;j>=0;j--)
{
if(pa[j].age<60)
{p[i]=pa[j];
i--;}
}
k=i+1;
for(j=n-1;j>=0;j--)
{
if(pa[j].a... |
9 | 4378 | main()
{
int n,i,j,k,temp,s,max;
int is_over_sixty_exist=1;
int age[100]={0},queue[100]={0};
char id[100][10]={'0'};
scanf("%d",&n);
for (i=0;i<n;i++){
queue[i]=i;
scanf("%s%d",id[i],&age[i]);
}
i=0;
while (is_over_sixty_exist){
max=0;
is_over_sixty_exist=0;
temp=queue[i];
for (j=0;j<n;j++)... |
9 | 4379 | int main()
{
int n,i,j,k,s,m,t,p,r;
int a[100],b[100];
char str1[100][10],str2[100][10];
char string[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",str1[i],&a[i]);
for(p=0,s=0;p<n;p++)
{
if(a[p]>=60)
{
b[s]=a[p];
strcpy(str2[s],str1[p]);
s=s+1;
}
}
for(k=... |
9 | 4380 | main()
{
int a,b,d[100],e,f,g,i,j,x,y,z;
char c[100][100]; //g?60?????
scanf("%d",&a);
for(b=0;b<a;b++)
{
scanf("%s %d",c[b],&d[b]);
}
for(e=0;e<a;e++)
{
if(d[e]>=60)
{i=e;
... |
9 | 4381 |
int main(){
int n,i;
scanf("%d",&n);
struct{
char id[10];
int age;
}br [100],*p,old[100],*q;
for(p=br;p<br+n;p++){
scanf("%s%d",&(p->id),&(p->age));
}
q=old;
int js=0;
for(p=br;p<br+n;p++){
if(p->age>=60){
q->age=p->age;
strcpy(q->id,p->id);
q++;
js++;
p->age=0;
}
}
int max=0;
for... |
9 | 4382 | main ()
{
int a,b,c,d,i,j,l,m;
scanf("%d",&a);
int f[a];
int h[a];
int n[a];
int k[a];
int o[a];
char g[a][10];
for (i=0;i<a;i++)
{
scanf("%s %d",g[i],&f[i]);
}
j=0;
for (i=0;i<a;i++)
{
if (f[i]>=60)
{
... |
9 | 4383 | struct bing
{
char id[20];
int age;
};
int main()
{
struct bing b[100],sixup[100],sixdown[100];
struct bing temp;
int m;
int n,l;
int i,j;
scanf("%d",&m);
for(i=0;i<=m-1;i++)
{
scanf("%s%d",b[i].id,&b[i].age);
}
n=0;l=0;
for(i=0;i<=m-1;i++)
{
if(b[i].age>=60)
{
sixup[n]=b[i];
n++;
}
else
... |
9 | 4384 | int main()
{
int n,i,j,k;
int age[1000],a[1000],t;
char ID[1000][1000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %d",&ID[i],&age[i]);
j=n-1;
k=0;
for(i=n-1;i>=0;i--)
{
if(age[i]<60)
{
a[j]=i;
j--;
}
}
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
a[k]=i;
k++;
}
}
for(i=... |
9 | 4385 | main()
{ char temp_0[10],id[100][10];
int i,j,n,max,age[100],num[100],yes[100],ncount=1,temp,num_1;
scanf("%d",&n);
for(i=0;i<n;i++)
{num[i]=i;
scanf("%s %d",id[i],&age[i]);
}
for(j=0;j<n;j++)//????????????
{
for(i=0;i<n-j-1;i++)... |
9 | 4386 | struct patient
{
char id[10];
int age;
struct patient *next;
};
int n;
struct patient *creat(int num) /*????*/
{
struct patient *head,*p1,*p2;
n=0;
p1=p2=(struct patient *)malloc(sizeof(struct patient));
scanf("%s %d",p1->id,&p1->age);
head=NULL;
while(n<(num-1))
{
n=n+1;
if(n==1)head=p1;
else p2->next... |
9 | 4387 | struct pa
{
char num[10];
int age;
}p[105],t,a[105];
int main()
{
int i,k,n,c,d;
scanf("%d",&n);
k=0;
for(i=0;i+k<n;)
{
scanf("%s%d",p[i].num,&p[i].age);
if(p[i].age>=60) {a[k]=p[i];k++;}
else i++;
}
for(c=0;c<k-1;c++)
{
for(d=0;d<k-1;d++)
{
if(a[d].age<a[d+1].age){t=a[d];a[d]=a[d+1];a[d+1]=t;}
... |
9 | 4388 | int main(){
int n;
scanf("%d",&n);
struct xinxi{
char id[10];
int year;
}xinxi[100],b[100],p;
int i,j,k,a=0,c=0;
for(i=0;i<n;i++){
scanf("%s %d",xinxi[i].id,&(xinxi[i].year));
}
for(i=0;i<n;i++){
if((xinxi[i].year)>=60){
b[a]=xinxi[i];
a++;
}
}
for(k=1;k<a;k++){
for(j=0;j<a-k... |
9 | 4389 | void main()
{
int n,i,j,k,m=0,sum=59;
int a[100],b[100];
char c[101][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d",c[i],&a[i]);
if(a[i]>=60) m++;
}
for(j=0;j<m;j++)
{
for(i=0;i<n;i++)
{
if(a[i]>sum)
{
sum=a[i];
k=i;
}
else continue;
}
a[k]=-1;
b[j]=k;
sum=59;
}
for... |
9 | 4390 |
int main (){
int i, n,j=0,e,x,a=0,k;
int y[100],year[100];
char id[10],t[100][10],ee[10],p[100][10];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",id,&x);
if(x>=60){
y[j]=x;
strcpy(t[j],id);
j++;
}
else {
year[a]=x;
strcpy(p[a],id);
a++;
}
}
for(k=1;k<=j;k++){
... |
9 | 4391 |
int main()
{
struct people{
char num[10];int age;
} peo1[100],peo2[100],peo3[100],e;
int n,i,j,m,k;
scanf("%d",&n);
char s[100][10];
for(i=0;i<n;i++)
{
scanf("%s",peo1[i].num);
scanf("%d",&peo1[i].age);
}
j=0;
m=0;
for(i=0;i<n;i++)
{
if(peo1[i].age>=60)
{
peo2[j]=peo1[i];
j++;
... |
9 | 4392 | int main()
{
struct m{
char id[10];
int year;
}p[100],a[100],tmp;
int n,i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",p[i].id,&p[i].year);
if(p[i].year>=60){
a[k]=p[i];
k++;
p[i].year=0;
}
}
for(i=0;i<k;i++){
for(j=k-1;j>i;j--){
if(a[j].year>a[j-1].year){
tmp=a[j-1];
a[j-1]=a[j];
... |
9 | 4393 | struct {
char ID[10];
int nian;
}patient[100],old[100],qita[100],temp;
int main()
{
int n,i,k,e,num,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d",patient[i].ID,&patient[i].nian);
}
num=0;
for(i=0;i<n;i++){
if(patient[i].nian>=60){
num=num+1;
}
}
k=0;
for(i=0;i<n;i++){
if(patient[i].nian>=60){
old[k]=... |
9 | 4394 | struct person
{
char id[20];
int age;
};
void main()
{
int n,i,j,m=0,k=0,z;
struct person t,*s,*o,*age;
scanf("%d",&n);
s=(struct person *)malloc(n*sizeof(struct person));
o=(struct person *)malloc(n*sizeof(struct person));
age=(struct person *)malloc(n*sizeof(struct person));
for(i=0;i<n;i++)
{scanf("%s %d",... |
9 | 4395 |
struct patient
{
char name[20];
int age;
} line[202], temp;
int main()
{
int n, i, j;
scanf("%d", &n);
for(i=1;i<=n;i++)
{
scanf("%s", &line[i].name);
scanf("%d", &line[i].age);
}
for(i=1;i<=n;i++)
{
for (j=n;j>i;j--)
{
if(line[j].age>... |
9 | 4396 | int main()
{
int a[100],i,e,k;
char id[100][10],p[10];
int n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d",id[i],&a[i]);
}
for(k=1;k<=n;k++){
for(i=n-1;i>k-1;i--){
if(a[i]>a[i-1]&&a[i]>=60){
e=a[i];
a[i]=a[i-1];
a[i-1]=e;
strcpy(p,id[... |
9 | 4397 | int main (){
char p[200][10],q[200][10]={0},c[10];
int a[200],b[200];
int n,i,j,x,y,t;
scanf ("%d",&n);
for (i=0;i<n;i++){
scanf ("%s",p[i]);
scanf ("%d",&a[i]);
}
j=0;
x=0;
t=0;
y=0;
for (i=0;i<n;i++){
if (a[i]>=60){
b[j]=a[i];
strcpy(q[j],p[i]);
j++;
t++;
}
}
for (j=t-1;j>0;j--){
for (i=0;i<j;i++){
if (b[i]<b... |
9 | 4398 |
int main()
{
int n,age[100],i,j,k=0,e0,m,a;
int AGE[100];
char id[100][10];
char ID[100][10];
char e[100][10];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%s %d",&id[i],&age[i]);
m=strlen(id[0]);
for(i=0;i<n;i++) id[i][m]='\0';
for(i=0;i<n;i++)
{
if(age[i]>=60)
{
for(a=0;a<=m;a++) ID[k][a]=id[i][a];
... |
9 | 4399 | int main(){
struct man
{
char a[11];
int y;
}man[100];
int n;
scanf("%d",&n);
char b[11];
int y;
int i,j;
char c[100][11];
int m=0,k=0;
for(i=0;i<n;i++){
scanf("%s%d",b,&y);
if(y>=60){
strcpy(man[k].a,b);
man[k].y=y;
k++;
}
else{
strcpy(c[m],b);
m++;
}
}
for(i=1;i<k;i++){
for... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.