搜索资源列表
yuesefuhuan2
- 这也是一个约瑟夫环的问题-This is also a question of Joseph Central
YSF
- 约瑟夫问题-The Joseph cycle problem.
用C++编写的约瑟夫环
- 用C++编写的约瑟夫环- Joseph link compiles which with C
yuesefu
- 本程序采用循环单链表的算法来解决约瑟夫环问题:建立一个循环单链表,按顺序查找指定结点,找到后删除,最后打印删除的编号序列。- This procedure uses circulates Shan Lianbiao algorithm to solve the Joseph link problem: Establishes to circulate Shan Lianbiao, assigns the point according to the smooth search, after
约瑟夫问题1
- 绝对可以运行的程序 约瑟夫问题1-definitely can run the procedure Joseph a problem
Joseh
- 约瑟夫问题的一个解法,主要利用数组来解决,代码为C++源代码。-Joseph A solution, the main use of the array to resolve the symbol C++ Source code.
c++
- c++源代码,包括约瑟夫问题、万年历的实现、用C++编写通讯录、螺旋方阵的输出、分形算法和一个编程大赛试题等等。-c++ source code, including Joseph problems, the realization of calendar with C++ the preparation of contacts, the output of square spiral, fractal algorithm and a programming contest questions
josepRing
- joseph环。任务:编号是1,2,……,n的n个人按照顺时针方向围坐一圈,每个人只有一个密码(正整数)。一开始任选一个正整数作为报数上限值m,从第一个人开始顺时针方向自1开始顺序报数,报到m时停止报数。报m的人出列,将他的密码作为新的m值,从他在顺时针方向的下一个人开始重新从1开始报数,如此下去,直到所有人全部出列为止-joseph ring. Tasks: number is 1,2, ... ..., n of the n individuals in accordance with th
Josephus
- java源代码,经典问题,约瑟夫环问题-java source code, the classic problem, the issue of Joseph Central
Josephus.java
- Josephus.java,是java课程的实验2 求解约瑟夫环问题-Josephus.java, is a java course experiment 2 Joseph Cycle Problem Solving
yuesefu
- 约瑟夫问题的一种描述是:编号为1,2,…,n的n个人按顺时针方向围坐一圈,没人持有一个密码。一开始人选一个正整数作为报数上限值m,从第一个人开始按顺时针自1开始报数,报到m是停止报数。报m的人出列,将他的密码作为新的m值,从他在顺时针方向上的下一个人开始重新从1报数,如此下去,直至所有人全部出列为止-A descr iption of Joseph is: No. 1,2, ..., n of n individuals according to a clockwise direction ar
yuesefuhuan
- 约瑟夫环问题:任给正整数N和K,按下述方法可以得到1,2, …,n的一个置换,将数字1,2,…,n环形排列,按顺时针方向自1开始报数,报到K时输出该位置上的数字,并使其出列。然后从他在顺时针方向的下一个数字继续报数,如此下去,直到所有的数字全部出列为止。例如N=10,K=3,则正确的出列顺序应为3,6,9,2,7,1,8,5,10,4。-Joseph Central questions: any given positive integer N and K, the following met
image_registration
- edited by Joseph Hajnal, David Hawkes and Derek Hill. Part 1. Methodology.Part 2. Applications of rigid-body registration.Part 3. Techniques and applications of non-rigid registration
yuesefu
- 实现的是对约瑟夫问题的c语言编程,实现的简单而且易懂。-Realized the problem of Joseph c language programming, to achieve the simple and easy to understand.
Jesephus
- 解决约瑟夫环的问题,并输出出圈的顺序。约瑟夫环的大小是任意的。-Joseph Ring solve problems, and the output of the loop sequence. Joseph ring size is arbitrary.
yuesefu
- 经典的约瑟夫问题,呵呵,大家应该很熟悉不过了 ,不过还是值得看看! -Joseph classic problem, huh, huh, we should be very familiar, but it is still worth to see!
Joseph
- 是一个数学的应用问题: 已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。-Is the application of a mathematical problem: n known individuals (in numbers 1,2,3 ... n, respectively) were sitting around on a r
1
- 约瑟夫环算法,可以利用此算法解决栈存储的约瑟夫环问题.-Joseph loop algorithm, can use this algorithm to solve the storage stack Joseph Central problems.
HBBG
- 用初等相似变换将一般实矩阵约化为赫申伯格矩阵-Using elementary similarity transformation will be about the general real matrix into a matrix of Joseph Berger Shanghai
hello
- 约瑟夫环是学习单链表的一个比较好的垫脚石,是数据结构课程设计的一部分-Joseph is the study and a single list of a better stepping stone, is a data structure as part of the curriculum design