windows wdm 设备驱动开发指南，很经典的资料，做驱动程序的可以...

图像压缩问题要求确定象素序列{p1,p2,…,pn}的最优分段，使得依此分段所需的存储空间最少。每个分段的长度不超过256位。数字化图像是m×m的像素阵列。假定每个像素有一个0 ~ 2 5 5的灰度值。因此存储一个像素至多需8位。若每个像素存储都用最大位8位，则总的存储空间为8m^2 位。为了减少存储空间，我们将采用变长模式（ variable bit scheme），即不同像素用不同位数来存储。像素值为0和1时只需1位存储空间； 值2、3各需2位；值4，5，6和7各需3位；以此类推。-image compression defined pixel sequence (p1, p2, ..., pn) sub-optimal, sub accordingly makes the storage space required at least. The length of each section is not more than 256. The digital image is m m pixel arrays. Assume that each pixel is a 0-2 5 5 of the gray values. Therefore storage of up to a pixel 8. If each pixel with the largest storage capacity of 8-bit, the total storage space for 8m ^ 2. In order to reduce storage space, and we will use variable-length model (variable bit scheme), that is different with different pixel median storage. Pixel values of 0 and 1 and only a storage space; The value of 2,3 required two; Value 4,5,6 and 7 of the required three; Analogy.

这是商店购物系统，在商店里的商品选中的放入购物车，再去售票口。-This is shopping system, the merchandise stores at selected Add to shopping cart, then the ticket booth.

这是一个函数模板的题目,用的是函数模板解决简单的问题-This is a function of template topics, using a template function to a simple question

这是一个“计算器”，已经成功调试，希望对初学者有用，谢谢！-This is a "calculator", which has been successfully tested and hope useful for beginners, thank you!

给出一个连通带权的无向图，找出该图的最小生成树。并带有问题的详细描述及测试数据。-Given a connected weighted undirected graph, find the minimum spanning tree graph. With a detailed description of the problem and the test data.

vc下的数据库编程资料,写的很详细,比较适合初学者使用,是入门的好教材-vc under the Database Programming information, write a very detailed, more suitable for beginners, entry is good material

数据库变成 欲望 军事基地巨大广泛的-database into tremendous desire extensive military bases

这是我公司的源代码mapxtreme

WinCE下的ActiveX控件开发，使用Visual C-ActiveX control under WinCE development, use Visual C++