约瑟夫环

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>

typedef struct Node{
    int ser;//序号 
    int num; //密码 
    Node *next;
}Node, *LinkList;

LinkList CreateCList(int n){//创建单向循环链表 
    Node *pre, *rear;
    LinkList CL;
    pre = rear = CL = (Node*)malloc(sizeof(Node));
    for(int i = 1; i <= n; i++){
        rear->ser = i;
        scanf("%d", &rear->num);
        pre->next = rear;
        pre = rear;
        rear = (Node *)malloc(sizeof(Node));
    }    
    free(rear);
    pre->next = CL;
    printf("\n");
    return CL;
}

void ShowList(LinkList CL){//展示 
    for(Node *p = CL; p != NULL; p = p->next){
        printf("%d\n", p->num);
    }
    printf("\n");
}

void Solve(LinkList CL, int m, int n){//m为初始报数上线，n为总人数 
    Node *p1, *p2, *t;
    p1 = p2 = CL;
    p2 = p2->next; 
    while(p2->next != CL){//首先要找到第一个报数得前一个，以防第一次报数上线为1 
        p2 = p2->next;
    }
    int num = 1;
    while(n--){//直到n个人全部出列为止
        while(num != m){
            p2 = p1;
            p1 = p1->next;
            num++;
        }
        t = p1;
        printf("%d\n", p1->ser);
        p2->next = p1->next;
        p1 = p2->next;
        m = t->num;
        free(t);
        num = 1;
    }
}

int main(){
    LinkList CLa;
    CLa = CreateCList(7);
    Solve(CLa,20, 7);
    return 0;
}