约瑟夫问题的一种描述为，编号为 1,2,3,……n 的n 个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m,从第一个人开始按顺时针方向自1 开始顺序报数，报到m 时停止报数。报m 的人出列，将他的密码作为新的m 的值，从他在顺时针方向上的下一个人开始重新从1 报数，如此下去，直至所有的人全部出列为止。试设计一个程序求出出列顺序。-Joseph problems for a descr iption, number 1,2,3,......N n individuals according to a clockwise direction around a circle, each holding a password (a positive integer).One began to choose a positive integer as the number of upper limit of M, from the first individual to start a clockwise from 1 to start the sequence number off, the report m stop.Who reported m out of the column, his password as the new m value, from him in a clockwise direction on the next person started to count off from 1, and so on, until all of the column until all.Try to design a procedure to derive the column order.