Joseph Loop

设有顺序编号为1至n的n个人，按顺时针顺序站成一个圆圈。首先从第一个人开始，从1开始顺时针报数，报到第m(<n)个人，令其出列。然后再从出列的下一个人开始，从1顺时针报数，报到第m个人，再令其出列，……，如此下去，直到圆圈不再有人为止。求这n个人出列顺序。

数组方式一 (使用一个结构体)：

/*2010-4-23 wcdj数组的方法*/#include <iostream>using namespace std;typedef struct People{int num;bool mark;// 0 and 1, 1 stands for out}ppl;int main(){// initializecout<<"Enter n and m (m<n): "<<endl;int n,m;cin>>n>>m;ppl *szPeople=new ppl[n];for (int i=0; i!=n; ++i){szPeople[i].num=i+1;szPeople[i].mark=false;}// print every peopleint count=0;int time=0;while (1){for (int i=0; i!=n; ++i){if (szPeople[i].mark==true)// this has been out, go to the next{continue;}else{++count;}if (count==m){cout<<szPeople[i].num<<" ";++time;szPeople[i].mark=true;count=0;}}if (time==n){break;}}cout<<endl;// deletedelete []szPeople;return 0;}

数组方式二 (数组中元素初始化为1~n，为0表示此人out)：

/*2010-4-23 wcdj数组的方法2 (数组中元素初始化为1~n，为0表示此人out)*/#include <iostream>using namespace std;int main(){// initializecout<<"Enter n and m (m<n): "<<endl;int n,m;cin>>n>>m;int *szPeople=new int[n];for (int i=0; i!=n; ++i){szPeople[i]=i+1;}// print every peopleint count=0;int time=0;while (1){for (int i=0; i!=n; ++i){if (szPeople[i]==0)// this has been out, go to the next{continue;}else{++count;}if (count==m){cout<<szPeople[i]<<" ";++time;szPeople[i]=0;// mark this man has been outcount=0;}}if (time==n){break;}}cout<<endl;// deletedelete []szPeople;return 0;}

链表方式 (构造一个循环链表)：

/*2010-4-23 wcdj链表的方法*/#include <iostream>using namespace std;typedef struct Node{int num;struct Node *next;}LNode,* LinkList;// make loop LinkList, return the last pointerLinkList MakeLoop(int n){LinkList head, tail, p;head=tail=p=NULL;for (int i=1; i!=n+1; ++i){p=(LinkList)malloc(sizeof(LNode));if (p==NULL){cerr<<"error: malloc node"<<endl;return NULL;}p->num=i;if (head==NULL){head=tail=p;head->next=NULL;} else{tail->next=p;tail=p;}}// make looptail->next=head;return head;}int main(){cout<<"Enter n and m (n>m): "<<endl;int n,m;cin>>n>>m;// special caseif (m==1){for (int i=1; i!=n+1; ++i){cout<<i<<" ";}cout<<endl;}// initializeLinkList head=MakeLoop(n);LinkList p=head, cur=NULL;while (p){for (int i=1; i!=m-1; ++i){p=p->next;}cur=p->next;// cur mark the m_th nodecout<<cur->num<<" ";// delete this nodep->next=cur->next;p=p->next;// next nodeif (p==cur)// the last node{p=NULL;}free(cur);cur=NULL;}cout<<endl;return 0;}