3 yuesefu.cpp

数据结构的必做编程题

#include<stdio.h> 
#include<malloc.h>
typedef struct node 
{int no; 
struct node *link; 
}NODE; 
create_link(NODE *p,int n) 
{NODE *q; 
for(;n>1;n--) 
{q=(NODE*)malloc(sizeof(NODE)); 
q->no=n; 
q->link=p->link; 
p->link=q; 
} 
} 
NODE *select_no(NODE *p,int s) 
{NODE *q; 
for(;s>2;s--) 
p=p->link; 
q=p->link; 
p->link=q->link; 
printf("%d\t",q->no); 
free(q); 
return(p->link); 
} 
main() 
{NODE *p;int n,m,s; 
p=(NODE*)malloc(sizeof(NODE)); 
p->no=1;p->link=p; 
printf("How many children are there?\n"); 
scanf("%d",&n); 
create_link(p,n); 
printf("From where would you like to count:\n"); 
scanf("%d",&m); 
for(;m>1;m--) 
p=p->link; 
printf("How many do you want to count?\n"); 
scanf("%d",&s); 
if(s==1)printf("no sense"); 
else 
{printf("OUTPUT:\n"); 
for(;n>0;n--) 
p=select_no(p,s); 
} 
}