josephus.cpp

Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m

#include<iostream>
using namespace std;
int Josephus(int *People,int n,int m){
    int i=-1,j=0,k=1;
    cout<<"依次被淘汰的数为:";
    while(1){
          for(j=0;j<m;){
               i=(i+1)%n;
               if(People[i]!=-1)
                   j++;
          }
           if(k==n)
            break;
           cout<<People[i]<<",";
           People[i]=-1;
           k=k+1;
    }
    cout<<endl;
    cout<<"最后留下的数为:";
    return(People[i]);
}
int main(){
    int *allPeople,j,k,l;
    cout<<"请输入j和k的值(中间以空格隔开):";
    cin>>j>>k;
    if((allPeople= new int[j])!=NULL){
        cout<<"从1到您输入的数的排列顺序为:";
        for(l=0;l<j;l++){
            cout<<l+1<<",";
            allPeople[l]=l+1;
		}
          cout<<endl;
          cout<<Josephus(allPeople,j,k);
          cout<<endl;
    }
    system("pause");
}