搜索资源列表
john
- 约瑟夫环文题描述：已知n个人围坐圆桌周围。从编号k的人开始报数，数到m的那个人出列；他的下一个人有1开始报数，数到m的那个人呢出列，一次规律重复下去-Joseph ring title descr iption: n known individuals sitting around the table.People began to count off number k, count to m out the man He has 1 started to count off the next
TestJosephus
- 华为编程大赛 简洁明了的约瑟夫环计算。代码支持指定从任意位置开始报数。支持指定报到任意数时候退出。-The programming competition held by HUAWEI
Joseph-ring-problem-_CPP
- 约瑟夫环问题_C++约瑟夫问题如下：已知n个人（n>=1）围坐一圆桌周围，从1开始顺序编号。从序号为1的人开始报数，顺时针数到m的那个人出列。他的下一个人又从1开始报数，数到m的那个人又出列。依此规则重复下去，直到所有人全部出列。请问最后一个出列的人的编号。-Joseph problem as follows: given n individuals (n>=1) sitting around a round table, sequence number the beginning
yuesefu-game
- 用c++语言在vs环境中实现的约瑟夫环小游戏，供初学者参考使用-Using c++ language environment vs implemented Josephus games, reference for beginners to use
Circulink
- C#利用循环双向链表解决约瑟夫环问题，算法简明可读性强，是学习数据结构的优秀材料。-Using C# to solve the problem of Joseph ring cycle of two-way linked list algorithm is concise, readable, is excellent learning materials data structure.
Josephus
- 约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列-Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respec
001
- 单链表、双链表、队列建立、测长、打印、删除、插入、逆置完整代码，约瑟夫环，-Single list, double-linked lists, queues build, test length, print, delete, insert, set against the complete code, Josephus,
JosephGame
- mfc约瑟夫环的实现 基于对话框的约瑟夫环，比较简单实用-Josephus achieve mfc Josephus dialog-based, relatively simple and practical
Joseph
- 约瑟夫环问题，一群人围在一起做成环状，从某个编号开始报数，数到某个数的时候，此人出列，下一个人重新报数，一直循环，直到所有人出列，约瑟夫环结束。-Josephus problem, a group of people get together to make a ring, a number countin, count to a number of time, this person out of the line, the next person to re-report the numb
YUESEFU
- 数据结构经典练习题，约瑟夫环，完整版，编译无错误-data structure exercise
Joseph-ring-
- 这是一个约瑟夫环数据结构实现程序，当任意给定人数n和密码m后，设计算法求n个人出圈的次序。-Joseph ring which is a data structure implementation procedures, when any given number n and password m, the order of the design algorithm for n personal ones.
JAVA_7
- JAVA实习代码，内含完整的说明文档，求解约瑟夫环，算法简单，可实现自定义循环次数。-JAVA internship code, containing complete documentation, Josephus solving simple algorithm can implement custom cycles.
yuesefuhuan
- 解决有关约瑟夫环的数学计算问题,约瑟夫环的相关定义可上网查询-solve the problem about Josephus by airthmetic
java2
- 杨之江老师的java课程实习代码 实习二求解约瑟夫环，用数组实现- Yang Jiang s teacher internship program code for java Internship two solving Josephus, an array realization
Ring
- 用java代码实现约瑟夫环，去掉的人用×表示-Achieve Josephus
jose1
- 递推算法求解扩展约瑟夫环问题，C++源代码-Recursive algorithm for solving extended Joseph ring problem, C++ source code
yuesehuanwenti
- 约瑟夫环问题。本程序要求设编号为1-n的n(n>0)个人按顺时针方向围成一圈．首先第1个人从1开始顺时针报数．报m的人(m 为正整数)．令其出列。然后再从他的下一个人开始，重新从1顺时针报数，报m的人，再令其出列。如此下去，直到圈中所有人出列为止。-Josephus problem. The procedural requirements set numbered 1-n of n (n> 0) Personal clockwise circle. First 1st person
JosephProblemTest
- 使用java语言编写的一个求解约瑟夫环的程序。- A program for solving the Joseph ring using java language
Joseph-ring
- 实现约瑟夫环m的动态循环，RAR文件直接用C和C++开发环境的使用可以直接编译成可执行EXE文件-To achieve the dynamic cycle of Joseph m, RAR file directly with the use of C and C++ development environment can be directly compiled to form an executable EXE file
xianxingbiao
- 数据结构中线性表的c++实现，包括经典问题约瑟夫环。-Linear table data structures c++ implementation, including the classic problem Josephus.