-
01 knapsack problem to achieve the most simple, can do more in its expansion, I...
01背包问题最简单实现,可在其上做更多的扩展,不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack
- 2022-12-24 12:20:04下载
- 积分:1
-
简介:一个用PHP编写的,可以通过互联网控制和操作MySQL,通过phpMyAdmin可以完全对数据库进行操作,例如建立、复制、删除、导出、导入数据等。
简介:一个用PHP编写的,可以通过互联网控制和操作MySQL,通过phpMyAdmin可以完全对数据库进行操作,例如建立、复制、删除、导出、导入数据等。 -Introduction: A prepared using PHP, you can control and operation via the Internet MySQL, can be completely through the phpMyAdmin database operations, such as the establishment, copy, delete, export, import data.
- 2023-01-12 05:10:04下载
- 积分:1
-
delphi 环境下邮件管理程序。
delphi 环境下邮件管理程序。-mail management procedures.
- 2022-08-08 14:17:21下载
- 积分:1
-
Using ADO from C
Using ADO from C-Using ADO from C
- 2023-06-21 23:20:03下载
- 积分:1
-
大学毕业的课题,可能比较简单一点,入门的人可以
大学毕业的课题,可能比较简单一点,入门的人可以-University graduate topics that may be relatively simple, entry can
- 2022-02-04 15:47:49下载
- 积分:1
-
给定n 个整数a ,a , ,an 1 2 组成的序列, a n i | |£ ,1 £ i £ n。如果对于i...
给定n 个整数a ,a , ,an 1 2 组成的序列, a n i | |£ ,1 £ i £ n。如果对于i £ j ,有
0 = å
=
j
k i
k a ,则称序列区间i i j a , a , , a +1 为一个零和区间,相应的区间长度为j-i+1。-given n integers a, a, and an 1 2
- 2022-08-20 07:41:55下载
- 积分:1
-
计算机编程艺术第一卷,学习算法和数据结构的好书
计算机编程艺术第一卷,学习算法和数据结构的好书-Art of Computer Programming I, learning algorithm and data structure books
- 2022-01-25 19:42:03下载
- 积分:1
-
1背包问题 可以提供在背包方面遇到问题的学生或者有需要的人....
0-1背包问题 可以提供在背包方面遇到问题的学生或者有需要的人.-0-1 knapsack problem can provide a backpack problems encountered students or those who are in need.
- 2023-04-08 08:35:03下载
- 积分:1
-
This a collection of algorithms for sorting and searching.
This a collection of algorithms for sorting and searching.
- 2023-04-13 06:05:04下载
- 积分:1
-
Future POS system, VB source code. Procedure without debugging,
前台POS系统,VB源码.程序没有调试,-Future POS system, VB source code. Procedure without debugging,
- 2023-03-20 08:45:04下载
- 积分:1