搜索资源列表
c
- 约瑟夫问题的实现:设有n个人围坐在圆桌周围,现从某个位置m(1≤m≤n)上的人开始报数,报数到k的人就站出来。下一个人,即原来的第k+1个位置上的人,又从1开始报数,再报数到k的人站出来。依此重复下去,直到全部的人都站出来为止。试设计一个程序求出出列序列。-Joseph realized the problem: There are n people sitting around the round table, is from a position of m (1 ≤ m ≤ n) repor
Jusef
- 实现约瑟夫问题,可以在windows 7系统下,vc++6.0环境中顺利运行。-used for the problem of Jusef,a little short and simple,it is not the MFC.it is about dos ecironment.
yuesefu
- 利用链表实现约瑟夫问题的求解,并且输出报数的孩子的序号,同时检测输入数据的正确性。-Joseph realized the problem by solving the linked list, and the output number of children reported to the serial number, while testing the correctness of the input data.
yuesefu
- 用单链表解决约瑟夫问题,包含两个头文件,一个CPP文件-Joseph single linked list to solve the problem, contains two header files, a CPP file
xz
- c++用循环链表解决约瑟夫问题课程设计代码-c++ problem with the circulation list address curriculum design code Joseph
51xianshi-yuesefu-wenti-jieguo
- 用STC89C52单片机的数码管显示约瑟夫问题的结果,一种新型的约瑟夫解决方法,思路非常清晰。-MCU with digital display STC89C52 Joseph problems result, a new Joseph solutions, ideas very clear.
Josephproblems
- 约瑟夫问题,约瑟问题的解决。约瑟 夫问题,约瑟问题的解决。约瑟夫问题,约瑟问题的解决。-Joseph problems, Joseph problems. Joseph problems, Joseph problems. Joseph problems, Joseph problems. Joseph problems, Joseph problems.
1
- 解决约瑟夫问题的巧妙程序,130行代码搞定!你懂得-Clever procedure to solve the problem of Joseph, 130 lines of code to get! You know
Joseph
- 约瑟夫问题解决好人与坏人问题:有n个人围成一圈,分别报数,报到为m的出列,也就是经典的约瑟夫问题。先要解决这样一个问题。围成一圈的人有k个好人,k个坏人,在进行约瑟夫问题报数时,符合在坏人没有都出列前第一个好人没有出列这样的情况的m的最小值为多少?-Joseph, good and bad problem-solving problem: there are n people form a circle, respectively, reported that the number of reg
joseph
- 约瑟夫问题如下:已知n个人(n>=1)围坐一圆桌周围,从1开始顺序编号。从序号为1的人开始报数,顺时针数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规则重复下去,直到所有人全部出列。请问最后一个出列的人的编号。 -Joseph questions are as follows: Given n individuals (n> = 1) sitting around a round table, numbered sequentially startin
josepharray
- 约瑟夫问题,用链式结构实现,有N个数,从S开始报数M,列出前后出序序列-Joseph problems with the chain structure to achieve, there are N number, starting from the S reported that the number M, before and after the order listed in the sequence
JosephLink
- 约瑟夫问题,链表实现。有N个数,从S开始报数m,打印出序序列-Joseph problems linked list. There are N number, starting from the S reported that the number m, print out the order sequence
Joseph
- 约瑟夫问题 使用了链表方法 n玩家数到m的人出局 找到最后胜者-Joseph problems using the list method n to m number of players to find out who the final winner
Josephus
- 约瑟夫问题,用C++实现的约瑟夫问题。输入n和d的值,输出出列序列-Joseph problems with C++ implementation of Joseph problems. Enter n and d values, the output of the column sequence
YoSePh
- 通过一个比较新颖的算法解决约瑟夫问题,有两个参数一个为总个数N,一个为间隔数目为M-Solve YosePh Problems By a New method
Josephus
- 用C++实现Josephus约瑟夫问题,简单的小程序,供初学者参考-In C++ implementation Josephus Josephus problem, a small little program
POJ
- POJ1048,加强版的约瑟夫问题 难度中等-POJ1048, enhanced version of Joseph problems
1
- 用双向链表实现约瑟夫问题,c++开发实现,数据结构 小孩个数可变;数数间隔可变;起始位置可变;数数方向可变-Joseph with a doubly linked list implementation issues, c++ development to achieve, the number of children variable data structure count interval variable starting position variable count direc
test
- 约瑟夫问题 设有n个人站成一圈,每个人有不同的编号i(1≤i≤n)。从编号为1的人开始按顺时针方向“1,2,3,4…”循环报数,数到m的人出列,然后从出列者的下一个人重新开始报数,数到m的人又出列,如此重复进行,直到n个人都出列为止。约瑟夫问题是:对于任意给定的n个人的原始排列顺序和m值,求出n个人的出列顺序。 例如,当8个人的原始排列顺序为 1 2 3 4 5 6 7 8 并且m=4时,其出列顺序为 4 8 5 2 1 3 7 6 -Documents and S
josephus
- 约瑟夫问题c语言解决方法 数据结构方法解决问题-The solve of the josephus problem by c language Data structure method Solve problems