约瑟夫问题（环中有一个做杀手，即每次都跳过）

#include"Joseph.h" #include<iostream> using namespace std; #include<stdlib.h> void Create(Joseph &h, int n) //构造循环链表 { Joseph rear,p; int i; if(n>0) { for(i=1;i<=n;i++) { p=(JsfNode *)malloc(sizeof(struct JsfNode)); p->num=i; p->pass=h->pass; if(i==1) { h=p; rear=p; } else { rear->next=p; rear=p; } } rear->next=h; } } void Delete(Joseph &h,int m) { Joseph p; Joseph q; int i; p=h; cout<<"the order of who was killed is:"<<endl; while(p->next->next!=p) { for(i=1;i<=m-1;i++) { q=p; p=p->next; } if(p->num==p->pass) { p=p->next; q=q->next; } cout<<p->num<<endl; q->next=p->next; free(p); p=q->next; } cout<<"the last alive people is:"<<p->num<<endl; cout<<"so you must be sit at "<<"\t"<<p->num<<"and you can alive at last"<<endl; }