#include<iostream>
using namespace std;
struct Node
{
    int data;
    Node *next;
};
Node *CreateList(Node *L,int &n);
void Joseph(Node *L,int n,int m);
Node *DeleteList(Node *&L,int i,Node *q);
int main()
{
    Node *L;
    L=NULL;
    int n,m;
    cout<<"请输入人数N:";
    cin>>n;
    if(n<1) {cout<<"请输入正整数!";}
    else
    {
        cout<<"请输入密码M:";
        cin>>m;
        if(m<1) {cout<<"请输入正整数!";}
        else
        {
            L=CreateList(L,n);
            Joseph(L,n,m);
        }
    }
    system("pause");
    return 0;
}
Node *CreateList(Node *L,int &n)
{
    Node *q;
    for(int i=1;i<=n;i++)
    {
        Node *p;
        p=new Node;
        p->data=i;
        p->next=NULL;
        if(i==1)
            L=q=p;
        else
        {
            q->next=p;
            q=q->next;
        }
    }
    q->next=L;
    if(L!=NULL)
        return(L);
    else
        cout<<"尾指针异常!"<<endl;
}
void Joseph(Node *L,int n,int m)
{
    cout<<"\n出列顺序:\n";
    for(int i=1;i<n;i++)
    {
        Node *q=new Node;
        q=DeleteList(L,m,q);
        cout<<"号数:"<<q->data<<endl;
        delete(q);
    }
    cout<<"号数:"<<L->data<<endl;
    delete L;
}
Node *DeleteList(Node *&L,int i,Node *q)
{
    Node *p,*m;
    p=L;
    if(i==1)
    {
        m=p->next;
        while (m->next!=L)
            m=m->next;
        m->next=p->next;
        q=L;
        L=m->next;
        return q;
    }
    else
    {
        int j=1;
        while(j<i-1)
        {
            p=p->next;
            j++;
        }
        q=p->next;
        p->next=p->next->next;
        L=p->next;
        return(q);
    }
}

这是用的C++写的，我一直用C，C++的一些编写代码习惯看着不习惯，来学习的

兴许把i改成m更好理解
Node *DeleteList(Node *&L,int m,Node *q)
{
    Node *p,*r;//***** r是需要删除的结点。
    p=L;
    if(m==1)//***密码为1，逐个删除
    {
        r=p->next;
        while (r->next!=L)
            r=r->next;
        r->next=p->next;
        q=L;
        L=r->next;
        return q;
    }
    else
    {
        int j=1;
        while(j<m-1)
        {
            p=p->next;
            j++;
        }
        q=p->next;    //删除报数为m的
        p->next=p->next->next;
        L=p->next;
        return(q);
    }
}
代码命名要好理解，多写注释。。。