josephus问题

//=====================================
// f1102.cpp
// Josephus Problem Object-based Solving
//=====================================
#include"jose.h"
#include<iostream>
using namespace std;
//-------------------------------------
int main(){
  cout<<"please input boyNum/interNum/startPos:
";
  int n, m, s;
  cin>>n>>m>>s;
  Jose(n,m).getWinner();
  Jose(n,m,s).getWinner();
  system("pause");
}//====================================

 

//=====================================
// jose.cpp
//=====================================
#include"boyring.h"
#include"jose.h"
#include<iostream>
using namespace std;
//-------------------------------------
Jose::Jose(int boys, int interval, int begin, int wins)
  :n(boys),m(interval),s(begin),w(wins){
  if(n<2 || m<1 || m>=n || s<0 || s>=n || w<1 || w>=n){
    cout<<"data error.
";
    throw exception();
  }
}//------------------------------------
void Jose::getWinner()const{
  cout<<"
There are "<<n<<" boys.
Boys leaved in order:
";
  BoyRing x(n);
  x.countBy(s-1);
  for(int i=1,numinLine=0; i<n-w+1; ++i){
    x.countBy(m);
    cout<<"  "<<x.getNum()<<(++numinLine%10 ? "" : "
");
    x.disengage();
  }
  cout<<"
winners:
";
  x.printAll();
}//------------------------------------

 

//=====================================
// jose.h
//=====================================
#ifndef HEADER_JOSE
#define HEADER_JOSE
class Jose{
  int n, s, m, w;
public:
  Jose(int boys, int interval, int begin=1, int wins=1);
  void getWinner()const;
};//===================================
#endif  // HEADER_JOSE

 

//=====================================
// boyring.h
//=====================================
#ifndef HEADER_BOYRING
#define HEADER_BOYRING
struct Boy{
  int code;
  Boy* next;
};//-----------------------------------
class BoyRing{
  Boy *pBegin, *pivot, *pCurrent;
public:
  BoyRing(int n);
  void countBy(int m);
  int getNum() const;
  void disengage();
  void printAll()const;
 ~BoyRing();
};//===================================
#endif  // HEADER_BOYRING

 

//=====================================
// boyring.cpp
//=====================================
#include"boyring.h"
#include<iostream>
using namespace std;
//-------------------------------------
BoyRing::BoyRing(int n){
  if(n<2)
      throw exception();//抛出异常,是库函数
  pBegin = new Boy[n];
  for(int i=1; i<=n; i++){
    pBegin[i-1].next = &pBegin[i%n];
    pBegin[i-1].code = i;
  }
  pivot = pCurrent = &pBegin[n-1];
}//------------------------------------
void BoyRing::countBy(int m){
  for(int i=1; i<=m; ++i){
    pivot = pCurrent;
    pCurrent = pCurrent->next;
  }
}//------------------------------------
int BoyRing::getNum() const {
  return pCurrent->code;
}//------------------------------------
void BoyRing::disengage(){
  pivot->next = pCurrent->next;
  pCurrent = pivot;
}//------------------------------------
void BoyRing::printAll()const{
  int numinLine = 0;
  Boy* p = pCurrent;
  do{
    cout<<"  "<<p->code;
    if(!(++numinLine%10)) 
        cout<<"
";
    p = p->next;
  }while(p!=pCurrent);
  cout<<"
";
}//------------------------------------
BoyRing::~BoyRing(){
  delete[] pBegin;
}//------------------------------------