# include <stdio.h>
# include <malloc.h>
 
typedef struct Node
{
	int number;
	struct Node * pNext;
}NODE, *PNODE;
 
PNODE creat_list(int n);
 
int main (void)
{
	int n,m,s;
	printf("約瑟夫環(huán)問(wèn)題：\n");
	printf("設(shè)有n（編號(hào)為“0 1 2 3 .....n-1 n”）個(gè)人圍坐一圈,現(xiàn)從第s個(gè)人開(kāi)始報(bào)數(shù)，數(shù)到m的人出列,\n求最后的出列順序。\n");
	printf("請(qǐng)?jiān)O(shè)置n, s, m ：\n");
	printf("n = ");
	scanf("%d", &n);
	printf("s = ");
	scanf("%d", &s);
	printf("m = ");
	scanf("%d", &m);                    //問(wèn)題引導(dǎo)提示代碼段
 
 
	PNODE pHead = NULL;
	pHead = creat_list(n); 
    pHead->number = 1;                   //創(chuàng)建單鏈表
 
	PNODE p = pHead;                       //定義頭指針
	int i,j,k;                            //定義循環(huán)參數(shù)
	for(j = 1; j < s; j++)
		{
			p = p->pNext;
		}                                //第一個(gè)循環(huán)確定第一個(gè)報(bào)數(shù)的人在循環(huán)單鏈表中的位置  
 
	for(i = 1; i <= n; i++)              //外部循環(huán)代表遍歷到最后一個(gè)所需要的循環(huán)次數(shù)
	{
		for(k = 1; k < m; )              //內(nèi)部循環(huán)代表遍歷出列的人
		{
			if(p -> pNext -> number != 0)
			{
				p = p -> pNext;
				k++;
			}
			else
			{
				p = p -> pNext;
			}
		}
		printf("%d  ",p -> number);
		p -> number = 0;
	    do
		{
		    p = p -> pNext;
		}while(p -> number == 0); 
	}
	printf("\n");
	
	return 0;
}
PNODE creat_list(int n)                        //單鏈表的創(chuàng)建
{
	PNODE pHead = (PNODE)malloc(sizeof(NODE));
    PNODE pTail = pHead;
	int i;
    for(i = 2; i <= n; i++)
	{
		PNODE pNew = (PNODE)malloc(sizeof(NODE));
		pNew->number = i;
		pTail->pNext = pNew;
		pNew->pNext = pHead;
		pTail = pNew;
	}
	return pHead;
}