搜索资源列表
josephu
- 类似于猴子选大王问题,即josephu问题,设定循环总数和模数,可得到解-King of the monkeys is similar to the election, namely josephu problem, set the cycle and the modulus of the total number of available solutions
chit
- 猴子吃桃问题的一种解答!有兴趣可以-Monkeys eat a peach to answer the question! Who are interested can
monkeyking
- 这是我用c++做的一个猴子选大王的算法,可能本站有相关的,但是我这个算法很经典,给大家参考一下,可能有需要的!-This is what I used c++ Do a monkey king election algorithms, may have a related site, but I this algorithm is a classic look for your reference, you may need!
houzixuandawang
- n只猴子要选大王,选举方法如下,所有猴子按1,2,... ,n编号围坐一圈,从第一好看是按照1,2,... ,m报数,凡报到m号的退 出圈外 ,如此循环,直到圈内只剩一只猴子时,这只猴子就是大王。-n monkeys to choose the king, the election is as follows, all the monkeys by 1,2, ..., n number around a circle, from the first look is in accordan
6
- 海滩上有一堆桃子,五只猴子来分。第一只猴子把这堆桃子凭据分为五份,多了一个,这只 猴子把多的一个扔入海中,拿走了一份。第二只猴子把剩下的桃子又平均分成五份,又多了 一个,它同样把多的一个扔入海中,拿走了一份,第三、第四、第五只猴子都是这样做的, 问海滩上原来最少有多少个桃子? -The beach there is a pile of peaches, five monkeys for hours. The first monkeys of this heap
shujujiegou
- 本课题主要根据功能需要开发软件解决迷宫求解的问题。可以输入一个任 意大小的迷宫数据,用非递归的方法求出一条走出迷宫的路径,并将路径输出。以及Joseph环问题,利用单向循环链表存储结构模拟此,按照出列的顺序输出各个人的编号。还有猴子选大王问题。数据结构课程设计时做的-This issue primarily on the basis of functional need to develop software solutions to solve maze problems. Can enter
qq
- 数据库 上机小程序 猴子选大王 源代码-Database machine applet source code monkey king election
monkey
- 猴子选大王 任务: 一堆猴子都有编号,编号是1,2,3 ...m ,这群猴子(m个)按照1-m的顺序围坐一圈,从第1开始数,每数到第N个,该猴子就要离开此圈,这样依次下来,直到圈中只剩下最后一只猴子,则该猴子为大王。 功能要求: 1. 输入数据:输入m,n m,n 为整数,n<m 2. 输出形式:中文提示按照m个猴子,数n 个数的方法,输出为大王的猴子是几号 ,建立一个函数来实现此功能。 -err
shiyan2_1_2
- 大学数据结构课程常用的程序~猴子选大王~带有详尽的说明-University curriculum data structure commonly used procedures ~ ~ Monkey King the election with a detailed descr iption of
11111
- 猴子选大王,基于VC的小程序。通过数据库搜索选出目标数。使我们的一次课程设计。-Election Monkey King
skk
- 建立循环链表,实现选猴王的程序:输入N只猴子,从第一只猴子开始报数(M),数到m的那只猴子就推出,如此循环,剩下的最后一直猴子就是猴王-Circulation list set up, implementation procedures for the election of the King: Enter the N monkeys, monkeys from the first start off (M), only a few of the m Monkey on the introduc
Monkey
- 这是一个简单的算法,用循环链表实现了猴子选王。用C语言描述-This is a simple algorithm, using the cycle to achieve the monkeys selected list king. Described using C language
monkey
- n个猴子围坐一圈并按照顺时针方向从1到n编号,从第s个猴子开始进行1到m的报数,报数到第m的猴子退出报数,从紧挨它的下一个猴子重新开始1到m的报数,如此进行下去知道所有的猴子都退出为止。求给出这n个猴子的退出的顺序表。-n a monkey sitting around and in accordance with the clockwise direction from 1 to n number of monkeys from the first s start from 1 to m of
J
- 数据结构中的约瑟夫换的问题,或者称为猴子选大王的问题,非常普遍-Data structure for the issue of Joseph, or known as the monkey king of the issue of elections, is very common
houzixuandaiwang
- 猴子选大王是个重要问题 猴子选大王是个重要问题-houzixuandawang
SM
- 任务:一堆猴子都有编号,编号是1,2,3 ...m ,这群猴子(m个)按照1-m的顺序围坐一圈,从第1开始数,每数到第N个,该猴子就要离开此圈,这样依次下来,直到圈中只剩下最后一只猴子,则该猴子为大王。 功能:输入数据:输入m,n(m,n 为整数且n<m) 输出形式:中文提示按照m个猴子,数n 个数的方法,输出为大王的猴子是几号 ,建立一个函数来实现此功能-Tasks: a bunch of monkeys have a number, number is 1,2,3 ... m,
Josephissues
- 求解约瑟夫问题:猴子选大王:设有n个猴子围坐一圈,编号为1到n ,从1号开始报数,数到m的猴子出列;下一个猴子又从1开始报数,数到m 的猴子又出列,依次类推,直到最后一个便是大王。要求输出出列顺序,分别以n=30,m=7;n=7,m=30运行程序,检查结果是否正确。-Solving the issue of Joseph: King of the monkeys selected: with a monkey n around a circle, numbered 1 to n, from th
struct
- 数据结构课程设计,包括猴子选大王,文章编辑,航空系统,纸牌游戏。-Curriculum design data structure, including the monkey king election, the article editor, aviation systems, card games.
houzixuandawang
- 一个简单的游戏,看谁是最后的大王,一群猴子中的,美猴王。。。。。最后的胜利者-A big tiger and a small tiger are hungry.They are behind the monkeys garden. :It s one o clock.Go and have a look.What are the monkeys doing?
hh
- 一堆猴子都有编号,编号是1,2,3 ...m ,这群猴子(m个)按照1-m的顺序围坐一圈,从第1开始数,每数到第N个,该猴子就要离开此圈,这样依次下来,直到圈中只剩下最后一只猴子,则该猴子为大王。 -Monkeys have a pile of numbers is the number 1,2,3 ... m, this group of monkeys (m) of 1-m in accordance with the order around a circle, from the be