Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - multiply
Search - multiply - List
大数相乘、计算时间、josep问题、计算JC、分形图形-multiply large numbers, computation time, Josep, calculated JC, fractal graphics
Date : 2008-10-13 Size : 3.49kb User : 张志明

矩阵计算,包括了矩阵的加减乘除,还可以实现对角化,对一次解方程组非常有帮助-computing in matrixs,It Includes the plus and multiply and so on,It can realize the diagonalize,that will be very helpfull for one result equation
Date : 2008-10-13 Size : 8.84kb User : 聂波

大数相乘,可以解决超过大整数的问题-multiply large numbers, can be resolved over the issue of large integer
Date : 2008-10-13 Size : 32.78kb User : 李林骏

这是算法程序中用求矩阵连乘问题的c++实现,利用了动态规划的算法-This is the procedure used for algorithm continually multiply matrices of c, using a dynamic programming algorithm
Date : 2008-10-13 Size : 42.81kb User : 阳林

动态规划+备忘录法 求最佳矩阵连乘,觉得不错,可以看下.-+ memorandum dynamic programming method for the best matrix continually multiply, and think it's good, can see next.
Date : 2008-10-13 Size : 6.79kb User : jian

能实现大数的乘法运算,大数运算在各个方面都要用到
Date : 2008-10-13 Size : 1.02kb User : xiongwei

使用动态规划解决数乘问题 给定一个m位数字和乘号数量n,n<m,求怎样将乘号插入数中,使得积最大
Date : 2008-10-13 Size : 8.64kb User : skywalker

用动态规划解矩阵连乘问题-use dynamic programming solution matrix continually multiply problems
Date : 2008-10-13 Size : 9.54kb User : 李文涛

一个通用的矩阵综合算法;能实现加、减、乘、转置以及初始化设置功能(大小和初值)。-A common matrix integrated algorithm to achieve add, subtract, multiply, transpose function, as well as initialization settings (the size and initial value).
Date : 2025-12-28 Size : 2kb User : 赵君

此程序是一个加,减,乘,除的算法.-This procedure is an add, subtract, multiply, with the exception of the algorithm.
Date : 2025-12-28 Size : 14kb User : 杨海毅

大数相乘、计算时间、josep问题、计算JC、分形图形-multiply large numbers, computation time, Josep, calculated JC, fractal graphics
Date : 2025-12-28 Size : 3kb User : 张志明

大数相乘,可以解决超过大整数的问题-multiply large numbers, can be resolved over the issue of large integer
Date : 2025-12-28 Size : 32kb User : 李林骏

用动态规划解矩阵连乘问题-use dynamic programming solution matrix continually multiply problems
Date : 2025-12-28 Size : 809kb User : 李文涛

矩阵计算,包括了矩阵的加减乘除,还可以实现对角化,对一次解方程组非常有帮助-computing in matrixs,It Includes the plus and multiply and so on,It can realize the diagonalize,that will be very helpfull for one result equation
Date : 2025-12-28 Size : 9kb User :

这是算法程序中用求矩阵连乘问题的c++实现,利用了动态规划的算法-This is the procedure used for algorithm continually multiply matrices of c, using a dynamic programming algorithm
Date : 2025-12-28 Size : 43kb User : 阳林

高精度乘法基本思想和加法一样。其基本流程如下: ①读入被乘数s1,乘数s2 ②把s1、s2分成4位一段,转成数值存在数组a,b中;记下a,b的长度k1,k2; ③i赋为b中的最低位; ④从b中取出第i位与a相乘,累加到另一数组c中;(注意:累加时错开的位数应是多少位 ?) ⑤i:=i-1;检测i值:小于k2则转⑥,否则转④ ⑥打印结果-High-precision multiplication and addition the same basic idea. The basic process is as follows: ① read multiplicand s1, multiplier s2 ② to s1, s2 is divided into four section into the existence of an array of values a, b in write down a, b the length of k1, k2 ③ i given for the b of the lowest ④ Remove from b in the first i-bit and a multiply, accumulate to another array in c (Note: The median cumulative time should be staggered how many?) ⑤ i: = i-1 detection i value: less than k2 was transferred ⑥, otherwise switch to print the results ④ ⑥
Date : 2025-12-28 Size : 1kb User : Eurik

动态规划+备忘录法 求最佳矩阵连乘,觉得不错,可以看下.-+ memorandum dynamic programming method for the best matrix continually multiply, and think it's good, can see next.
Date : 2025-12-28 Size : 7kb User : jian

能实现大数的乘法运算,大数运算在各个方面都要用到-Can realize the multiplication of large numbers, large numbers in the various aspects of computing should be used
Date : 2025-12-28 Size : 1kb User : xiongwei

使用动态规划解决数乘问题 给定一个m位数字和乘号数量n,n<m,求怎样将乘号插入数中,使得积最大-The use of dynamic programming to solve a few problems given by an m-digit multiplication sign and the number of n, n
Date : 2025-12-28 Size : 8kb User : skywalker

C program to add, subtract, multiply and divide Complex Numbers, complex arithmetic
Date : 2025-12-28 Size : 16kb User : swapnil patil
« 12 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.