Using the manual to assist novice understand there is a need to allow downloads,

vc环境下的利用IJL压缩库进行BMP->JPG的压缩转化-vc environment IJL compression library for the use of BMP-

一个解压程序,只要设定了解压路径和解压文件的种类,就可以随意解压-A decompression procedure, as long as the set-extracting file path and extract the type, it can extract

huffman编码，一种压缩与解压缩的程序，仅供大家参考。-Huffman coding, a compression and decompression procedures are for your reference.

用java语言编写的日历,看看好不好用.-java language used in the calendar to see is really handy.

LZW VS 6.0 实现 生成字典 自动 不用 字典就可以解压缩-LZW VS 6.0 to achieve the dictionary is generated automatically without a dictionary can be extracted

C Shell easy tutorial

是个关于压缩程序的代码。-is on the compression procedure code.

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.

字符串的压缩与解压，输入一字符串文件，压缩后得一文件，在经解压得原文件。大家一起分享。-string compression and decompression, the importation of a string, in a compressed file, after decompression in the original document. To share with everyone.