本程序针对约瑟夫问题的描述：编号为12，……n的n个人按顺时针方向围成一圈，每人持有一个密码（正整数），一开始任选一个正整数作为报数上限值m，从第一个人开始按顺...

本程序针对约瑟夫问题的描述：编号为12，……n的n个人按顺时针方向围成一圈，每人持有一个密码（正整数），一开始任选一个正整数作为报数上限值m，从第一个人开始按顺序时针方向自1开始顺序报数，报道m时停止报数，报m的人处列将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。利用单向循环链表存储结构模拟此过程，按照出列的顺序印出各人的编号。 演示程序以用户和计算机的对话方式执行，即在计算机终端上显示“提示信息”下，用户输入循环人数n和每人的密码。-This procedure description specifically for Joseph problem: The serial number is 12, ... The n n individual surrounds the ready-made one circle according to the clockwise sense , each person holds (positive integer) a password, one positive integer beginning to assume a post of selections is upper limits ms numbering off, direction starts the hour hand beginning from the first people according to order from 1 numbering off in proper order , stop numbering off when reporting m, the person place column reporting m looks on his password as new m value , the individual begins to number off again from 1 , getting down like this from his time as soon as going ahead in clockwise sense, until proprietor all till leaving self s place in the ranks.