jieqi code

这是用VC++编的一个用鼠标经过一个图标时你就能听到有铃在响，-This is VC++ for an icon with the mouse after a hearing, you will be able to have a bell in the ring,

infozip2.2源码-The source of infozip2.2

实现LZARI压缩算法的C++类-LZARI compression algorithm to achieve the category C

this is a swf from net load

惠普实验室的经典代码。用于huffman编码的快速实现，具有参考价值-HP Labs classic code. Huffman coding for the rapid realization of value with reference

0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

KEIL驱动 各方面各 你的看法女士的烦恼 方看到你 -KEIL you drive all aspects of the views of the President to see the trouble you

在地图控制中添加了ODBC、ADO等方式获取数据库数据等功能-Control of the map to add the ODBC, ADO and other database data access features such as

zlib pascal语言源码 -The source in Pascal of zlib

C++ implementation of LZSS