资源列表
WebPickUp
- 将网页上的文字提取下来保存在本地数据文件的工具.-website will be extracted from the text stored in the local data files tool.
cffx
- 编译试验,非常有好处,有很大参考价值,是词法分析-compiler test, a very good, very important reference value of lexical analysis
smartfox
- Foxmail 的账号存储机制,并基于此编写一个辅助工具SmartFox ,实现闪存“随身邮”功能-Skills account storage mechanisms, and on the preparation of this SmartFox an auxiliary tool, Flash achieve "unaccompanied Post" function
ccf
- 用C++实现使用链表动态分配二维数组 用C++实现使用链表动态分配二维数组-C realization use dynamic allocation chain C Two-dimensional arrays to achieve dynamic distribution chain using two-dimensional array
LR0
- 用C++实现LR(0)语法分析 用C++实现LR(0)语法分析-C achieve LR (0) C syntax analysis achieve LR (0) syntax analysis
LL1
- 用C++实现LL(1)文法分析 用C++实现LL(1)文法分析-C achieve LL (1) grammar analysis C achieve LL (1) grammar analysis
sfyx
- 用C++实现算符优先分析程序 用C++实现算符优先分析程序-C operator priority to achieve analysis program with C operator priority to achieve analysis program
pwdspy_src
- 查看编辑框密码的程序源代码.通过设置消息勾子实现.-View password edit box of source code. By setting the news hook to achieve.
NNP
- 最近点对问题,输入数据生成器自动生成2位点对,输出制定电的最近邻-nearest point of the problem, the input data generator automatically generate two points right, electrical output of the nearest neighbor
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
erchashu
- 建立二叉树,统计二叉树中度为2的结点个数和叶子结点个数( 用递归或非递归的方法都可以,先序、中序或后序均可)-establish binary tree, Statistics for the two binary tree to moderate the number of nodes and the number of nodes leaves (with the recursive and non - recursive method can be first order, After t
zhipaiyouxi
- 编号为1-52张牌,正面向上,从第2张开始,以2为基数,是2的倍数的牌翻一次,直到最后一张牌;然后,从第3张开始,以3为基数,是3的倍数的牌翻一次,直到最后一张牌;然后…从第4张开始,以4为基数,是4的倍数的牌翻一次, 直到最后一张牌;...再依次5的倍数的牌翻一次,6的,7的 直到 以52为基数的 翻过,输出:这时正面向上的牌有哪些?-No. 1-52 card in a positive, progressive, from the first two, with two as the ba