约瑟夫环.cpp

缺少边界qingduozhijiao

#include<iostream.h>
typedef struct strt //Define jiegouti
{
int num,pwd;//num (man) pwd(password)
struct strt *next;//next crunode
}*psp,sp;
int main()
{
int m,n,i,j;
psp head,rear,pt,pt2,p;
head=new sp;//声明一个结点（head为头结点）
rear=head;
cout<<"n:";//input num(man)
cin>>n;
cout<<"m:";//input the first m(x),
cin>>m;
pt=head;
for(i=1;i<n;i++)//apply for other crunodes
{
pt2=new sp;
pt->next=pt2;
pt=pt2;
rear=pt2;
}
rear->next=head;//circular linked list
pt=head;
for(i=1;i<=n;i++)// Enter input pwd(passwords)...
{
cin>>j;
pt->pwd=j;
pt->num=i;
pt=pt->next;//next
}
pt2=pt=rear;
for(j=1;j<=n;j++)//circular ,break ranks in turns.
{
for(i=1;i<=m;i++)//the next break
{
pt2=pt;
pt=pt->next;
}
p=pt2->next;//output the pwds ,delete crunodes
cout<<"num:"<<p->num<<"pwd:"<<p->pwd<<endl;
m=p->pwd;
pt2->next=p->next;
delete(p);
pt=pt2;
}
return 0;
}