Write Joseph's ring in C ++ (the second modification) with ultra-Simplified

# Include <stdlib. h>
# Include <iostream. h>
Typedef struct LNode
{Int num, pwd;
Struct LNode * next;
} LNode, * LinkList;
Void main ()
{
Int a, I = 1, m, n, j; // m indicates the upper limit of the number of reports, n indicates the number of people, and j indicates the input password;
Cout <"please enter m :";
Cin> m;
Cout <"please enter n :";
Cin> n;
LinkList head, p, pt;
While (I <= n)
{
Pt = new LNode;
If (I = 1)
{
P = head = pt;
Cout <"please enter the password :";
Cin> j;
P-> num = I;
P-> pwd = j;
I ++;
} Else
{
P-> next = pt;
P = pt;
Cout <"please enter the password :";
Cin> j;
P-> num = I;
P-> pwd = j;
I ++;
}
} P-> next = head;
For (I = 1; I <= n; I ++)
{
For (a = 1; a <m; a ++)
P = p-> next;
Pt = p-> next;
M = pt-> pwd;
Cout <pt-> num <'n ';
P-> next = pt-> next;
Free (pt );
}
}

<