文件名称:030300329jose
介绍说明－－下载内容均来自于网络，请自行研究使用
Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某
个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这
个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整
数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。
例如，(7,3)Josephus 排列为3，6，2，7，5，1，4。-Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4.
个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这
个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整
数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。
例如，(7,3)Josephus 排列为3，6，2，7，5，1，4。-Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
030300329jose.cpp