文件名称:Joseph
介绍说明－－下载内容均来自于网络，请自行研究使用
约瑟夫(Joseph)问题的一种描述是:编号为1,2,..., n 的n 个人按顺
时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作
为报数上限值m， 从第一个人开始按顺时针方向自1开始顺序报数，报到m时
停止报数。报m的人出列，将它的密码作为新的m值，再从下个人开始新一轮
报数，如此反复，直到剩下最后一人则为获胜者。试设计一个程序求出出列顺
序。-Joseph (Joseph) a descr iption of the problem is: the number is 1,2,..., n n
Around a circle, each holding a password (positive integer). A selection of a positive integer as
As the number of upper limit of M, starting the first person in a clockwise direction 1 to the beginning of the order number, report m
Stop off. Who reported m out of line, it will be the password as the new m value, the individual to start a new round of
Off, so repeatedly, until the last one is the winner. Try to design a program obtained along the column
Order.
时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作
为报数上限值m， 从第一个人开始按顺时针方向自1开始顺序报数，报到m时
停止报数。报m的人出列，将它的密码作为新的m值，再从下个人开始新一轮
报数，如此反复，直到剩下最后一人则为获胜者。试设计一个程序求出出列顺
序。-Joseph (Joseph) a descr iption of the problem is: the number is 1,2,..., n n
Around a circle, each holding a password (positive integer). A selection of a positive integer as
As the number of upper limit of M, starting the first person in a clockwise direction 1 to the beginning of the order number, report m
Stop off. Who reported m out of line, it will be the password as the new m value, the individual to start a new round of
Off, so repeatedly, until the last one is the winner. Try to design a program obtained along the column
Order.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Joseph1.cpp
JOSEPH.CPP
Joseph.h