约瑟夫问题

#include<iostream>
using namespace std;
typedef int Node_entry;
struct Node{
Node_entry entry;
Node* next;
Node();
Node(Node_entry item,Node*add_on);
};


Node::Node(){
next=NULL;
}
Node::Node(Node_entry item,Node*add_on){
entry=item;
next=add_on;
}


int main()
{
int n,m;
Node *numbers;
    numbers=new Node(1,0);
Node *head=numbers;
    


cin>>n>>m;
for(int i=2;i<=n;i++) {
//numbers=numbers->next;
  Node *p=new Node(i,0);
numbers->next = p;
numbers = numbers->next;
}
numbers->next=head;
numbers=numbers->next;


int a=n;
i=1;
while(a!=1){


if((i+1)%m==0){

Node*q=numbers->next ;
cout<<q->entry<<endl ;
numbers->next=q ->next ;

delete q;
a--;
}
else numbers=numbers->next ;


i++;



}
cout<<numbers->next->entry <<endl;
return 0;
}








错误代码：
#include<iostream>
using namespace std;
typedef int Node_entry;
struct Node{
Node_entry entry;
Node*next;
Node();
Node(Node_entry item);
};
Node::Node()
{
next=0;
}
Node::Node(Node_entry item)
{
entry=item;


}
int main()
{
int n,m;
cin>>n>>m;
Node *numbers;
numbers=new Node(1);
int i,j;
Node *head=numbers;


for(i=2;i<=n;i++){
Node *p=new Node(i);


numbers=numbers->next;
numbers=p;

}
numbers->next=head;
numbers=numbers->next ;
for(i=0;i<n;i++){
cout<<numbers->entry <<endl;
numbers=numbers->next;
}


i=n;
j=1;
while(i!=1){
if((j+1)%m==0){
Node*p=numbers->next;
cout<<p->entry<<endl;
numbers->next=p->next ;
delete p;
i--;
}
else numbers=numbers->next ;
j++;
}
return 0;
}