搜索资源列表
猴子吃桃子
- vb猴子吃桃子算法实现-vb monkeys eat peaches Algorithm
猴子选大王
- 算法，猴子选大王-algorithm, a monkey king election
猴子选大王的问题键表C
- 一个用C写的猴子选大王问题，是用键表实现的，拿出来和大家讨论一下-a monkey was elected king of the problem by using keys table to achieve, and we like to talk about
猴子选大王的问题键表C2
- 又一个用C语言编写的猴子先大王的问题，也是用键表写的这个简单一点。-also a C language prepared by the first king of the monkeys, as well as bonding with the written form of this simple point.
猴子踩蕉皮
- 其实就是一个陨石撞飞机的游戏，不过我将它改成了香蕉皮跟猴子
猴子选大王
- 关于猴子选大王的，运用了链表等功能建立一个不带头结点的单链表 利用单链表循环
monkey_ok
- 实现猴子选大王的程序,已经调通了!! 猴子的密码是3,如果密码改变,可以在相宜地方加上for循环-achieve monkey king of the election process, Qualcomm has been transferred! ! Monkey is the password 3, password changes, coupled with the inexpensive places for recycling
猴子吃桃子
- vb猴子吃桃子算法实现-vb monkeys eat peaches Algorithm
猴子选大王
- 算法，猴子选大王-algorithm, a monkey king election
猴子选大王的问题键表C
- 一个用C写的猴子选大王问题，是用键表实现的，拿出来和大家讨论一下-a monkey was elected king of the problem by using keys table to achieve, and we like to talk about
猴子选大王的问题键表C2
- 又一个用C语言编写的猴子先大王的问题，也是用键表写的这个简单一点。-also a C language prepared by the first king of the monkeys, as well as bonding with the written form of this simple point.
MKing
- 猴子选大王，程序采用了循环链表实现。含有注释，具体操作依据可执行文件。-monkey king elections, the procedures used to achieve Chain cycle. Notes contain the specific basis for executable files.
monkey~~~~
- 一个简单的数据结构 解决经典的猴子选大王问题-a simple data structure to solve the classic problem of monkeys elected king
houzixuandawang
- 练习链表的使用与操作的猴子选大王程序，以反复建立链表的方式有效解决了有意思的数学问题-practicing the use and operation of the monkey king election procedures Listless repeatedly to establish an effective way to solve an interesting mathematical problem
monkeyandpeach
- 猴子吃桃的问题： 此程序是用递归做出来的，方法很简单-monkeys eat a peach : This procedure is done using the recursive method is very simple
2006102411
- 猴子选大王，c语言，有源码，有注释，可供使用交流。-election monkey king, c language, the source code, notes, the availability of the exchange.
猴子选大王
- 猴子选大王，有N只猴子，从1～N进行编号。它们按照编号的顺时针方向，排成一个圆圈，然后从第一只猴子开始报数。第一只猴子报1，以后每只猴子报的数字都是它前面猴子所报数字加1。如果一只猴子报的数字是M，则该猴子出列，下一只猴子重新从1开始报数。剩下的猴子继续排成一个圆圈报数，直到全部的猴子都出列为止。最后一个出列的猴子胜出。按照上述规则，编写程序选出排成一圈的猴子中的大王。(Monkey King, N monkeys, numbered
猴子摘香蕉
- 一阶谓词逻辑实现经典的猴子摘香蕉问题，C++语言编写，(Realizing the first order logic monkey to pick the banana problem)
猴子选大王
- 猴子选大王游戏的c++编程实现，可以参考一下。(The code of monkeys choose the king's game)
猴子吃桃子
- 猴子吃桃子小游戏，使用vb.net 编程(Monkeys eat peaches small game, using vb.net programming)