一堆猴子都有编号，编号是1，2，3 ...m ,这群猴子（m个）按照1--m的顺序围坐一圈，从第1开始数，每数到第N个，该猴子就要离开此圈，这样依次下来，直到圈中只剩下最后一只猴子，则该猴子为大王。-monkeys have a pile of numbers, numbers 1, 2, 3 ... m, these monkeys (m) In accordance with the 1 -- m sitting in the order in a circle, starting from a few every few months to the first N, The monkeys will be leaving this ring, and so on down until the circle only last a monkey, the monkey king to.