约瑟夫斯问题求解（约瑟夫斯（Josephus）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向下一个人开始重新从1报数，如此下去，直至所有的人全部出列为止。试设计一个程序，按出列顺序印出各人编号。）本程序就是解决上述问题-Josephus Problem Solving (Josephus (Josephus) a descr iption of the problem is: numbered 1,2, ..., n, n individuals in a clockwise direction around a circle, each holding a password (positive integer). A start optionally a positive integer as the upper limit of the number of reported m, started from the first in a clockwise direction starting from the number reported, report stops at several m. reported m people out of the line, his password as the new m values​ ​ , in a clockwise direction from the next person he began to re-number from a newspaper, and so on, until all the people all the columns so far. tried to design a program, according to the column order prints each number.) this program is to solve the above problems