文件名称:E12_0230
- 所属分类：
- 其他小程序
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 40kb
- 下载次数：
- 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.
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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
E12_0230
........\1.cpp
........\1.dsp
........\1.dsw
........\1.exe
........\1.ncb
........\1.opt
........\1.plg
........\Joseph.txt
........\1.cpp
........\1.dsp
........\1.dsw
........\1.exe
........\1.ncb
........\1.opt
........\1.plg
........\Joseph.txt