资源列表
longest
- Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... &l
GailvLun
- 讲授贝叶斯原理，是概率论中很重要的一个分支-Bayesian principles of teaching is very important in probability theory a branch of
1024FFT_ASIC
- 1024点复数专用FFT处理器的ASIC实现-1024 point complex FFT processor dedicated ASIC realization
c6_nltvde
- 简单举一个非线性的时变系统仿真的例子它以两个未分方程为基础-To put it simply a time-varying nonlinear system simulation example of its two sub-equations are not based on
dfg
- 在数值分析中多项式计算是一种比较复杂的运算，此代码能实现此运算-Polynomials in numerical analysis of the calculation is a relatively complex computation, the code to achieve this computation
Fortran90Handbook
- fortran 90的学习手册 希望对大家有所帮助 谢谢大家的支持-fortran 90 Handbook of learning we want to be helpful Thank you for your support
gaos
- 高斯消去法 -Gaussian elimination method of Gauss elimination method
New
- 利用平方根法（Cholesky法）求超定方程组的最小二乘解-Use the square root method (Cholesky method) for over-determined least squares solution of equations
puzzle_gedebahe
- 验证哥德巴赫猜想，通过VC++程序验证有限个数内哥德巴赫猜想成立-Goldbach conjecture verification through VC++ Procedures to verify within a limited number of the establishment of Goldbach Conjecture
circle
- 求圆心坐标和圆半径，在已知圆面积情况下，-For the center coordinates and circle radius, circle an area of known circumstances,
divideBeer
- 法国著名数学家波瓦松在表年时代研究过一个有趣的数学问题-Famous French mathematician波瓦松in the table the times studied in an interesting mathematical problem
Text1
- 单纯形法的村c++程序，直接运行就可以使用-Simplex method of the village c++ Procedures can be used directly to run on