-
LaTex teaching
一份不太简短的LaTeX教程(中文),一个德国人写的入门教材,翻译也不错-LaTex teaching
- 2022-03-26 13:54:34下载
- 积分:1
-
是一本书
是一本书-Is a book
- 2022-04-25 16:47:36下载
- 积分:1
-
C语言高级编程,高手必经之路!
C语言高级编程,高手必经之路!-C high-level programming language, master the only way!
- 2022-03-16 21:45:37下载
- 积分:1
-
This is a very good tutorial on the VHDL. Suitable for beginners, how to feel go...
这是一部很好的教程,关于VHDL的。适合于初学者,如何觉得好,可以做个朋友啊。-This is a very good tutorial on the VHDL. Suitable for beginners, how to feel good, you can be friends ah.
- 2022-06-28 06:36:24下载
- 积分:1
-
30个有意思的c#小程序
30个有意思的c#小程序-30 Interestingly, a small c# program
- 2023-02-20 04:10:03下载
- 积分:1
-
VC在线杂志精华6
VC在线杂志精华6-VC online magazine essence 6
- 2022-03-20 05:30:53下载
- 积分:1
-
背包问题动态规划算法JAVA
给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价...
背包问题动态规划算法JAVA
给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大?
在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。因此,该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA 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-22 23:20:03下载
- 积分:1
-
- 2022-02-24 19:02:20下载
- 积分:1
-
本书包括语言的社会功能、语音、语法、词义、文字和书面语、语言的接触、语言系统的发展等九章,每章都有学习目标、重点与难点...
本书包括语言的社会功能、语音、语法、词义、文字和书面语、语言的接触、语言系统的发展等九章,每章都有学习目标、重点与难点-This book, including the social function of language, voice, grammar, word, text, and written, language contact, language systems, such as chapters, each chapter has learning objectives, priorities and difficult
- 2022-10-10 11:15:03下载
- 积分:1
-
高质量++编程指南
高质量++编程指南-High-quality++ Programming Guide
- 2022-05-04 22:03:18下载
- 积分:1