-
记事本 记事本 记事本 记事本 记事本
记事本 记事本 记事本 记事本 记事本 -notebook notebook notebook notebook notebook notebook notebook notebook notebook notebook Notebook
- 2023-06-26 13:15:04下载
- 积分：1
-
vc++ off your lid to a C++ programmers and want to further upgrade the technolog...
vc++ 掀起你的盖头来
一个C++程序员，想要进一步提升技术水平的话，应该多了解一些语言的语意细节。对于使用VC++的程序员来说，还应该了解一些VC++对于C++的诠释。Inside the C++ Object Model虽然是一本好书，然而，书的篇幅多一些，又和具体的VC++关系小一些。因此，从篇幅和内容来看，译者认为本文是深入理解C++对象模型比较好的一个出发点。-vc++ off your lid to a C++ programmers and want to further upgrade the technological level, they should know more about some of the details of the language semantics. For the use of VC++ Of programmers, but also should be aware of some VC++ For C++ Interpretation. Inside the C++ Object Model is a good book, however, the length of the book more, but also and specific VC++ Relations smaller. Therefore, from the length and content, the translator of this article consider an in-depth understanding of C++ Object model of a relatively good starting point.
- 2023-05-13 03:45:03下载
- 积分：1
-
pivotal game c c code for school help
贪食蛇游戏的c代码 对学c有帮助-pivotal game c c code for school help
- 2022-08-13 01:46:39下载
- 积分：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
-
openssl生成证书，数字签名，加密解码
资源描述
利用openssl 生成根证书，证书发布，数字签名。
握手建立会话长连接，发送，接收数据，最后销毁会话。
- 2022-02-20 23:39:01下载
- 积分：1
-
bp,hopfild等多种网络的vc实现
bp,hopfild等多种网络的vc实现-bp,hopfild and multifold network s VC realization
- 2022-01-21 20:49:13下载
- 积分：1
-
统计每行的英文字母的个数
统计每行的英文字母的个数-statistics on each side of the alphabetic Number
- 2022-02-05 05:59:04下载
- 积分：1
-
Scan all running processes, and access to system privileges, you can specify the...
扫描运行的所有进程，并且可以获得系统权限，可以指定关闭进程包括System进程-Scan all running processes, and access to system privileges, you can specify the closure process, including the System process
- 2022-07-17 20:00:45下载
- 积分：1
-
wo xia zai de bianyi ruanjian 10687_file.zip
wo xia zai de bianyi ruanjian 10687_file.zip
- 2023-02-01 08:45:03下载
- 积分：1
-
很全的Delphi字符操作函数库，所有的功能全部包装在类TStringManager中。好用，速度快。最爽的是完全免费。...
很全的Delphi字符操作函数库，所有的功能全部包装在类TStringManager中。好用，速度快。最爽的是完全免费。-is all the characters Delphi operation functions, all functions in all types of packaging TStringManager China. Easy, fast. Tennis is completely free of charge.
- 2023-08-24 09:25:03下载
- 积分：1
