数据结构课设题目。一堆猴子都有编号，编号是1，2，3 ...m ,这群猴子（m个）按照1--m的顺序围坐一圈，从第1开始数，每数到第N个，该猴子就要离开此圈，这样依次下来，直到圈中只剩下最后一只猴子，则该猴子为大王。

该程序是数一个固定的数字。有详细的注释。-Topic-based data structure classes. A bunch of monkeys have a number, number is 1,2,3 ... m, this group of monkeys (m a) in accordance with the 1- m lap around the order, from No. 1 to start a few, every few months to the first N , the monkeys will leave this circle, and so on down until the final lap in only a monkey, the monkey for the king. The program is a fixed number of figures. There are detailed notes.