约瑟夫环

约瑟夫问题的一种描述是：编号为1，2，3……的n个人按顺时针方向围坐成一圈，每人持有一个密码。一开始任选一个正整数作为报数上限m，从第一个人开始按顺时针方向自1开始报数，报到m停止报数。报m的人出列，将他的密码作为新的m值，从他顺时针方向的下一个人开始重新从1开始报数，如此下去，直到所有人全部出列。-Joseph Ring

Joseph, a descr iption of the problem is: numbered 1,2,3 ... ... n-individuals sitting in a circle clockwise, each holding a password. Choose a positive integer beginning, as the reported maximum number of m, from the first individual to embark on the clockwise direction starting from a report number, report the number m to stop reporting. Who reported m out of the column, his password as the new m value, from his next person clockwise to re-start from a number of reports, this continues until all the listed owner.