Introduction - If you have any usage issues, please Google them yourself
The monkey king election task: a bunch of monkeys has a number, the number is 1, 2, 3, ... m group the monkeys (m a) in accordance with the order of 1- m sitting around, from the start, every number N, the monkeys will leave this circle, and so on down, until the circle only last a monkey, the monkey king. Requirements: Input data: input m, n. m, n are integers, n <m
输出形式:中文提示按照m个猴子,数n 个数的方法,输出为大王的猴子是几号 ,建立一个函数来实现此功能