Location:
Search - Josephus
Search list
Description: 用循环单链表解决josephus问题的算法-cyclic single linked list of issues to resolve Josephus Algorithm
Platform: |
Size: 1024 |
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问题的解决,是关于数据结构.-here to provide you with a C language system __ small carpark management system and the Josephus resolve the problem of data structure.
Platform: |
Size: 3072 |
Author: 阁元成 |
Hits:
Description: 用数组解JOSEPHUS问题的程序源码,绝对没有错误-array solution with the procedures JOSEPHUS source, there is no wrong
Platform: |
Size: 2048 |
Author: 刘洁 |
Hits:
Description: 用循环链表解决JOSEPHUS问题,精心制作-cyclic Chain JOSEPHUS solve problems carefully
Platform: |
Size: 1024 |
Author: 刘洁 |
Hits:
Description: 用JAVA写的一个小算法！
实现了出局的人数小于循环的人数~！·-using Java to write a small algorithm! Achieved less than the number out of circulation ~!
Platform: |
Size: 1024 |
Author: Alan |
Hits:
Description: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某
个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这
个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整
数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。
例如，(7,3)Josephus 排列为3，6，2，7，5，1，4。-Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4.
Platform: |
Size: 1024 |
Author: 李飞飞 |
Hits:
Description: 约瑟夫环算法C语言源代码。希望对大家有帮助。-Josephus algorithm C language source code. We want to help.
Platform: |
Size: 1024 |
Author: ffff |
Hits:
Description: 约色夫问题,数据结构实习,用链表实现,哈哈,请多指教,我是才鸟-husband about color, data structure internship with Chain realized Haha, please enlighten, I only birds
Platform: |
Size: 1024 |
Author: 雷天保 |
Hits:
Description: 约瑟夫环问题，用于学习简单的vc编程，谢谢大家使用-Josephus, for the simple vc learning programming, thank you for the use of
Platform: |
Size: 3072 |
Author: 李里下 |
Hits:
Description: 数据结构课程设计打包下载，包括两个1.约瑟夫环 2.最小生成树问题！！！我已经交给老师，发给大家参考一下-data structure course design package download, including two one. Josephus 2. The minimum spanning tree problem! ! ! I was handed over to the teachers, to your reference! !
Platform: |
Size: 8192 |
Author: xing |
Hits:
Description: 本文件是数据结构中的约瑟夫环的实验报告，是我在做完后写的-this document is the data structure of Josephus report, after I finish writing
Platform: |
Size: 10240 |
Author: 石增华 |
Hits:
Description: 个人笔记 适合初学者
josephus小孩围圈问题
二分搜索
活动安排问题-personal notebook for beginners josephus children sitting in a circle 2-search activities arrangements etc.
Platform: |
Size: 3072 |
Author: wanghui |
Hits:
Description: 约瑟夫环问题 采用C语言编写 没有用链表 而是用数组实现-Josephus problem using C language does not use chain instead of the array to achieve
Platform: |
Size: 1024 |
Author: 李 |
Hits:
Description: 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.
Platform: |
Size: 2048 |
Author: 诛仙 |
Hits:
Description: 此程序在VC界面上能实现约瑟夫环的功能，操作简单，便于用户使用-this procedure in VC interface to achieve Josephus functions, simple and user-friendly
Platform: |
Size: 34816 |
Author: beibei |
Hits:
Description: 據說著名猶太歷史學家 Josephus有過以下的故事：在羅馬人佔領喬塔帕特後，39 個猶太人與Josephus及他的朋友躲到一個洞中，39個猶太人決定寧願死也不要被敵人到，於是決定了一個自殺方式，41個人排成一個圓圈，由第1個人開始報數，每報數到第3人該人就必須自殺，然後再由下一個重新報數，直到所有人都自殺身亡為止。
然而Josephus 和他的朋友並不想遵從，Josephus要他的朋友先假裝遵從，他將朋友與自己安排在第16個與第31個位置，於是逃過了這場死亡遊戲。-It is said that the famous Jewish historian Josephus has the following story: In the Roman occupation of乔塔帕特after 39 Jews and Josephus and his friends hid in a cave, 39 Jewish spiritual sense of the word should not be decided by the enemy that decided a means of suicide, 41 individuals formed a circle, from one individual to start off, each reported a few to the first 3 people to be the person to commit suicide, and then re-reported by the next number until all committed suicide so far. However, Josephus and his friends do not want to comply, Josephus to his friends to pretend to follow, he will be friends with their own arrangements in section 16 with the first 31 positions, so escaped the death game.
Platform: |
Size: 4096 |
Author: 王凌云 |
Hits:
Description: 数据结构 c语言版 约瑟夫问题 顺序表方法实现-Data structure c language version of the issue of the order of Joseph Table method
Platform: |
Size: 210944 |
Author: differ |
Hits:
«
1
2
34
5
6
7
8
9
10
...
34
»