约瑟夫问题

#include<stdio.h>//约瑟夫问题
#include<stdlib.h>
typedef struct Node
{
	int data;
	Node* next;
}*linklist, node;
void Init(linklist* L, int n)//初始化并建立一个没有头结点
                             //的循环链表
{
	linklist s, r;
	(*L) = (linklist)malloc(sizeof(node));
	if (!(*L)) exit(0);

	(*L)->next = (*L);
	(*L)->data = 1;
	r = (*L);
	for (int i = 2; i <= n; i++)
	{
		s = (linklist)malloc(sizeof(node));
		s->data = i;

		s->next = (*L);
		r->next = s;
		r = s;
	}
}
void Josephus(linklist& L, int n, int m)
{
	linklist q = L;


	int i;
	for (i = 1; i <= n; i++)
	{
		for (int j = 0; j < m - 2; j++)
		{
			q = q->next;
		}
		linklist temp;
		temp = q->next;
		q->next = temp->next;
		printf("第%d个被杀掉的人是：%d\n", i, temp->data);
		free(temp);
		q = q->next;
	}
}
int main()
{
	linklist L, r;
	int n, m;
	scanf("%d%d", &n, &m);
	Init(&L, n);
	Josephus(L, n, m);
	return 0;
}