文件名称:yuesefuhuan
介绍说明--下载内容均来自于网络,请自行研究使用
约瑟夫(Joseph)问题是:编号为1,2,…,n的n个人按顺时针方向围坐一圈,每人有一个正整数编号。从某个位置上的人开始报数,数到m的人便出列,下一个人(第m+1个)又从1数起,数到m的人便是第2个出列的人,依次重复下去,直到最后一个人出列,于是得到一个新的次序,试设计一个程序求出出列的顺序。-
Joseph (Joseph) The question is: numbered 1,2, ..., n, n individuals sitting around a circle clockwise, each have a positive integer number. From a location on the number of people began to report, the number of people will be out to m columns, the next person (the first m+1 a) and from a number, the number of people to m 2 is the first person out of the column , followed by repeated until the last person out of line, then get a new order, a program designed to find a test order of the columns.
Joseph (Joseph) The question is: numbered 1,2, ..., n, n individuals sitting around a circle clockwise, each have a positive integer number. From a location on the number of people began to report, the number of people will be out to m columns, the next person (the first m+1 a) and from a number, the number of people to m 2 is the first person out of the column , followed by repeated until the last person out of line, then get a new order, a program designed to find a test order of the columns.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
yuesefuhuan.doc