单项链表模拟约瑟夫环

#include <iostream>
using namespace std;

typedef struct LNode
{
    int num,code;
    struct LNode *next;
}LNode,*List;

void InitList(List &L)
{
    L = new(LNode);
    L->next = NULL;
}

void Insert(List &L,int i,int n)
{
    List p,q;
    p = L;
    q = new(LNode);
    q->num = i;
    q->code = n;
    if(i == 1)
    {
        L->next = q;
        q->next = q;
        return;
    }
    else
    {