VFP做的简易计算器，可作为软件组件使用。

use hook dll

Please read your package and describe it at least 40 bytes in English. System will automatically delete the directory of debug and release, so please do not put files on these two directory. -Please read your package and describe it at least 40 bytes in English. System will automatically delete the directory of debug and release, so please do not put files on these two directory.Please read your package and describe it at least 40 bytes in English. System will automatically delete the directory of debug and release, so please do not put files on these two directory.

这是容易学习 PHP 代码。 有很多的 PHP 代码的示例。 akjlkkja kljlkjaf 所有加号和减号2 大整数可以合并成一个发布. 数量能为负数/积极.

this program calculates combination s

A*算法属于一种启发式搜索。它扩展结点的次序类似于广度优先搜索，但不同的是每生成一个子结点需要计算估价函数F，以估算起始结点到该结点的代价及它到达目标结点的代价的和；每当扩展结点时，总是在所有待扩展结点中选择具有最小F值的结点作为扩展对象，以便使搜索尽量沿最有希望的方向进行。 -A* algorithm is a heuristic search. It extended node in the order of priority similar to the breadth of search, but in every generation is a sub-node calculated valuation function F, to estimate initial node to the node, the price and it arrived at the target node, and the price; Whenever expansion node, the question has always extended to all nodes with the smallest choosing F value of the node as expansion targets, in order to search as far as possible along the most promising direction.

是一个物料管理系统-is a material management system

著名的东软界面，含源码！快抢吧-famous Neusoft interface with source code! It Kuaicheng

考虑整数线性规划问题max（ci*xi）试设计一个解此问题的动态规划算法，并分析算法的计算复杂性-Consider the integer linear programming problem max (ci* xi) try to design a solution of this problem, dynamic programming algorithm, and analysis of algorithms computational complexity

下载 SAMP管道求死地图,语言为C++ 需要有PWN才可以使用,联机的GTA-Download SAMP pipeline to die maps, language is C++ need to have PWN can use, on-line GTA

mfc的RTTI过程的模拟，对与理解MFC的RTTI原理有很好的帮助，源码详细编写模拟了MFC的RTTI响应的宏-mfc of RTTI process simulation, and understanding of the principle of MFC