经典的约瑟夫环问题：编号为1,2,..., n 的n 个人按顺时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作为报数上限值 m， 从第一个人开始按顺时针方向自1 开始顺序报数，报到 m 时停止报数。报 m 的人出列，将它的密码作为新的 m值。试设计一个程序求出出列顺序。 现已C语言实现-Classic Joseph ring problem: Numbers for 1, 2,... , n n personal clockwise sat a lap, each holding a password (positive integer). A began to retaining a positive integer number off as the upper m, from the first person to start the clockwise order since 1 began to sound off, report when m stop count off. The man stood for m, will it password as new m value. Try to design a program for stood out of order. Now C language program to realize this.