-
Recursive_integer_division
递归法求解整数划分。
整数划分,是指把一个正整数n写成如下形式:
n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分:1
-
DeNoising
这是一个MATLAB算例,在信号处理中的去噪可以用的到。新手合适。(This is a MATLAB example, in signal processing can be used to de-noising. Novice appropriate.)
- 2013-07-15 14:13:17下载
- 积分:1
-
zuoxishijian
课程设计 作息时间控制 nimei miiii(Curriculum design schedule control nimei miiii)
- 2013-12-19 17:46:57下载
- 积分:1
-
Metrix
说明: 该软件和代码实现的功能是对图象的加密和解密,运行环境是Xp+matlab,代码中有说明,很容易看明白.(the software code and the functions of the image of encryption and decryption, the environment is Xp Matlab, the code is described, it is easy to see to understand.)
- 2006-04-01 19:07:48下载
- 积分:1
-
xppaut_latest.tar
XPPOUT latest, Window GUI
- 2015-09-09 13:33:07下载
- 积分:1
-
TRI
教你如何绘制三角形,带源代码!!!教你如何绘制三角形,带源代码!!!!(Teach you how to draw Triangle)
- 2010-01-05 16:44:28下载
- 积分:1
-
gpml
高斯过程的协方差函数 及其选着 列出多个协方差函数
- 2011-01-09 09:50:44下载
- 积分:1
-
matcom4.5
matcam 4.5 安装及下载指导
链接matlab和visual,实现matlab的高级编程(matcam 4.5 matlab和visual)
- 2011-07-19 12:40:46下载
- 积分:1
-
kaifudexin.rar
给创新工场求职者的一封信 有兴趣的看一下(Innovative workshops to job seekers interested in a look at a letter)
- 2010-01-11 15:02:34下载
- 积分:1
-
0
说明: 给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入.
输入:第一行两个正整数n(物品数)和C(容量)
第二行n个正整数n,表示物品价值
第三行n个正整数n,表示物品重量
输出:第一行表示总价值
第二行n个数(0/1),0表示物品不装入,1表示装入
例如,
输入:
5 10
6 3 5 4 6
2 2 6 5 4
输出
15
1 1 0 0 1
(Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)
- 2009-07-01 23:07:01下载
- 积分:1