约瑟夫问题 设有N个人围坐一圈，现从某人开始报数， 数到M的人出列，接着从出列的下一个人重新报数，数到M的人...

#include"stdio.h" #include"conio.h" #include"malloc.h" #define LEN sizeof(Node) #define true 1 #define false 0 typedef struct tagNode { int Number; struct tagNode *next; }Node; int n; void DeleteNode(Node *pre,Node *p) { pre->next=p->next; free(p); } int IsFinished(Node *p) { if(p->next==p) return true; else return false; } Node *CreateList(void) { Node *head; Node *p1,*p2; n=0; printf("构建链表以0结束符号：\n"); p1=p2=(struct tagNode *)malloc(LEN); //开辟一个新单元 scanf("%d",&p1->Number); head=NULL; while(p1->Number!=0) { n=n+1; if(n==1)head=p1; else p2->next=p1; p2=p1; p1=(struct tagNode *)malloc(LEN); scanf("%d",&p1->Number); } p2->next=head; return head; } void Josehus(Node *head,int Counter) { Node *pre,*p; int Number=1; p=pre=head; while(!IsFinished(pre)) { while(Number!=Counter) { p=pre; pre=pre->next; Number++; } printf("%d ",pre->Number); DeleteNode(p,pre); pre=p->next; Number=1; } printf("%d\n",pre->Number); } int main() { int Counter; Node *head; head=CreateList(); printf("Input Your Counter:\n"); scanf("%d",&Counter); while((Counter<1)||(Counter>5)) { printf("Input Error!Please Input 1<=Counter <=5:\n"); scanf("%d",&Counter); } printf("输出出列的编号：\n"); Josehus(head,Counter); }