猴子選大王問題

n只猴子圍成一圈，順時針方向從1到n編號。之後從1號開始順時針方向讓猴子從1到m依次報數，凡報到m的出圈，取消資格。下一位再從1開始依次報數，報出m者出圈，最後剩下的就是猴王。問這個猴王原序排在第幾位。

思路：用循環鏈表去做的，主要是熟悉了一下循環鏈表。

// MonkeyKing.cpp : 定義控制檯應用程序的入口點。
//

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

typedef struct Node
{
	int iMonkeyNum;
	Node* next;
}Node,*pNode;

int _tmain(int argc, _TCHAR* argv[])
{
	int i,n,m;
	printf("輸入n個猴子\n");
	scanf("%d",&n);
	printf("輸入m被去除\n");
	scanf("%d",&m);

	pNode phead = (Node*)malloc(sizeof(Node));
	pNode pRear = (Node*)malloc(sizeof(Node));
	pNode pNow = (Node*)malloc(sizeof(Node));
	pNode pBeforeRemoved = (Node*)malloc(sizeof(Node));
	pRear = phead;
	for (i = 0; i<n;i++)
	{		
		pNow = (Node*)malloc(sizeof(Node));
		pNow->iMonkeyNum = i+1;
		pRear->next = pNow;
		pRear = pNow;
	}
	pRear->next = phead->next;
	int iCount = 0;
	pNow = phead->next;

	while(pBeforeRemoved != pBeforeRemoved->next)
	{
		while(iCount < m)
		{
			iCount++;
			pBeforeRemoved = pNow;
			pNow = pNow->next;		
		}
		pBeforeRemoved->next = pNow->next;
		pNow = pBeforeRemoved->next;
		iCount = 0;
	}
	printf("剩下的那個是%d",pNow->iMonkeyNum);
	return 0;
}