搜索资源列表
Joseph
- 解决约瑟夫问题的一个小程序。一群猴子围成一个圈,从其中一个猴子开始报数,先规定一个数,数到这个数的猴子出列,下一个猴子继续报数,数到这个数的猴子就出列,直到全部猴子都出列为止,求猴子出列的顺序。-Joseph problems to solve a small program. A group of monkeys in a circle, from one of the monkeys reported the number of first specify a number, the num
josph
- C语言实现的约瑟夫环程序,适用于严蔚敏C语言数据结构的实验。非常简单的小程序。-C language implementation of Josephus procedures applicable YanWeiMin C language data structure experiments. Very simple applet.
YueSeFu
- 关于约瑟夫问题的一系类问题求解,欢迎借鉴-A series of questions about Joseph kind of problem solving, welcome to learn
2012IE_03031201_2012300689
- 约瑟夫问题 这是17世纪的法国数学家加斯帕在《数目的游戏问题》中讲的一个故事:15个教徒和15 个非教徒在深海上遇险,必须将一半的人投入海中,其余的人才能幸免于难,于是想了一个办法:30个人围成一圆圈,从第一个人开始依次报数,每数到第九个人就将他扔入大海,如此循环进行直到仅余15个人为止。问怎样排法,才能使每次投入大海的都是非教徒。 含C语言大报告-Josephus problem which is the 17th-century French mathematician Gaspar
josephus_clist
- 约瑟夫环的小算法,很简单,适合新手使用!-Josephus small algorithm is very simple, suitable for beginners to use!
joseph-circle
- 用visualC++的实现的动态约瑟夫环。 约瑟夫环是一种有数字组成的环,按一定消去,直至完全-Implementation with visualC++ dynamic Josephus. Joseph ring is a ring with digits, according to a certain elimination, until completely
yuesefu
- 约瑟夫生死游戏功能齐全完整的源代码加课程设计-Joseph life and death game featured the complete source code plus curriculum design
Josephus
- 约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。-Josephus is a mathematical application problems: Given n individuals (with numbers 1,2,3 ... n, respectively) were sitting at a roun
Josephus
- C#实现约瑟夫问题。实现环境VS2010。原创-Joseph C# implementation issues
joseph
- 经典的约瑟夫环问题,按顺序剔除报数为某一个序号的人,直至留下最后几个生存,利用指针和链表-Joseph Problem
yue
- 约瑟夫环解决一个历史上的问题,主要是一群人围成一个环,解决最后谁活下来的问题-Josephus solve a history of problems, mainly a group of people surrounded by a ring, to solve the last problem of who survived
6-12
- 约瑟夫问题,使用labview的公式节点实现,非常简单-use scr ipt node to calculate the Jolsef question
yuesefuhuan
- 算法实现约瑟夫环,有界面呈现,直观简洁。-Josephus algorithm, interface presentation, simple and intuitive.
11
- 用线性表的基本操作来实现约瑟夫问题 总人数及被杀死人的位置都是由用户通过键盘输入界面,最后输出显示被杀死人及最后剩下人的序号 如: 输入:10,3 输出:3 6 9 2 7 1 8 5 10 4-Linear form the basic operation to achieve Joseph and the total number of questions the position of the dead were killed by the user
Joseph
- 编程实现了约瑟夫环的编程,代码易懂,功能强大,对初学者具有很大的用处。-Programming the Josephus programming, code easy to understand, powerful, great use for beginners.
Josephus-
- 约瑟夫问题是个有名的问题:N个人围成一圈,从第一个开始报数,第M个将被杀掉,最后剩下一个,其余人都将被杀掉。例如N=6,M=5,被杀掉的人的序号为5,4,6,2,3。最后剩下1号。 假定在圈子里前K个为好人,后K个为坏人,你的任务是确定这样的最少M,使得所有的坏人在第一个好人之前被杀掉。-Josephus problem is a well-known problem: N personal circle, starting from the first report the number
josephus
- 用循环链求解约瑟夫问题,gnu gcc compiler in codeblocks-use circle link list to solve the problem of Josephus
Josephus-
- 约瑟夫环,经典的数据结构问题,适合初学者研究,用C#语言-Josephus, the classic problem of data structures, suitable for beginners, using C# language
yuesefuhuan
- 约瑟夫环的C语言实现,华为上机测试题。用链表实现-Josephus C language, Huawei-on test questions. List realize
Josephus
- 约瑟夫问题是个有名的问题:N个人围成一圈,从第一个开始报数,第M个将被杀掉,最后剩下一个,其余人都将被杀掉。例如N=6,M=5,被杀掉的人的序号为5,4,6,2,3。最后剩下1号-Joseph is a famous problems: N individuals in a circle, starting from the first number off, the first M will be killed, the last one, the others will be killed.