Description: Tasks: a bunch of monkeys have a number, number is 1,2,3 ... m, this group of monkeys (m) of 1-m in accordance with the order around a circle, from the beginning of a number, each number to the first N months, the monkeys will leave this circle, and so on down until the final lap in only a monkey, the monkey is king. Functions: input data: Input m, n (m, n and an integer n <m）
输出形式：中文提示按照m个猴子，数n 个数的方法，输出为大王的猴子是几号 ，建立一个函数来实现此功能
To Search:
File list (Check if you may need any files):
SM.c
Download