useful to look at the

/*本人先后编了两次，第二次进行了改进。改进的思想主要是注意到棋盘上每一点的下一可到达点的个数 （下称为权值）不同，对于可到达点较少（权值小）的点应该先跳上去，这样后来跳的点可跳的方向就比 较多，回溯的现象就比较少，这样就可以大幅度提高速度*/-/* I have compiled twice, the second time for improvements. Improved thinking is that every point on the chessboard of the next point can be reached by the number (hereinafter referred to as the right value), For less accessible spots (small weights) should be the first point and jumped out of the way and then jump to the point of jumping on the direction of more, Looking back on the phenomenon of relatively small, we can significantly improve the speed* /

效率很高的“猜数字”游戏程序解法（至多7次，平均小于5.5次-very efficient "viewing" game procedures Solution (up to seven times less than the average 5.5

PHP动态流输出下载，比常规下无安全，上传后自动HASH后保存！-Dynamic stream output download, no security than conventional next!

实现卷积，DFT FFT 算法的源代码，希望对一些朋友会有帮助 -Realize convolution, DFT FFT algorithm source code, in the hope that some of my friends will be helpful

this document is related to the orcad layout plus. this document is useful in understanding and starting the orcad pcb design tool layout plus.

shadow detection paper from net,it is value

本代码是俄罗斯方块与贪吃蛇游戏的源代码，希望各位多多支持，谢谢了！-the code of the Russian block and Snake game"s source code, you can support, thank you!

五子棋程序，vc开发，双人对战，网络对战-331 procedures, vc development, double the war, the network war

This program describes the concept of polymorphism in C++. Example of Inheritance is given in this code

数据结构与算法分析：C语言描述第二版 的习题答案本书中含有对Addison-Wesley 著的课本第二版大多数习题的答案 .目录1. Chapter 1: 介绍  12. Chapter 2: 算法分析  43. Chapter 3: 列、栈和队列  74. Chapter 4: 树 145. Chapter 5: 哈希  256. Chapter 6: 优先队列 (堆) . 297. Chapter 7: 筛选 .. 368. Chapter 8: 分离集 ADT  429. Chapter 9: 图形算法  4510. Chapter 10: 算法设计技术 . 5411. Chapter 11: 分摊分析 6312. Chapter 12: 高级数据结构和实现 .. 66