用链表实现约瑟夫问题（c/C++）

#include<iostream>
using namespace std;
#include<Cstring>
struct LNode
{
int no;
struct LNode *next;
};
int main()
{
int n,m,s;
cout<<"n=";
cin>>n;
cout<<"m=";
cin>>m;
cout<<"s=";
cin>>s;
LNode *first,*last;
first=last=new LNode;
first->no=1;
int i,k,c;
for(i=1;i<n;i++)//构造链表
{
LNode *p=new LNode;
p->no=i+1;
last->next=p;
last=p;
}
last->next=first;//构成环形链表
for(i=1;i<s;i++)//第s个孩子作为开始计数的小孩
{
first=first->next;
last=last->next;
}
k=n;
while(k>1)
{
for(c=1;c<m;c++)
{
first=first->next;
last=last->next;
}
last->next=first->next;//第m个孩子出列
cout<<first->no<<"\t";
delete first;
first=last->next;
k--;
}
cout<<endl<<"The winner is No"<<first->no;
delete first;
return 0;
}