-
Procedure consists of five modules, lzw compression algorithm c language
程序由五个模块组成，lzw压缩算法的c语言实现-Procedure consists of five modules, lzw compression algorithm c language
- 2022-02-04 16:11:05下载
- 积分：1
-
解除减压
decompression using the lifting
- 2022-06-27 00:09:04下载
- 积分：1
-
编译源文件生成可执行文件TestLibjpeg.exe，
此程序可以转换bmp位图为jpg格式，或解压缩
jpg格式图像为bmp格式。
将需转换的b...
编译源文件生成可执行文件TestLibjpeg.exe，
此程序可以转换bmp位图为jpg格式，或解压缩
jpg格式图像为bmp格式。
将需转换的bmp格式图片存到和TestLibjpeg.exe
相同的文件夹下，在DOS界面下使用命令行参数
bmp到jpeg的转换使用：TestLibjpeg.exe j 原图片名.bmp 目标图片名.jpg
jpeg到bmp的转换使用：TestLibjpeg.exe b 原图片名.jpg 目标图片名.bmp-
AppWizard has created this TestLibjpeg application for you.
This file contains a summary of what you will find in each of the files that
make up your TestLibjpeg application.
TestLibjpeg.dsp
This file (the project file) contains information at the project level and
is used to build a single project or subproject. Other users can share the
project (.dsp) file, but they should export the makefiles locally.
TestLibjpeg.cpp
This is the main application source file.
/////////////////////////////////////////////////////////////////////////////
Other standard files:
StdAfx.h, StdAfx.cpp
These files are used to build a precompiled header (PCH) file
named TestLibjpeg.pch and a precompiled ty
- 2022-02-05 01:55:04下载
- 积分：1
-
fci
fci
- 2022-12-08 22:35:03下载
- 积分：1
-
LARC and LHarc
LARC and LHarc
- 2022-03-17 16:49:14下载
- 积分：1
-
想学好计算方法吗？那你一定要看这个rar
想学好计算方法吗？那你一定要看这个rar-Method of calculation do you want to learn? Then you have to look at the rar
- 2022-12-08 11:45:04下载
- 积分：1
-
本人多年前，用C语言实现的DES加密算法的源代码。
本人多年前，用C语言实现的DES加密算法的源代码。-DES C-language.
- 2022-01-26 00:11:04下载
- 积分：1
-
visual foxpro的用法和数据表
visual foxpro的用法和数据表
- 2022-07-14 11:37:25下载
- 积分：1
-
0_1背包问题使用一个给定n种去的动态规划解法…
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.
- 2023-04-12 03:25:02下载
- 积分：1
-
著名的压缩代码的最新版
著名的压缩代码的最新版-famous compression code to the latest version
- 2022-02-25 03:07:07下载
- 积分：1
