Location:
Search - josephus
Search list
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: 3438 |
Author: 阁元成 |
Hits:
Description: 经典的Josephus问题C程序-classic problem Josephus C Program
Platform: |
Size: 45056 |
Author: |
Hits:
Description: 这是一个Josephus问题的C++代码,用双向链表实现.有问题题请联系ho1983xx@tom.com (2005-5-22，VC,1KB,下载0次)【向站长举报此文件和某个同类文件可能重复】-This a C++ code about Josephus problem, and use two-way chain form to realize.If you have any problem, please contact ho1983xx@tom.com
Platform: |
Size: 2048 |
Author: zdw |
Hits:
Description: Josephus问题的顺序表实现 关于Josephus问题的顺序表实现-Josephus table in the order of Josephus achieve in the order table to achieve
Platform: |
Size: 2048 |
Author: 张杰楷 |
Hits:
Description: 用循环链表解Josephus问题。设有n个人围坐在一个圆桌周围，现从第1个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，…，如此反复直到所有的人全部出列为止。Josephus问题是：对于任意给定的n和m，求出按出列次序得到的n个人员的序列，如n=8，m=4时，输出序列是48521376。-cyclic Chain Solutions Josephus problem. N with the individuals sitting around a round table, it is from a few individuals reportedly began, a few of the m people out of ranks. Stand up and then the next person reported several fresh start, a few of the m out of the people out, ... so repeatedly until all of the people all out far out. Josephus question is : for any given set of n and m, sought out the out of order n is the sequence, if n = 8, m = 4, Sequence is 48521376.
Platform: |
Size: 1024 |
Author: 海薇 |
Hits:
Description: 自己编写的josephus问题c++程序，不够完善之处大家一起学习-I have written the question of Josephus c++ Procedures, lack of improvement in everyone learning together
Platform: |
Size: 181248 |
Author: zhangmin |
Hits:
Description: 数据结构实验(循环链表josephus问题)
学会选择合适的数据结构来解决实际问题
学会如何创建一个循环链表在循环链表中如何进行查找在循环链表中如何进行删除
-Experimental data structure (circular list Josephus problem) Institute of selecting suitable data structure to solve the practical problems to learn how to create a cycle in the cycle list list of how to carry out search in the cycle of how to delete list
Platform: |
Size: 2048 |
Author: |
Hits:
Description: josephus问题源代码，c++ ，供大家参考，简明实用，大家可以借鉴使用。-Josephus problem of source code, c++, for your reference, concise and practical, we can learn from the use.
Platform: |
Size: 44032 |
Author: tuantuan |
Hits:
Description: 用面向对象程序设计方法解决Josephus问题。（文件名Josephus.java）-Object-Oriented Programming solution to the question of Josephus. (File name Josephus.java)
Platform: |
Size: 1024 |
Author: 曾刚 |
Hits:
Description: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某
个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这
个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整
数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。-Josephus with the problem are defined as follows: Suppose n a player lined up a ring. Given a positive integer m, from a designated section 1 begins with individuals along the ring count, the first m individuals, when confronted by their let out, and the count continued. This process until all the listed date. Finally a column for the winners. Each person listed in the order of the definition of the integers 1,2, ..., n an order. This arrangement is called a (n, m) Josephus arranged.
Platform: |
Size: 1024 |
Author: 刘丹 |
Hits:
Description: Josephus算法，约瑟夫问题利用数组结构进行解决；C++源码；-Josephus algorithms, Joseph problems to solve using the array structure C++ Source
Platform: |
Size: 1024 |
Author: yangjun |
Hits:
Description: Josephus算法。 -Josephus algorithm.
Platform: |
Size: 2048 |
Author: aa |
Hits:
Description: Josephus 问题描述 数据结构为链表的插入与查询-Josephus Problem Description
Platform: |
Size: 4096 |
Author: 程本飞 |
Hits:
Description: java的经典example——在java中用链表解决约瑟夫环问题~-solve Josephus problem in java
Platform: |
Size: 3072 |
Author: zmzy |
Hits:
Description: 著名的约瑟夫环问题，采用链表数据结构
已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。
例如：n = 9, k = 1, m = 5
【解答】
出局人的顺序为5, 1, 7, 4, 3, 6, 9, 2, 8。-well-known Josephus Problem,using link list method
Platform: |
Size: 93184 |
Author: 宋歌 |
Hits:
Description: 问题描述：
新Josephus排列问题定义如下：假设n个人排成一个环形，给定一个正整数m，从第1
个人开始，沿环计数，每遇到第m个人就让其出列，这时计算器m自动加一，且计数继续进
行下去。这个过程一直进行到所有的人都出列为止，最后出列者为赢家。设这n个人的编号
分别为1～n，每次从编号为1的竞赛者开始计数，那么每个人出列的次序定义为整数1～n
的一个排列。这个排列称为一个(n,m)Josephus排列。
例如，(7,3)Josephus 排列为3，7，6，2，4，1，5。
对于给定的1，2，…，n中的k个数，Josephus想知道是否存在一个正整数m使得
(n,m)Josephus排列的前k个数恰为事先指定的这k个数。
编程任务：
(1)用抽象数据类型表设计一个求(n,m)Josephus排列的算法。
(2)试设计一个算法，对于给定的正整数n和1，2，…，n中的k个数。求正整数m，使
(n,m)Josephus排列的前k个数恰为事先指定的这k个数(顺序必须完全一样)。
-Problem Description:
Josephus ordered a new problem definition is as follows: Suppose n individuals arranged in a ring, given a positive integer m, from the first one
Begins with individuals along the ring count, when confronted with the first m individuals let their out of line, then automatically add a calculator m, and the count continued into the
OK go on. This process continues until all of them out of the column until the last person out of the column as a winner. This set up the individual numbers n
Respectively, 1 ~ n, each number is one from the race have begun to count, then the order of each person out of the column is defined as an integer 1 ~ n
An array. This arrangement is called a (n, m) Josephus arranged.
For example, (7,3) Josephus arranged as 3,7,6,2,4,1,5.
For a given 1,2, ..., n in the k-number, Josephus would like to know whether there is a positive integer m makes the
(n, m) Josephus arranged in exactly the number of pre-k this for a pre-specified k number
Platform: |
Size: 2048 |
Author: atlantis |
Hits:
Description: 约瑟夫斯（Josephus）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向下一个人开始重新从1报数，如此下去，直至所有的人全部出列为止。试设计一个程序，按出列顺序印出各人编号。-Josephus (Josephus) a description of the problem are: number 1,2, ..., n of n individuals sitting around a circle clockwise, each holding a password (positive integer). Choose a positive integer beginning as a limit on the number of reported m, starting from the first person to start a clockwise direction from a report number, report the number of reported m stop. Who reported m out of line, his password as the new m value, in a clockwise direction from the next person he began to re-reported from a number, it goes on until all the people all of the columns so far. Design a program, according to the column order prints each number.
Platform: |
Size: 57344 |
Author: 冯柳鑫 |
Hits:
Description: 数据结构编程实验：Josephus问题：一个热土豆引发的故事(Data Structure Experiment: Josephus question: the story of a hot potato)
Platform: |
Size: 1024 |
Author: enemy
|
Hits:
Description: 分别通过顺序表和链表的方式，利用C++实现约瑟夫斯问题(C++ implementation of the Josephus problem)
Platform: |
Size: 1533952 |
Author: 嘉树
|
Hits:
Description: 通过c语言数组算法解决josephus问题，m个人围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开，最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)
Platform: |
Size: 4096 |
Author: 靇笙
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
34
»