猴子选大王c++实现：n只猴子围坐成一个圈，按顺时针方向从1到n编号。然后从1号猴子开始沿顺时针方向从1开始报数，报到m的猴子出局，再从刚出局猴子的下一个位置重新开始报数，如此重复，直至剩下一个猴子，它就是大王。(N monkey sitting around in a circle, numbered from 1 to n clockwise.Then start from 1 monkeys along the clockwise direction starting from 1 count off, report to m monkey out, again from the next position of just out of the monkey started to count off, so repeatedly, until the remaining a monkey, it is the king of judah.)