约瑟夫环问题的描述是：编号为1，2，┅，n的n个人按顺时针方向围坐一圈。任选一个正整数作为报数上限m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-Joseph Central, a descr iption of the problem is: No. 1,2, ┅, n of n individuals according to a clockwise direction around a circle. Choose a positive integer as the reported maximum number of m, from the first individual to embark on the clockwise direction since the beginning of the order of 1 reported the number of reported back m the number of stops. Reported m the list of people, from his in a clockwise direction on the next person started to count off from 1, and so on, until all the column until all.