C语言使用链表解决约瑟夫问题

问题描述：共n个人围成一个圈进行报数，报到第k个数的人自杀，然后剩下的人重新开始报数，直到最后剩下一个人为止。此程序使用链表模拟了整个游戏过程。

#include<stdio.h>
#include<stdlib.h>
#pragma warning(disable:4996)
struct life
{
	int n;
	struct life* next;
};
int main()
{
	struct life* head, * p, * q;
	head = (struct life*)malloc(sizeof(struct life));
	if (head == NULL)
	{
		printf("malloc error!\r\n");
		return 0;
	}
	p = head;
	head->next = NULL;
	int n, k;
	printf("输入总人数和自杀者报数：");
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n + 1; i++)
	{
		struct life* man = (struct life*)malloc(sizeof(struct life));
		man->next = NULL;
		man->n = i;
		p->next = man;
		p = p->next;
	}
	p->next = head->next;
	int i = 0, s = 0;
	printf("自杀顺序为：\n");
	while (i <= n)
	{
		p = p->next;
		s++;
		if (s == k - 1)
		{
			printf("%d\t", p->next->n);
			if ((i + 1) % 15 == 0)printf("\n");
			q = p;
			p = q->next;
			q->next = p->next;
			free(p);
			p = q;
			s = 0;
			i++;
		}
	}
	return 0;
}