约瑟夫环问题_C++约瑟夫问题如下：已知n个人（n>=1）围坐一圆桌周围，从1开始顺序编号。从序号为1的人开始报数，顺时针数到m的那个人出列。他的下一个人又从1开始报数，数到m的那个人又出列。依此规则重复下去，直到所有人全部出列。请问最后一个出列的人的编号。-Joseph problem as follows: given n individuals (n>=1) sitting around a round table, sequence number　the beginning of the 1. To start off 1 people　the serial number, out of that person clockwise to the m. His next person to start off　the 1, the man to m and the column. According to this rule repeat indefinitely, until the owner of all the columns. Does the last out of the number of people.