VisualC++6.0中《约瑟夫序列》程序注解.docVIP

#include stdio.h #include stdlib.h #define len sizeof ( struct node ) #define A 100 #define B 200 #define M 20 /*初始值*/ struct node { int number; int code; struct node *next; }; struct node *insert( struct node *tail,int number,int code ) /*假设tail就是表尾，返回指向末尾的指针*/ { struct node *p0; p0 = ( struct node * )malloc( len ); p0-number = number; p0-code = code; p0-next = NULL; tail-next = p0; return p0; } struct node *del( struct node *head, int *a ) /*删除从tail数起第a个结点,返回下一个结点地址*/ { int count = 1; int t; struct node *p0; if ( *a==1 ) { t = head-number; while ( head-next-number!=t ) { head = head-next; } p0 = head-next; head-next = p0-next; *a = p0-code; printf( %d\n,p0-number ); free( p0 ); } else { while ( count!=(*a-1) ) { head = head-next; count++; } p0 = head-next; head-next = p0-next; *a = p0-code; printf( %d\n,p0-number ); free( p0 ); } return head-next; } void print( struct node *head ) { struct node *p0 = head; while ( p0-next!=head ) { printf( %d %d\n,p0-number,p0-code ); p0 = p0-next; } printf( %d %d\n,p0-number,p0-code ); printf( \n ); } void main() /*链表使用头结点*/ { struct node *tail,*head; int number = 1; int code = 1; int m = M; int count = 0; /*记录输入人数*/ head = tail = ( struct node * )malloc( len ); tail-code = A; tail-number = B; tail-next = NULL; printf( 输入序号以及对应号码，序号为0时结束。\n ); scanf( %d%d,number,code ); while ( number ) { count++; tail = insert( tail,number,code ); scanf( %d%d,number,code ); } tail-next = head-next; head = head-next; printf( 序号与密码对应如下：\n ); print( head ); while ( head-next!=head ) { m = m%count; head = del( head,m ); count--; } printf( %d\n,head-number ); }