Search - josephus

Search - josephus - List

[Other resource] 约瑟夫环的循环链表实现 DL : 0: 约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。-Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.
Date : 2008-10-13 Size : 5.09kb User : 山子
[Other resource] 经典约瑟夫环问题c语言版 DL : 0: 数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :).
Date : 2008-10-13 Size : 954byte User : 苏辉
[Other resource] Joseplus01 DL : 0: VC++处学者可能用到的小程序,是著名的JOSEPHUS问题,书上已经有,但本人又编了一边-VC Office scholars might use the small program is the famous JOSEPHUS, there was a book, but I also produced a side
Date : 2008-10-13 Size : 7.89kb User : waf
[Other resource] 约涩夫环终极版 DL : 0: 约瑟夫环最终运行文件，适合直接使用者，不必再以来C语言来汇成执行文件。-Josephus final run files, suitable for users, having been formed to C language implementation document.
Date : 2008-10-13 Size : 7.88kb User : 牛牛
[Other resource] 数据结构实习报告-停车场管理和Josephus问题 DL : 0: 这里给大家提供一个用C语言做的小系统__停车场管理系统和有关Josephus问题的解决,是关于数据结构.-here to provide you with a C language system __ small carpark management system and the Josephus resolve the problem of data structure.
Date : 2008-10-13 Size : 3.36kb User : 阁元成
[Other resource] 李森数据结构作业 DL : 1: 文件夹中包括常用的数据结构的算法，包括二叉树的三种递归和非递归算法，染色问题，八皇后问题，深度广度遍历，约瑟夫环，数值转换，树的高度和叶子节点数，最小生成树，两点之间的所有路径-folder include common data structure of the algorithm, including the three binary tree recursive and non - recursive algorithm, Dyeing, 8 Queen, depth and breadth traversal, Josephus, numerical conversion, tree height and leaf nodes. the minimum spanning tree, all between the two paths
Date : 2008-10-13 Size : 19.52kb User : 李森
[Other resource] 669584474 DL : 0: 约瑟夫环算法C语言源代码。希望对大家有帮助。-Josephus algorithm C language source code. We want to help.
Date : 2008-10-13 Size : 1.06kb User : ffff
[Other resource] ranking DL : 0: 约瑟夫环实验：程序利用顺序表实现约瑟夫环，本实验是用于一个小游戏-Josephus experiment : the use of procedures to achieve the order table Josephus, the experiment is for a small game
Date : 2008-10-13 Size : 87.79kb User : linling
[Other resource] chainlist DL : 0: 程序利用链表实现约瑟夫环 1．可以输入游戏人数，初始密码，还可以输入每个人持有的密码。 2．输入的游戏人数和初始密码还有每个人持有的密码都不可以为0，若为0则重新输入。 3．测试数据为游戏人数：0，5 初始密码；0，5 每个人持有的密码依次为：1，2，3，5，4 -procedures used to achieve a Josephus. The game can be imported to the number of initial password, but also can be imported each person to hold the password. 2. The importation of the game and the number of each initial password holders have the password will not be 0, 0 if to re-enter. 3. Test data for the number of games : 0,5 initial password; 0,5 held each followed by the password : 1,2,3, 5,4
Date : 2008-10-13 Size : 5.35kb User : linling
[Other resource] JOSEPHUS DL : 0: 约色夫问题,数据结构实习,用链表实现,哈哈,请多指教,我是才鸟-husband about color, data structure internship with Chain realized Haha, please enlighten, I only birds
Date : 2008-10-13 Size : 866byte User : 雷天保
[Other resource] Joseph DL : 0: 数据结构中经典的约瑟夫环问题的解法。-data structure classic Josephus the solution.
Date : 2008-10-13 Size : 1.4kb User : 温耀彬
[Other resource] yuesefu4252 DL : 0: 约瑟夫环问题，用于学习简单的vc编程，谢谢大家使用-Josephus, for the simple vc learning programming, thank you for the use of
Date : 2008-10-13 Size : 3.41kb User : 李里下
[Other resource] JOPHLINK DL : 0: 数据结构中约瑟夫环问题的链式存储结构（循环链表）算法实现-data structure Josephus the chain storage structure (circular linked list) Algorithm
Date : 2008-10-13 Size : 796byte User : daimin
[Other resource] 05055413 DL : 0: 这是一个用C++语言编写的约瑟夫环问题,旁附说明,已在测试环境下成功通过-This is a C language of Josephus, adjacent to report stated that the testing environment has been successfully adopted
Date : 2008-10-13 Size : 1.01kb User : 忆ぁ夜
[Other resource] yuesehu DL : 0: 是数据结构的内容约瑟夫环的源码，希望对正在读的人有帮助-data structure is the source of Josephus hope that the right people are reading help
Date : 2008-10-13 Size : 969byte User : 田天
[Other resource] 2_8.c DL : 0: 约瑟夫环问题采用C语言编写没有用链表而是用数组实现-Josephus problem using C language does not use chain instead of the array to achieve
Date : 2008-10-13 Size : 1.01kb User : 李
[Other resource] josep DL : 0: Josephus排列问题定义如下：假设n个竞赛者排成一个环形。给定一个正整数m，从某个指定的第一个人开始，沿环计数，每遇到第m个人就让其出列，且计数继续进行下去。这个过程一直到所有的人都出列为止。最后出列都优胜者。每个人出列的次序定义了整数1，2，...，n的一个排列。这个排列称为一个(n,m)Josephus排列。例如，（7,3)Josephus排列为3,6,2,7,5,1,4.对于给定的1，2，...n中的k个数，Josephus想知道是否存在一个正整数m(n,m)Josephus排列的最后k个数为事先指定的这k个数。-Josephus problem with the definition is as follows : Suppose n player formed a ring. Given a positive integer m, from a designated first started along the Central Counting that every individual section m let out their series and counting continued. This process has been to all of them from far out. Finally out from all the winners. Everyone out in the order shown in the definition of integers 1, 2 ,..., n an order. This arrangement known as a (n, m) Josephus arranged. For example, (7,3) Josephus order of 3, 6,2,7,5,1,4. For a given set of 1,2, ... n and k the number, Josephus would like to know whether there is a positive integer m (n, m) Josephus with the final number k prior to the designated number k this.
Date : 2008-10-13 Size : 1.96kb User : 诛仙
[Other resource] josepheasy DL : 0: 刚开始学数据结构时做的一个约瑟夫环,有点复杂,,但总是可以运行,-just started studying data structure so a Josephus, a bit complicated, but they could always run,
Date : 2008-10-13 Size : 1.05kb User : wlr
[Other resource] Josephus DL : 0: josephus问题源代码，c++ ，供大家参考，简明实用，大家可以借鉴使用。
Date : 2008-10-13 Size : 43.4kb User : tuantuan
[Other resource] yuesefu4252 DL : 0: 约瑟夫环问题，用于学习简单的vc编程，谢谢大家使用-Josephus, for the simple vc learning programming, thank you for the use of
Date : 2026-01-07 Size : 3kb User : 李里下

« 12 3 »