编号是 1，2，……,n 的 n 个人按照顺时针方向围坐一圈，每个人只有一个密码（正整数）。一开始任选一个正整数作为报数上限值 m,从第

一个仍开始顺时针方向自 1 开始顺序报数，报到 m 时停止报数。报 m 的

人出列，将他的密码作为新的 m 值，从他在顺时针方向的下一个人开始

重新从 1 报数，如此下去，直到所有人全部出列为止。设计一个程序来求出出列顺序。(The number is 1, 2,...... N's n individuals sit in circles clockwise, with each person having only one password (positive integer). One began to choose a positive integer as the number of the upper limit of M, from the
One is to start a clockwise direction from the beginning of the order number 1, back off m stop. M
People out of the line, his password as the new m value, from his start in a clockwise direction of the next person
To count off from 1, and so on, until all the columns so far. Design a procedure to find out the column order.)