Visual C++ 6.0应用编程150例

目录ftp客户端是一个比较简单的ftp程序，但是程序提供了各种接口，能够让读者看法出各种复杂的ftp程序，程序中的各个程序模块均已经实现-Contents ftp client is a relatively simple ftp procedures, but the procedures for its interface, to enable readers to view all sorts of complex ftp procedures, the procedures for the various program modules will have been achieved

利用winsock进行通讯的简单编程实例-Winsock to communicate using simple programming examples

电子书制作相关的电子书籍，非常适合初学者学习，内容详尽-Production of relevant e-books e-books, very suitable for beginners to learn, the content in detail

基于改进的多目标粒子群算法优化多目标最优潮流，可用于最优潮流的学习，算法注释较为详细

CRT在计算机上的运行问题，可解决N个同余式组的问题-CRT running on the computer problem

有史以来最牛的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

在tc中实现鼠标功能 提供一个实例 适合初学-Implemented in the tc feature provides an example of the mouse

sdf sd-sdf sdf sd

source internet management

图像压缩问题要求确定象素序列{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.