Bonmin-1.6.0

本书主要介绍了如何用API函数进行网络间通信(The book introduces how to use the API function communication networks)

Desktop drawing program, for beginners to understand the vc code is a good example, performance fun and easy to learn

说明：  很多下位机程序员都有这样的经历，在交付工程的时候对方要求提供源程序，而大多数下位机程序员都知道交出源程序是意味着什么，所以为了保护各位下位机程序员的合法利益.这个工具，伪装过后的源程序可以编译通过。(many lower computer programmers have the same experience that the delivery of the other works on the request source, and most of the next crew to surrender programmers are aware of what it means to the source, Therefore, in order to protect you and lower computer programmer's legitimate interests. this tool, camouflage after the source compile.)

说明：  国内文件驱动编程知名人物蔡大侠的教程源代码，第一部分，主要实现对文件读写操作的拦截(domestic paper-driven programming eminent figures Cai heroes tutorials source code, the first part of the main document and write interception)

zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )

poa算法，关于梯级水电调度的c#算法源程序。适合梯级水电站短期优化调度(The algorithm, on the dispatch of cascade c# algorithm source program. For the short-term optimal scheduling of cascade hydropower stations)

红月五星中文事件编辑器红月五星中文事件编辑器(Luna Star Chinese Event EditorLuna Star Chinese Event Editor)

串口通讯类及其例子程序,很有用的串口调试范列(Serial Communication category and examples of procedures, useful for debugging serial Fan out)

bump mapping with C++

从windows程序种查找图标资源，提取图标。(Find the icon resource the windows program, extract the icon.)