驱动开发wince宝典，第二部分，强烈推荐，不容错过

n皇后问题的vc++解法，供朋友们参考，比较有益，一起学习吧-n queen problem vc++ Solution for friends reference, a useful comparison, to learn it

一个纸牌游戏.rar-a poker game. Rar

非常不错的摄象头程序，对于开发这类程序的人有福了。-A perfect camera application,A good new for you.

有史以来最牛的hookapi开发包，让编写钩子变得很简单，你只需要编写自己的处理函数即可，其他的都是通用的。赶紧分享-Ever cattle hookapi development kit to enable the preparation of the hook becomes very simple, you just need to write your own handler you do, other are common. Hurry Share

网络神偷+v6.5[源码]. 网络神偷+v6.5[源码]-Network Mission+ V6.5 [source]. Network Thief+ V6.5 [source]

220个经典C程序源码，学习C语言的基础教程，从第一个hello world程序到最后的大工程项目，通过这220个程序，让你称为C编程高手

这是一个用VB编写的最简单的右键菜单实例-The Simplest Popup Menu

16 Mbit，双I/O，4 KB子扇区擦除，

如何在命令行下编译创建VC程序-how the command line compiler to create VC Program

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the