Welcome![Sign In][Sign Up]
Location:
Search - houzixuandawang

Search list

[Otherhouzixuandawang

Description: 练习链表的使用与操作的猴子选大王程序,以反复建立链表的方式有效解决了有意思的数学问题-practicing the use and operation of the monkey king election procedures Listless repeatedly to establish an effective way to solve an interesting mathematical problem
Platform: | Size: 820 | Author: 优扬 | Hits:

[Other resourcehouzixuandawang

Description: 猴子选大王问题,使用循环链表实现,比较简洁,初学数据结构,欢迎指正
Platform: | Size: 805 | Author: 叶若寒 | Hits:

[Otherhouzixuandawang

Description: 练习链表的使用与操作的猴子选大王程序,以反复建立链表的方式有效解决了有意思的数学问题-practicing the use and operation of the monkey king election procedures Listless repeatedly to establish an effective way to solve an interesting mathematical problem
Platform: | Size: 1024 | Author: 优扬 | Hits:

[Data structshouzixuandawang

Description: 猴子选大王问题,使用循环链表实现,比较简洁,初学数据结构,欢迎指正-Elected king of the monkeys, the use of cycle chain realize, more concise, learning data structures, please correct me
Platform: | Size: 1024 | Author: 叶若寒 | Hits:

[Otherhouzixuandawang

Description: 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 accordance with the 1,2, ..., m off, where a report m No. exit outside, so the cycle until the circle only when a monkey, the monkey is king.
Platform: | Size: 1024 | Author: 王靖 | Hits:

[Documentshouzixuandaiwang

Description: 猴子选大王是个重要问题 猴子选大王是个重要问题-houzixuandawang
Platform: | Size: 1024 | Author: 彭林 | Hits:

[Windows Develophouzixuandawang

Description: 一个简单的游戏,看谁是最后的大王,一群猴子中的,美猴王。。。。。最后的胜利者-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?
Platform: | Size: 2048 | Author: ls | Hits:

[Otherhouzixuandawang

Description: 有M只猴子围成一圈,每只各一个从1到M中的编号,打算从中选出一个大王;经过协商,决定出选大王的规则:从第一个开始循环报数,数到N的猴子出圈,最后剩下来的就是大王。要求:从键盘输入M、N,编程计算哪一个编号的猴子成为大王 -Monkeys have M circle, each one each from 1 to M in number, intended to select from a king after consultations, decided to select a king s rule: starting from the first one reported that the number of cycles, the number of monkeys to N a circle, the last remaining is the king. Requirements: from the keyboard input M, N, the calculation program which became a number of monkey king
Platform: | Size: 165888 | Author: 高攀 | Hits:

[CSharphouzixuandawang

Description: 猴子选大王,用C++ 实现的源程序,欢迎下载-Monkey King the election, using C++ source code implementation
Platform: | Size: 3072 | Author: 安来 | Hits:

[Data structshouzixuandawang

Description: 猴子选大王 数据结构课程设计 C++编写-The Monkey King data structure course design choose c++ code
Platform: | Size: 34816 | Author: as | Hits:

[CSharphouzixuandawang

Description: C++中的经典问题,猴子选大王。用递归算法实现的代码-In c++, the Monkey King classic question choose. Use recursion algorithm code
Platform: | Size: 877568 | Author: 紫剑 | Hits:

[Data structshouzixuandawang

Description: 经典程序,用c语言程序编写,用数据结构知识,初学者的必选。-this is an interesting problem.
Platform: | Size: 3072 | Author: 李磊 | Hits:

[Otherhouzixuandawang-

Description: 猴子选大王 计导程序设计 C语言编程题目-The monkeys election magnate C language programming topics
Platform: | Size: 2048 | Author: mo_yan | Hits:

[Communicationhouzixuandawang

Description: 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, the first look is in accordance with the 1,2, ..., m off, where a report m No. exit outside, so the cycle until the circle only when a monkey, the monkey is king.
Platform: | Size: 1024 | Author: sha311640 | Hits:

CodeBus www.codebus.net