#include
using namespace std;
struct Node{
int data;
Node *next;
};
void Josephus()
{ Node *pre,*p,*q,*s;
int n,k,m;
cout<<"总人数:"<
cin>>n;
cout<<"开始报数的编号:"<
cin>>k;
cout<<"退出的序号:"<
cin>>m;
int count=2;
s=new Node;
pre=s;
p=pre->next;
for(int i=1;i
{ s->data=i;
s->next=new Node;
s=s->next;
}
s->data=n;
s->next=pre;
p=pre->next;
for(int i=1;i
{ pre=pre->next;
p=p->next;
}
while(p!=pre)
{ if(count!=m)
{ pre=p;
p=p->next;
count++;
}
else
{ cout<<"出列序号:"<data<
q=p->next;
p->next=q->next;
delete q;
count=0;
}
}
cout<data<<endl;
delete p;
}
int main()
{ Josephus();
return 0;
}
