-
MSPRO
利用MFC开发的数据库系统,用的是微软的Access,有详细的链接数据库的代码。(Use of MFC development of database systems, using Microsoft Access, there are more links to the database code.)
- 2011-09-06 21:40:03下载
- 积分:1
-
CBinary
一个关于十六进制数组动态创建的方法,对使用者在编写通信帧的时候很有用(An array of dynamically created on hexadecimal method, the users in the preparation of the communication frame is useful when)
- 2013-11-07 19:30:53下载
- 积分:1
-
documentscanner
关于图书快速扫描识别的硕士论文,适合图像处理(About books quick scan identified a master' s thesis for image processing)
- 2009-09-19 10:58:01下载
- 积分:1
-
zbsrc
作弊器(212KB) (Cheating devices (212KB))
- 2009-06-10 17:30:34下载
- 积分:1
-
Snake_C
说明: 贪吃蛇源码c++实现,经典游戏编程,适合爱好者学习(Snake Source c++ implementation, the classic game programming for fans to learn)
- 2010-04-25 17:39:12下载
- 积分:1
-
ExcelOperate11
vc读写excel,这个是用mfc写的,基于对话框的小程序(Vc u8BFB u5199excel)
- 2017-05-25 11:34:36下载
- 积分:1
-
k-means
k-means算法实现WEB搜索,用模拟退火,对K-means聚类算法进行数据挖掘(k-means algorithm WEB search)
- 2021-04-28 23:28:43下载
- 积分:1
-
Solution1
用vb.net做的大富翁,a Console Application that models the game of Monopoly.Houses • Hotels • Rolling doubles • Players will not be allowed to sell properties once purchased. • Players may mortgage a property but it will remain mortgaged for the rest of the game. • No one will ever go to jail.(vb.net do with the millionaires, a Console Application models that the game of Monopoly.Houses Hotels## 8226 8226 8226 Rolling doubles# Players will not be allowed to sell properties once purchased.# 8226 Players may mortgage a property but it will remain mortgaged for the rest of the game.# 8226 No one will ever go to jail.)
- 2005-04-23 07:33:09下载
- 积分:1
-
自主视力
通过使用stm32,自主研发的自助视力检测仪器压缩包为stm32的程序(Through the use of STM32, self developed self-help vision testing instrument compresses the package of STM32.)
- 2018-01-08 15:10:09下载
- 积分:1
-
最佳适应算法 信安 陆华锋 20022638
最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时,总是把能满足要求、又是最小的空闲分区分配给作业,避免“大材小用”。为了加速寻找,该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样,第一次找到的能满足要求的空闲区,必然是最佳的。(best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.)
- 2005-07-04 08:18:40下载
- 积分:1