资源列表
fft
- 快速傅立叶变换的C++源码，需要计算 (n * lg n) / 2 次。-Fast Fourier Transform
CPP_Make_the_to_calculate
- 利用以下公式,计算 PI 至小数点后s位 oo --- n L * PI \ (-1) 4 * L L -------- = / [ ------- ( ---------- - -------------- ) ] 4 --- 2n+1 5^(2n+1) 239^(2n+1) n=0 L : 为一大整数 10^s PI : 圆周率-Using the following formula to calculate PI to s
CPP_Bitmap_and_the_output_produced_digital_graphic
- 设计0~9 ,十个 5*4的点矩阵数字,输入一个整数,印出此整数点矩阵图形-Bitmap and the output produced digital graphics
archive
- PKU ACM 1469 COURSES PKU ACM 1579 Function Run Fun
newtron
- 牛顿迭代算法在C里面的实现，速度不错-Newton iterative algorithm in C inside the realization of the pace. . .
newton
- 高效率的牛顿迭代法，求根。C实现的版本。-Efficient Newton iteration method, Roots. C implementation version.
gauss-seidel
- 是一个做gauss-seidel的矩阵变换代码-it is a project about gauss-seidel
Algorithm
- Algorithm balance energy in a cluster
1003
- 是ACM里面的1003题源代码认真书写并提交-ACM inside the 1003 title is the source code carefully written and submitted to the
1028
- 上传的是ACM的题目的源代码的质量高的工具的语言-Upload the ACM to the topic of the source code tool for high-quality language
1032
- 上传的是ACM的题目的源代码的质量高的工具的语言-Upload the ACM to the topic of the source code tool for high-quality language
1006
- 上传的是ACM的题目的源代码的质量高的工具的语言-Upload the ACM to the topic of the source code tool for high-quality language