< Visual C++ 6.0实例教程》源代码, WinRAR自解压包

记忆测试软件,您需要连续找出6-8个相同图标的方块-Memory test software, you need to find a row 6-8 of the same icon in the box

本程序是通过软件模拟I2C协议对8563进行读写函数-This procedure is simulated by software I2C protocol of 8563 to read and write function

这是一个压缩和解压的程序，有助于教学之用或者学习-This is a compression and decompression procedures, contribute to teaching or learning

自适应算术编码的框架，可以直接用来直接开发，用C语言编写的-adaptive arithmetic coding framework that can be directly used to direct development, using the C language

image compression using the lifting

著名压缩解压缩算法7z的源代码,开发环境是vc++,十分方便大家学习.-Well-known compression algorithms 7z extract the source code, development environment is vc++, Everyone is very convenient to learn.

在北京创新乐团队很高兴地宣布，北京创新乐供应4.0金。该版本包括北京创新乐4.0论坛和全新的北京创新乐4.0出版套房。截至今天，这些都是正式支持产品，为票支持和电话支持的资格。-The vBulletin team is very excited to announce the availability of vBulletin 4.0 Gold. The release includes vBulletin 4.0 Forums and the all-new vBulletin 4.0 Publishing Suite. As of today, these are officially supported products that are eligible for both ticket support and phone support.

汉字转换内码程序 好东西大家一起分享 -Kanji code conversion process to share good things with everyone

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.

JPEG压缩编码系统源代码-JPEG compression coding system source code