文件名称:Joseph
介绍说明－－下载内容均来自于网络，请自行研究使用
约瑟夫环问题：
设编号为1，2，…，n的人按顺时针方向围坐一圈，每人持有一个正整数密码。开始时任意给出一个报数上限值m，从第一个人开始顺时针方向自1起顺序报数，报道m时停止报数，报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人起重新自1起顺序报数；如此下去，直到所有人全部出列为止。要求设计一个程序模拟此过程，并给出出列人的编号序列。
-Joseph Central question: Let numbered 1,2, ..., n the person clockwise direction around a circle, each holding a positive integer password. Give a start when the reported number of arbitrary limits on m, beginning from the first person clockwise order starting from the one reported the number of reported stop m at number of people reported m out of his password as the new value of m , the clockwise direction from him on the next one individual since been re-reported since the order of a few it goes on like this until all the series so far all. Analog design a program of this process and give the number of people out of sequence.
设编号为1，2，…，n的人按顺时针方向围坐一圈，每人持有一个正整数密码。开始时任意给出一个报数上限值m，从第一个人开始顺时针方向自1起顺序报数，报道m时停止报数，报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人起重新自1起顺序报数；如此下去，直到所有人全部出列为止。要求设计一个程序模拟此过程，并给出出列人的编号序列。
-Joseph Central question: Let numbered 1,2, ..., n the person clockwise direction around a circle, each holding a positive integer password. Give a start when the reported number of arbitrary limits on m, beginning from the first person clockwise order starting from the one reported the number of reported stop m at number of people reported m out of his password as the new value of m , the clockwise direction from him on the next one individual since been re-reported since the order of a few it goes on like this until all the series so far all. Analog design a program of this process and give the number of people out of sequence.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Joseph.cpp