约瑟夫环问题。本程序要求设编号为1-n的n(n>0)个人按顺时针方向围成一圈．首先第1个人从1开始顺时针报数．报m的人(m 为正整数)．令其出列。然后再从他的下一个人开始，重新从1顺时针报数，报m的人，再令其出列。如此下去，直到圈中所有人出列为止。-Josephus problem. The procedural requirements set numbered 1-n of n (n>　0) Personal clockwise circle. First 1st person clockwise　1 count off. Who reported m (m is a positive integer). Make it out of the line. And then the next person　his start again　1 clockwise report the number of people reported to m, then make it out of the column. And so on until everyone in the circle column so far.