约瑟夫环问题：设有编号为1，2，3……n的n个人顺时针方向围坐一圈，每人有一密码（正整数）。开始时给出一报数上限m，从编号为1的人开始报数，报m的人出列；以后将出列者的密码作为新的m，从顺时针方向紧挨着他的下一个人开始报数……直至所有人出列。-Joseph Central question: has numbered 1,2,3 ... ... n of n individuals clockwise around a circle, each have a password (positive integer). The beginning of a newspaper is given the maximum number of m, from the No. 1 people are reported to the number of people who reported that a column m　will be out of the password as a new m, from a clockwise direction next to his next reported that the number of people began ... ... until all the column.