约瑟夫问题c++

#define  Maxsize 1000
void jose(int n,int m)
{
int mon[Maxsize];
int i,d,count;
for (i=0;i<n;i++)
mon[i]=i+1;
cout<<"Befoue out:"<<endl;
for (i=0;i<n;i++)
cout<<mon[i]<<",";
cout<<endl;
cout<<"After out:"<<endl;
count=0;
i=-1;
//函数的实现
while(count<n)
{
d=0;
while(d<m)
{
i=(i+1)%n;
if (mon[i]!=0)
d++;
}
cout<<mon[i]<<",";
mon[i]=0;
count++;
}
cout<<endl;
}

typedef struct LNode
{
int data;
struct LNode *link;
}LNode,*LinkList;
void jose(int n,int m)
{
LinkList p,pcur;
p=(LinkList)malloc(sizeof(LNode));
//第一只猴子单独拉出来了
p->data=1;
//循环单链表
p->link=p;
pcur=p;
for (int i=1;i<n;i++)
{
LinkList tmp=(LinkList)malloc(sizeof(LNode));
tmp->data=i+1;
tmp->link=pcur->link;
pcur->link=tmp;
pcur=tmp;
}
while(n--)
{
LinkList tmp;
for (int s=m-1;s--;tmp=p,p=p->link);
tmp->link=p->link;
cout<<p->data<<"->";
free(p);
p=tmp->link;
}
cout<<endl;
}