猴子选大王。n只猴子围成一圈，从1到m报数，报m的猴子出局。余下的猴子从第m+1只开始继续从1到m报数，报m的猴子出局。第n只猴子报数后，第1只猴子接着报数（因为围成了圈）。待整个圈只剩下一只猴子时，该猴子即为大王。n和m由用户输入，请输出当选大王的猴子的编号。-Monkey king election. n monkeys circle, reported that the number　1 to m, m reported monkeys out. The remaining monkeys　the first m+ 1 started for continued reported that the number　1 to m, m reported monkeys out. After the first n monkeys reported that the number of the first one and then reported that the number of monkeys (since huddled circle). Until the entire ring only when a monkey, the monkey is the king. n and m by user input, output was elected king of the monkey s number.