-
jsp资料(jsp 高级编程）
jsp资料(jsp 高级编程）-jsp information (jsp Advanced Programming)
- 2022-03-11 10:54:00下载
- 积分：1
-
压缩文件并且支持rar和zip格式
压缩文件并且支持rar和zip格式-compressed files and supports rar and zip format
- 2022-03-02 11:45:34下载
- 积分：1
-
C#绝佳的编程秘诀
C#绝佳的编程秘诀- 以空间换时间算法精要,有需要的可以参考-good program for c#
- 2022-03-18 14:34:57下载
- 积分：1
-
Registry editor For WINCE which can be use to edit registry
Registry editor For WINCE which can be use to edit registry
- 2022-02-01 19:20:47下载
- 积分：1
-
基于WinCE操作系统、SMDK2410硬件开发平台下的显示驱动
基于WinCE操作系统、SMDK2410硬件开发平台下的显示驱动-Based on the WinCE operating system, SMDK2410 hardware development platform for the display driver under the
- 2022-02-01 18:58:36下载
- 积分：1
-
随机文件读写，实现了从文本中读取个人资料，成绩等信息，并可以追加记录。运行时需要先创建一个文本文件，并修改读取路径。...
随机文件读写，实现了从文本中读取个人资料，成绩等信息，并可以追加记录。运行时需要先创建一个文本文件，并修改读取路径。-Random file read and write, realize from reading the text of personal information, results and other information and would provide an additional record. Run-time need to create a text file, and modify the path to read.
- 2022-02-26 07:04:35下载
- 积分：1
-
筛库
SET TALK OFF
SELECT 街乡码,count(*) FROM aaa GROUP BY 街乡码 INTO ARRAY 街乡码库...
筛库
SET TALK OFF
SELECT 街乡码,count(*) FROM aaa GROUP BY 街乡码 INTO ARRAY 街乡码库
FOR i=1 TO _TALLY
SELECT * FROM aaa WHERE aaa.街乡码 = 街乡码库[i,1] INTO TABLE ( 街乡 +街乡码库[i,1])
ENDFOR
CLOSE DATABASES-Sieve library SET TALK OFF SELECT街乡code, count (*) FROM aaa GROUP BY街乡code INTO ARRAY街乡Code Library FOR i = 1 TO _TALLY SELECT* FROM aaa WHERE aaa.街乡Code =街乡code library [i , 1] INTO TABLE (街乡+街乡code libraries [i, 1]) ENDFOR CLOSE DATABASES
- 2022-01-31 00:38:58下载
- 积分：1
-
在屏幕上移动的球
这是 UIUC 的 ECE298 LAB7 的代码。然后，代码的主要目的是以球移动屏幕上的代码。
- 2022-03-01 11:53:41下载
- 积分：1
-
汽车租赁管理系统
自己练手写的，汽车租赁管理系统，java语言编写，框架Spring,数据库用的mySql。完整项目，可以运行。
- 2022-04-07 01:20:29下载
- 积分：1
-
1背包问题是NP难题。0
0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right
- 2022-03-25 00:00:51下载
- 积分：1
