猴子选大王问题

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;}