猴子选大王的程序。首先输入猴子的数目m，然后输入每次查猴子的数目n。每数N次删除一个猴子。最后剩下的是大王。用循环单链表实现。-monkey king election procedures. First of all the number of imported monkeys m and then check each number n of monkeys. N times every few delete a monkey. What is left is king. Listless used to achieve single-cycle.