约瑟夫问题

编号为1,2,3,…,n的n个人按顺序针方向围坐一张圆桌旁，每个人手中持有

一个密码（正整数）。首先输入一个正整数作为报数上限值m，然后，从第一个人开始按顺序针方向自1开始顺序报数，报到m的人离开桌子，并将他手中的密码作为新的m值，从顺序针方向的下一个就坐在桌旁的人开始重新从1报数，如此下去，直至所有人全部离开桌旁为止。-Joseph issues numbered 1,2,3, ..., n of the n individuals in accordance with the direction of the order of the needle sitting next to a round-table, each person holding the hands of a password (positive integer). First of all, enter a positive integer as the number of upper limit at m, then started from the first order since the direction of the needle 1 at the beginning of the order of the number of people who report to leave the table m, and in his hand and password as the new value of m, from needle under the direction of the order of a person sitting at the table began to count off from 1, and so on, until all leave the table until everyone.