约瑟夫问题编号为1，2，......，n的n个人按照顺时针方向围坐一圈，每个人有且只有一个密码（正整数）。一开始任选一个正整数作为报数上限值，从第一个人开始顺时针方向自1开始报数，



报到m时停止报数。报m 的人出列，将他的密码作为新的m值，从他在顺时针方向的下一个人



开始重新报数，如此下去，直到所有人全部出列为止。-Joseph No. 1,2, ...... n n individuals sit in a circle in a clockwise direction, everyone has one and only one password (a positive integer). Optionally a positive integer as the upper limit of the number off, clockwise from the beginning of the first person since 1 reported number, report m to stop reported number. Reported m the man out of the line, his password as the new value of m, starting from the next person in the clockwise direction to re-reported number, and so on, until all the columns until all.