Search - josephus

Search - josephus - List

[Other] 陈浩 DL : 0: 约瑟夫环实践设计的前半段大学二年纪暑假数据结构实习作业之一-Josephus practice in the first half of the two young university summer internship operational data structure one
Date : 2008-10-13 Size : 365kb User : 杨振
[Other] JosephusList DL : 0: 用链表实现Josephus问题的源码，混一个得分点吧-achieve Josephus with the source, a mixed it scores points
Date : 2008-10-13 Size : 5.41kb User : 小宇
[Other] Johnseph DL : 0: 约瑟夫环程序，在Visual C++里运行，可以运行的。-Josephus procedures, the Visual C Lane running, running.
Date : 2008-10-13 Size : 1.27kb User : 林琳
[Other] YSeFHu DL : 0: 本文件是数据结构试验中的约瑟夫环的源文件，经编译无误-data structure of the pilot Josephus source files, compile and unmistakably
Date : 2008-10-13 Size : 1.04kb User : 石增华
[Other] E12_0230 DL : 0: 约瑟夫环 1. 本演示程序利用一循环链表,每个结点为一人,类似将人按顺时针方向围坐一圈,每个结点包括,号码,密码.号码是作为排的顺序.密码用来作为下一次报数的数字.当走到结尾时,再下个结点便循环回去,依此类推. 2. 演示程序以用户与计算机的对话方式执行，用户输入相应的数据，输出结果显示在其后。,即总结点数,和密码. 3. 程序执行的命令包括:1)创建链表 2)寻找结点 3)删除结点 4. 测试数据测试数据：m初始值20，n=7，7个人密码依次为：3，1，7，2，4，8，4。首先m值为6，正确出列顺序为6，1，4，7，2，3，5。 -Josephus 1. The demonstration program using a chain cycle, each node to a person, similar to a clockwise direction by people sitting circle, and each node include numbers, Password. As the number is the sequence. used as a password the next few reported figures. When reached at the end, the next nodes will cycle back, and so forth. 2. Demonstration Program to computer users with implementation of the dialogue, the corresponding user input data and output results in later. , Summed up the quota, and password. 3. Procedures for the implementation of the order include : 1) Create List 2) Find node 3) delete nodes 4. test data test data : the initial value of 20 m, n = 7, 7 PIN followed : 3,1,7,2,4,8,4. M value for the first six correctly listing the order of 6, 1,4,7,2,3,5.
Date : 2008-10-13 Size : 39.89kb User : 苏言暖
[Other] Josephus DL : 0: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。
Date : 2008-10-13 Size : 807byte User : 刘丹
[Other] T3 DL : 0: 约瑟夫环：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。编程打印出列顺序。-Josephus : No. 1, 2, 3, ..., n n clockwise direction by individuals sitting around a circle, each holding a password (positive integers). An optional started as a positive integer reported limits on the number of m, from the first individuals to embark on the clockwise direction since the beginning of a sequence number off, the report m stop. M reported out of the list of his password as a new value m, from a clockwise direction in the next one started from a newspaper a few, like that, until the total of all listed so far. Programming print out the order.
Date : 2008-10-13 Size : 797byte User : 李然