Location:
Search - 约瑟夫环
Search list
Description: 约瑟夫环c++程序
Platform: |
Size: 150449 |
Author: swshiyx@sohu.com |
Hits:
Description: c环境下的约瑟夫解决问题
Platform: |
Size: 470 |
Author: 280104758 |
Hits:
Description: 数据结构经典算法---约瑟夫环的完整版实验报告
Platform: |
Size: 12365 |
Author: 285924648@qq.com |
Hits:
Description: 约瑟夫环源代码-Joseph Central source code
Platform: |
Size: 1024 |
Author: 阿贵 |
Hits:
Description: 约瑟夫问题的求解方案，经典-Joseph solving the problem, classic
Platform: |
Size: 15360 |
Author: 齐玉祥 |
Hits:
Description: 用C语言编写的约瑟夫环等问题.用链式存储实现！-C language of Josephus and other issues. Chain store used to achieve!
Platform: |
Size: 2048 |
Author: 幽浮 |
Hits:
Description: 一个关于约瑟夫环的程序-one of the procedures Josephus
Platform: |
Size: 1024 |
Author: 周民 |
Hits:
Description: 数据结构课程设计--排序和约瑟夫环-data structure course design-- sequencing and Josephus
Platform: |
Size: 10240 |
Author: 山狗 |
Hits:
Description: 约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，他有一条荒唐的法律，将犯人站成一个圆圈，从第S个人开始数起，每数到第D个犯人，就拉出来处决，然后再数D个，数到的人再处决———直到剩下的最后一个可赦免。 发展的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，但这N个人每人持有一个密码，他有一条荒唐的法律，将犯人站成一个圆圈，法官先给出一个密码M，从第S个人开始数起，每数到第M个犯人，就拉出来处决，再根据这个人所持有的密码F，然后再数F个，数到的人再处决，以此类推———直到剩下的最后一个可赦免。-Joseph problems have original development of the Joseph and Joseph two. The original Joseph Description : Ancient a judge to sentence N inmates of the death penalty, he is a ridiculous law, prisoners station into a circle, from S began a few individuals, every few months to D prisoners, pull out executions, then D, the number of people to be re-executed--- until the last one left to be pardoned. The development of the Joseph Description : Ancient a judge to sentence N inmates of the death penalty, but each individual N holders a password, he is a ridiculous law, prisoners station into a circle, the judges first gave a password M, S individuals from the beginning of several, each of the first few inmates M , pull him out executions, in accordance with the password held by the F, then F fe
Platform: |
Size: 2048 |
Author: 曾德胜 |
Hits:
Description: C语言数据结构课程设计约瑟夫环1． 本演示程序中，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止。-C language curriculum design data structure Joseph Central 1. The demo program, the number of n for arbitrary, and the first to be assigned to input an initial ceiling on the number of reported m, procedures should be able to automatically keep people out from the serial numbers and would come up out of a person's password assigned m, as reported again ceiling on the number of such cycles, until all shown up so far.
Platform: |
Size: 8192 |
Author: 郑伟雄 |
Hits:
Description: 约瑟夫环的原程序很好用的啊 我的程序是自己做的 考试还得了优呢 免费的 大家快来下载啊 -Josephus the original program with the good ah my own procedure is the examination of priorities? Need everyone to hurry free download ah
Platform: |
Size: 22528 |
Author: 朱旭 |
Hits:
Description: 数据结构课程设计，用C语言编写的约瑟夫环-data structure course design, preparation of the C language Josephus
Platform: |
Size: 36864 |
Author: 李火土 |
Hits:
Description: 约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。-Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.
Platform: |
Size: 5120 |
Author: 山子 |
Hits:
Description: 数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :).
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 约瑟夫环最终运行文件，适合直接使用者，不必再以来C语言来汇成执行文件。-Josephus final run files, suitable for users, having been formed to C language implementation document.
Platform: |
Size: 8192 |
Author: 牛牛 |
Hits:
Description: 编制一个演示约瑟夫环的程序-prepare a demonstration Josephus procedures
Platform: |
Size: 1024 |
Author: 玻璃飞舞 |
Hits:
Description: 约瑟夫环的问题,这是一个比较经典的编程实例,我做了一个小程序来实现了其算法-Joseph Central, which is a more classical programming examples, I had a small program to achieve its algorithm
Platform: |
Size: 223232 |
Author: 赵麟 |
Hits:
Description: 从语言课程设计递推法约瑟夫环，链式存储约瑟夫环(C language curriculum design data structure Joseph Central 1)
Platform: |
Size: 4096 |
Author: 小牛牛2
|
Hits:
Description: 约瑟夫环。已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。(Known n individuals (with numbers 1, 2, 3... N respectively) sitting around a round table around. K from a number of people start off, the man out of the line to the m; his next person and from 1 to start off, count to m that another person out;)
Platform: |
Size: 4096 |
Author: jamies890
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
47
»