『每日一题 2012-02-10』猴子选大王问题 C语言实现

#include <stdio.h>
#define NUMBER_OF_MONKEY 9   //猴子数目
#define M 3			//报数时的最大数字
int main()
{
int i=0,postion=-1,num=NUMBER_OF_MONKEY;
int monkey[NUMBER_OF_MONKEY];
for (i=0;i<NUMBER_OF_MONKEY;i++)
{
monkey[i]=1;   //为1时，表示猴子有权利竞选
}
while(num>1)
{
i=0;
while (i<M)
{
postion=(postion+1)%NUMBER_OF_MONKEY;
if (1==monkey[postion])
i++;
}
printf("第%d只猴子被淘汰\n",postion+1);
monkey[postion]=0;
num--;
}
for (i=0;i<NUMBER_OF_MONKEY;i++)
{
if (1==monkey[i])
{
printf("获胜的是第%d只猴子",i+1);
}

}
printf("\n");
}