搜索资源列表
bignumbermultiplay
- 大整数乘法算法，可实现普通程序无法实现的大整数的相乘。算法简单，可作为数据结构与算法研究之用-Large integer multiplication algorithm, can be achieved can not be achieved with the ordinary procedure of the multiplication of large integers. Algorithm is simple and can be used as data structure and
Multiply
- 大整数乘法 poj 2980 比一般的算法快一点点哦-Poj 2980 large integer multiplication
dazhengshuchengfa
- 大整数乘法- Large integer multiplication
zzz
- 大整数乘法,实现两个大整数相乘的C++代码-Large integer multiplication
Large_integer_multiplication
- 算法分析与设计——大整数乘法。 计算两个超出机器数表示范围的整数的乘积。-Algorithm Analysis and Design- large integer multiplication. Calculating the number of two machines that go beyond the scope of the product of an integer.
dazhengshuchengfa
- 大整数乘法的算法实现，可以运行，希望可以帮到大家-Large integer multiplication algorithm, you can run, I hope you can help
Mul
- 大整数乘法源程序，使用C++编写，希望大家能用的上-Large integer multiplication source code, using C++ written in hope that we can use the previous
test
- 这是一个用来进行大整数乘法的小程序，这是我第一次上传-big int multiply
fastfft
- 快速傅氏变换（FFT）是离散傅氏变换(DFT)的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。快速傅里叶变换有广泛的应用，如数字信号处理、计算大整数乘法、求解偏微分方程-Fast Fourier Transform (FFT) is the discrete Fourier transform (DFT) in the fast algorithm, which is based on discrete Fourier transform of t
bignumber
- 大整数乘法的算法问题，嗬嗬嗬。。。是正确的-Large integer multiplication algorithm problem, ho ho ho. . . Is correct
friourchangetosolvebigvaluemultipy
- 福利叶变换用来计算大整数乘法的算法实现~~c语言哦~~欢迎下载-big value s multiplition
3004
- 4、大整数乘法 Descr iption 求两个不超过200位的非负整数的积。 Input 有两行，每行是一个不超过200位的非负整数，没有多余的前导0。 Output 一行，即相乘后的结果。结果里不能有多余的前导0，即如果结果是342，那么就不能输出为0342。 Sample Input 12345678900 98765432100 Sample Output 1219326311126352690000 -4, Large Integer
word
- 计算大整数乘法，可以实现解决int形无法储存的数据，使用C-Calculation of large integer multiplication, can solve the int data type can not be saved, the use of C++
dazhenshu
- 用大整数乘法来计算两个n位二进制数相乘-With large integer multiplication to calculate the multiplication of two n-bit binary number
Demo
- 用netbeans写的swing程序，写了非递归求两整数最大公因子、分治法求大整数乘法、动态规划求最长公共子串，集合划分问题。 -Netbeans swing with written procedures, write a non recursive find the greatest common factor of two integers, divide and conquer seek large integer multiplication, dynamic programming
Multiplication-of-large-numbers
- 大整数乘法，大整数，乘法，基板满足科学计算要求-Multiplication of large numbers
1001
- 计算大整数乘法，可用于汇率等高精度计算上，为C语言编码。-Large integer multiplication calculation can be used for calculating the exchange rate and other high-precision, for the C language code.
fast-fourious-algorithm
- 快速傅立叶变换来解决多项式乘法（包括大整数乘法等）操作。-Fast Fourier transform to solve polynomial multiplication operation。
fourior-algorithm-for-polynomial
- 快速傅立叶变换来解决多项式乘法（包括大整数乘法）等操作。-Fast Fourier transform to solve the polynomial multiplication (including large integer multiplication) and other operations.
ss
- 大整数乘法源码，输入两个大整数并返回相乘的结果。使用String类来实现，可进行高精度的乘法运算。-Large integer multiplication source, enter the two big integers and returns the result of multiplying them. Achieved the String class, high-precision data multiplied.