Location:
Search - josephus array
Search list
Description: 用数组解JOSEPHUS问题的程序源码,绝对没有错误-array solution with the procedures JOSEPHUS source, there is no wrong
Platform: |
Size: 2557 |
Author: 刘洁 |
Hits:
Description: 约瑟夫环问题 采用C语言编写 没有用链表 而是用数组实现-Josephus problem using C language does not use chain instead of the array to achieve
Platform: |
Size: 1032 |
Author: 李 |
Hits:
Description: 用循环链表求解约瑟夫(josephus)问题
求解约瑟夫(josephus)问题,用数组实现-cyclic Chain Solution Joseph (josephus) problem solving Joseph (josephus ), using the array to achieve
Platform: |
Size: 9010 |
Author: zy |
Hits:
Description: Josephus问题的array实现方式
Platform: |
Size: 6389 |
Author: 江枫 |
Hits:
Description: 用数组解JOSEPHUS问题的程序源码,绝对没有错误-array solution with the procedures JOSEPHUS source, there is no wrong
Platform: |
Size: 2048 |
Author: 刘洁 |
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)问题
求解约瑟夫(josephus)问题,用数组实现-cyclic Chain Solution Joseph (josephus) problem solving Joseph (josephus ), using the array to achieve
Platform: |
Size: 8192 |
Author: zy |
Hits:
Description: Josephus问题的array实现方式-Josephus ways array problem
Platform: |
Size: 6144 |
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排列问题定义如下：假设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问题的求解方法，用C语言采用数组方式实现，个人认为比教科书上提供的方法要精简的多，和大家一起分享-I have written Josephus problem solving method, using C language using an array of ways to achieve, personally think that way than the provision of textbooks to be streamlined and more to share with everyone
Platform: |
Size: 887808 |
Author: weiw |
Hits:
Description: Josephus问题的解决方法——用数组方法实现的程序源码-solution to the Josephus problem- an source code based on an array of methods used to achieve the program
Platform: |
Size: 167936 |
Author: Bill |
Hits:
Description: 用数组实现Josephus算法，便于学习与应用-Josephus realized with an array algorithm, ease of learning and application of
Platform: |
Size: 747520 |
Author: 小磊 |
Hits:
Description: 求解Josephus问题的函数。用整数序列1, 2, 3, ……, n表示顺序围坐在圆桌周围的人，并采用数组表示作为求解过程中使用的数据结构。-Josephus problem solving functions. With a sequence of integers 1, 2, 3, ... ..., n that order around a round table around and use that as an array of data used in the process of solving the structure.
Platform: |
Size: 2035712 |
Author: 朱朱 |
Hits:
Description: 设计一个可变长顺序表，当用户所给的数据超出定义所分配的空间时，可以动态的扩展数组空间-Order to design a variable-length table, when the data exceeds the user to define the allocated space, you can dynamically expand the array space
Platform: |
Size: 79872 |
Author: zhangpengwei |
Hits:
Description: [转发]约瑟夫环问题的数组解法，很简单的一个算法。-[Forwarding] the Josephus array solution, a very simple algorithm.
Platform: |
Size: 2048 |
Author: 贾世灵 |
Hits:
Description: 分别以数组指针和模拟指针的方法解决约瑟夫问题-Respectively pointer array pointer and simulation methods to solve the problem of Joseph
Platform: |
Size: 246784 |
Author: 张超 |
Hits:
Description: C语言数组实现约瑟夫环
对于初学者是个不错的教程-C language array to achieve Josephus
Platform: |
Size: 1024 |
Author: chenqi |
Hits:
Description: 用java数组解决约瑟夫问题：N个人围成一圈，从第一个开始报数，第M个将退出改圈，最后剩下一个，其余人都将被退出。-Josephus problem solving with java array: N personal circle, starting from the first report the number of M-th will quit changing circle, the last remaining one, the rest will be exited.
Platform: |
Size: 1024 |
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: