-
zcgzxl
最长公共子序列的 c代码，可以直接运行获得结果。(C code for the longest common subsequence can be run directly.)
- 2013-12-04 16:13:33下载
- 积分：1
-
spline
matlab小波变换源代码，供广大研究者学习(matlab wavelet transform source code, for the majority of researchers to learn)
- 2013-11-22 21:37:29下载
- 积分：1
-
work
这个代码的主要作用是练习用的，可以用它来练习，然后得到提高(The code is based on Practice，so we can use it to make some improvement and maybe it can realize some new functions)
- 2011-11-06 21:05:58下载
- 积分：1
-
Boost-Develop
该书详细介绍了Boost库的数十种子库，是目前为止我找到的最详细的Boost库中文书籍(The book details the Boost libraries dozens seed bank, is by far the most detailed I ve found Boost library books Chinese)
- 2014-08-12 10:56:46下载
- 积分：1
-
AbortShutDown
AbortShutDown
AbortShutDown.rar
- 2007-10-27 18:44:32下载
- 积分：1
-
derivative
matlab数值分析计算源代码，供广大研究者学习(Numerical Analysis matlab source code, for the majority of researchers to learn)
- 2013-11-22 21:42:30下载
- 积分：1
-
zhuji
获取本地主机IP和本地主机的名称，。。。。(获取主机IP)
- 2009-11-27 08:44:21下载
- 积分：1
-
Main_Frequency_decoup_Opti_cdm1
悬置功能计算的，能量解耦的方法，优化及其位移的计算(The calculation of suspended function, energy decoupling method, optimization and calculation of displacement)
- 2015-08-06 09:25:49下载
- 积分：1
-
Cyuyanhanshu
C 类库 大家看看 也许在不知道这个函数原理的时候可能有用C 类库 大家看看 也许在不知道这个函数原理的时候可能有用C 类库 大家看看 也许在不知道这个函数原理的时候可能有用(C library to see if perhaps we do not know if this function may be useful when the principle of C library to see if perhaps we do not know if this function may be useful when the principle of C library to see if perhaps we do not know if this function when the principle may be Useful)
- 2010-01-12 08:32:55下载
- 积分：1
-
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
