WindowsFormsApp1

模型多角度视图的界定,界面时尚新颖,可控参考,(The definition of multi-angle view of the model, the interface is fashionable and novel, controllable reference,)

NDIS HOOK实例，做防火墙比中间层驱动更稳定(NDIS HOOK example, than do the middle layer firewall driven more stable)

cmake+window，用于cmake生成window代码。(cmake+window. Generating windows code for cmake.)

一个用MFC编写的TRACEROUT程序，十分好用-Prepared to use MFC a TRACEROUT procedure is very easy to use

说明：  按开发板上的“S7”键复位，计时器从零开始计时，数码管上显示秒钟与分钟值。(Press the "S7" key on the development board to reset, the timer starts from zero, and the value of seconds and minutes is displayed on the digital tube.)

FAT文件格式分析，适用于嵌入式BIOS开发(FAT file format analysis, suitable for embedded BIOS development)

Windows API 一日一练(101-150)(Windows API 101-150)

ascii code image file

C段反查，调用的别人网站接口，改进中..(Section C reverse lookup, calling others site interface improvements ..)

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. )