Josephus问题 围圈删除

#include<iostream>
#include<fstream>
using namespace std;
class LinearList{
int length;
int MaxSize;
int *element;
public:
LinearList(int MaxListSize=100){
MaxSize=MaxListSize;
length=0;
element=new int[MaxSize];
}
~LinearList(){
delete []element;
}
bool IsEmpty(){
return length==0;
}
int Length(){
return length;
}
void insert(int k,int x){

for(int i=length-1;i>=k;i++)
element[i+1]=element[i];
element[k]=x;
length++;
}
void Delete(int k){

for(int i=k;i<length;i++)
element[i-1]=element[i];
length--;
}
int search(int k){
return element[k-1];
}
void output(int n,int m){
if(m>n){
cout<<endl;
return;
}
int *b=new int[n];
int i,j=0,k=0;
bool wh=true;
for(i=0;i<n;i++)
insert(i,i+1);
while(Length()>1){
k=k+m;
wh=true;
if(k>Length()){
k=k%Length()-1;
wh=false;
}
if(k<=0){
k+=Length();
wh=false;
}
if(wh&&j)
k--;