搜索资源列表
houzhixuandawang
- 一堆猴子都有编号，编号是1，2，3 ...m ,这群猴子（m个）按照1--m的顺序围坐一圈，从第1开始数，每数到第N个，该猴子就要离开此圈，这样依次下来，直到圈中只剩下最后一只猴子，则该猴子为大王。-monkeys have a pile of numbers, numbers 1, 2, 3 ... m, these monkeys (m) In accordance with the 1 -- m sitting in the order in a circle, starting from
vcddd
- 都是以前随手编写的笑程序:总的来说只有五个<回文游戏,层次遍历二叉树,猴子选大王,先序、中序、后序遍历的递归算法等等> 如果对你又帮助你就下来看看吧-are readily prepared by the previous laugh : Overall only five lt; Palindrome games, the level traverse binary tree, monkey king election, the first sequence, sequence,
Vs2005使用SpiderMonkey
- 本ppt文档详细介绍了，如何编译spidermonkey js-1.7.0.tar.gz，并且使用Vs2005 IDE的环境搭建。
monkey
- 自己写的集猴子报数（约瑟夫环）和简单计算器于一体的程序，通过单击按钮实现功能切换。-My own set of monkeys reported number (Joseph Central) and a simple calculator in one program, by clicking the button to switch to achieve functionality.
monkey
- 单文档+对话框 实现猴子报数（约瑟夫）功能并输入出队序列。-Single Document+ dialog to achieve the monkeys reported that the number of features