约瑟夫问题

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

typedef struct student
{
    int data;
    student *next;

}node;

node *creat(int n, int a[])
{
    node *head, *p, *s;
    head = (node *)malloc(sizeof(node));
    p = head;
    for (int i = 0; i < n ; i++)
    {
        s = (node *)malloc(sizeof(node));
        s->data = a[i];
        p->next = s;
        p = s;
    }
    head = head->next;
    p->next = head;
    return head;
}


void circle(int step,int n, int input[],int output[])
{
    node *p = (node *)malloc(sizeof(node));
    int k = 0;
    p = creat(n,input);

    while (p->next != p)
    {
        for(int i = 0 ; i < step - 1 ; i++)
        {
            p = p->next;
        }
        step = p->next->data;
        p->next = p->next->next;
        p = p->next;
        output[k] = step;
        k++;
    }
    output[k] = p->data;
    for(int j = 0 ; j < 10 ;j++ )
    {
        printf("%d ",output[j]);
    }
}




int main(void)
{
    int a[]={1,2,3,4,5,6,7,8,9,10};
    int b[10];
    int step = 2;
    printf("数列初始跳步长:%d\n",step);
    printf("输出数组的结果：");
    circle(step,10,a,b);
    return 0;
}