Location:
Search - Josephus
Search list
Description: 约瑟夫环问题(Josephus),用户输入M,N值，从1至N开始顺序循环数数，每数到M输出该数值，直至全部输出。由于当某个人退出圆圈后，报数的工作要从下一个人开始继续，剩下的人仍然是围成一个圆圈的，可以使用循环表，由于退出圆圈的工作对应着表中结点的删除操作，对于这种删除操作频繁的情况，选用效率较高的链表结构，为了程序指针每一次都指向一个具体的代表一个人的结点而不需要判断，链表不带头结点。所以，对于所有人围成的圆圈所对应的数据结构采用一个不带头结点的循环链表来描述。设头指针为p，并根据具体情况移动。
为了记录退出的人的先后顺序，采用一个顺序表进行存储。程序结束后再输出依次退出的人的编号顺序。由于只记录各个结点的number值就可以，所以定义一个整型一维数组。如：int quit[n] n为一个根据实际问题定义的一个足够大的整数。
-err
Platform: |
Size: 1024 |
Author: 金瑶 |
Hits:
Description: 面向对象的作业，面向对象的数据结构-约瑟夫环-Object-oriented operation, object-oriented data structure- Joseph Central
Platform: |
Size: 8192 |
Author: lyy |
Hits:
Description: 这是一个已经通过调试的解决约瑟夫问题的（Josephus）程序，-This is a debugging solution has passed the issue of Joseph (Josephus) procedures,
Platform: |
Size: 3072 |
Author: 景秀 |
Hits:
Description: Josephus问题的array实现方式-Josephus ways array problem
Platform: |
Size: 6144 |
Author: 江枫 |
Hits:
Description: 约瑟夫环的具体操作，含有用java做链表的具体代码-Joseph Central, the specific operation, using java to do list that contains the specific code
Platform: |
Size: 1024 |
Author: 鄙视要注册的 |
Hits:
Description: 有编号从1到N的N个人坐成一圈报数，报到M的人出局，下一位再从1开始，
如此持续，直止剩下一位为止，报告此人的编号X。输入N,M，求出X。-Numbered from 1 to N of the N individuals into a lap to sit reported the number of people who report M out, the next one to start from, and so continued until the remaining one date, the report of the person s ID X. Input N, M, to derive X.
Platform: |
Size: 375808 |
Author: 陆海表 |
Hits:
Description: 用循环链表实现的约瑟夫问题。uuhorse-By cyclic Joseph realized the problem list. uuhorse
Platform: |
Size: 2048 |
Author: Whitehorse32 |
Hits:
Description: 利用josephus问题的实现了解类及其函数的使用.了解面向对象的编程思想-Realize the use of Josephus problem understanding the use of category and function. Understanding of object-oriented programming ideas
Platform: |
Size: 237568 |
Author: xieyixin |
Hits:
Description: Josephus 问题的解答。n个孩子围成圆圈，选任一个数m，从第一个孩子开始数，数到m停止，这个孩子离开，再从第一个开始数，直到剩下一个孩子。-Josephus questions. n children surrounded the circle, selected a number of m, from the beginning of their first child a few, a few m to stop the child to leave, and then started from the first few, until the rest of a child.
Platform: |
Size: 1024 |
Author: renqiang |
Hits:
Description: Josephus 问题的解答。n个孩子围成圆圈，选任一个数m，从第一个孩子开始数，数到m停止，这个孩子离开，再从第一个开始数，直到剩下一个孩子。-Josephus questions. n children surrounded the circle, selected a number of m, from the beginning of their first child a few, a few m to stop the child to leave, and then started from the first few, until the rest of a child.
Platform: |
Size: 1024 |
Author: renqiang |
Hits:
Description: Josephus 问题的解答。n个孩子围成圆圈，选任一个数m，从第一个孩子开始数，数到m停止，这个孩子离开，再从第一个开始数，直到剩下一个孩子。-Josephus questions. n children surrounded the circle, selected a number of m, from the beginning of their first child a few, a few m to stop the child to leave, and then started from the first few, until the rest of a child.
Platform: |
Size: 1024 |
Author: renqiang |
Hits:
Description: 约瑟夫环 杀犯人的问题 从当前人开始数一个数 数到可以赦免 最后剩一个人被杀-Joseph Ring kill prisoners began a few from the current count to be a pardon of a person killed in the final residual
Platform: |
Size: 1024 |
Author: 海 |
Hits:
Description: Josephus的实验,用C语言解决这个问题,内含C语言全码-Josephus experiments, using C language to solve this problem, including the entire C language code
Platform: |
Size: 8192 |
Author: 陈陈 |
Hits:
Description: 循环链表实现的约瑟夫环，主要语言是c语言，已运行通过仅供参考-Circulation list realize Joseph Central, the main language is c language, has been run through for reference only
Platform: |
Size: 1024 |
Author: 牧野叶子 |
Hits:
Description: 本文档是（作者：钱能）《C＋＋程序设计教程》系列的部分辅助代码。
选题编辑：张朝阳
责任编辑：徐培忠、林庆嘉
有关代码的具体问题请与作者联系。-This document is (Author: money can)
Platform: |
Size: 44032 |
Author: 宋栋 |
Hits:
Description: Josephus算法，在winform中实现！-Josephus algorithm, in WinForm to achieve!
Platform: |
Size: 33792 |
Author: duwei |
Hits:
Description: using C++ Language to accomplish a link-list to solve the problem of Josephus.
Platform: |
Size: 497664 |
Author: pig |
Hits:
Description: 约瑟夫环 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of
Platform: |
Size: 1024 |
Author: mailan7749 |
Hits:
Description: 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。
-Known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out.
Platform: |
Size: 2048 |
Author: 李强 |
Hits:
Description: java源代码，经典问题，约瑟夫环问题-java source code, the classic problem, the issue of Joseph Central
Platform: |
Size: 10240 |
Author: zhaopengfei |
Hits:
«
1
2
3
45
6
7
8
9
10
...
34
»