搜索资源列表
因子表
- 高斯消去法解线性方程组的因子表-Gaussian elimination method for solving linear equations of the form factor
1.3
- 编写一个控制台应用程序，求1000之内的所有“完数”。所谓“完数”是指一个数恰好等于它的所有因子之和。例如，6是完数，因为6=1+2+3。-Write a console application, and all of 1000, End of a few. The so-called End of a few refers to a number of precisely equivalent to it and all the factors. For example, the nu
235
- 求第1500个只有2,3,5因子的数。数是从小到大排列，第一个数是1,1=2^0*3^0*5^0。 要求用C/C++实现。时间复杂度不超过O( )。-No. 1500 for only a few factors 2,3,5. A few are from small to large order, the first number are 1,1 = 2 ^ 0* 3 ^ 0* 5 ^ 0. Asked to use C/C++ implementation. Time complexity
poi
- 一个数如果恰好等于它的因子之和，这个数就称为“完数”。例如6=1＋2＋3.编程 找出1000以内的所有完数。 -If just a few of the factors equal to it and that this number is called the " End of a few." For example 6 = 1+2+3. 1000 program to find all finished within a few.
FFT
- 快速傅里叶变换，依靠基2蝶形因子的思想，符合数字信号的处理需求-FFT
78-90790
- 欧几里德最大公因子算法 欧几里德最大公因子算法-Euclidean algorithm Euclidean greatest common factor greatest common factor algorithm
Forward
- 该程序实现的功能：前向算法估计参数（带比例因子修正）-Implementation of the program functions: forward algorithm estimated parameters (with scale factor correction)
duanluguzhang
- 使用C#作为开发语言，制作了一个简单电力系统对称短路电流计算软件，可生成导纳矩阵的LDU分解后的各矩阵,包括因子矩阵、阻抗矩阵。-A simple power system short-circuit analysis software based on C#.
tc
- 证一个正整数对是否符合特定的编码规则 计算a的所有不同的质因子（包括1）之积，记为s-Permit a positive integer of whether specific rules for calculating a coding of all the different quality factors (including 1) the product, denoted by s
notes
- 一个数如果恰好等于它的因子之和，这个数就称为"完数"。例如6=1＋2＋3.编程找出1000以内的所有完数。 跟大家分享一下一道题的多种思路：-If a number is just equal to the sum of its factors, this number is called " End of a few." For example 6 = 1+2+3. Programmatically find all finished within a number
olstest
- 多元回归是指一个因变量(预报对象),多个自变量(预报因子)的回归模型.基本方法是根据各变量值算出交叉乘积和Si。并利用c#实现-Multiple regression is a dependent variable (forecast object), a number of independent variables (predictors) of the regression model. The basic method is based on the calculated value o
ot-Test
- 自适应正交实验结果方差和极差分析表，可以适用于任何列数和行数的正交实验表--常见的正规实验设计表和多因子非等水平数的正交表-self-adaptive othogonal experiment design result analysis.
PortfolioManager
- 金融软件,主要可以做金融投资组合因子分解贡献-software for finance
systemModelanalysis
- 输入各因子之间的相关系数，可以得到重组矩阵，元素的影像域影像强度。-The correlation coefficient between the input factors, can be obtained by recombinant matrix, elements of the image domain of image intensity.
4_3
- 实现一个表示分数的Fraction类。在该类中有两个数据成员分别用于存储分数的分子和分母。函数成员中包含一个设置分子和分母的函数assign()，转换成double 类型数值的函数convert()，交换分子和分母的函数invert()以及一个输出分数的函数print()，请注意输出结果格式：若分子分母同时为0，则输出字符串“#NAN”；若只有分母为0，则输出字符串“#INF”；其余情况输出最简分式，即最大公因子已被约去后的形式；当分子为0，分母为负数时，注意结果应输出0，而非“-0”。
0002
- 整数因子的分解问题 基本算法分析 初学者必读-The basic problem of integer factor decomposition algorithm analysis reading for beginners
wanshu
- 一个数如果恰好等于它的因子之和，这个数就称为“完数”。例如6=1＋2＋3.编程 找出1000以内的所有完数。 -If a number is exactly equal to the sum of its factors, this number is called a " complete count." For example, 6 = 1+2+3 program to find all finished within the 1000 number.
1
- 1、用辗转相除法计算任意两个整数a、b的最大公因子。进一步求出整数s、t，使得sa+tb=(a,b)。特别地，当a=3378,b=231时，求出相应的s,t以及a与b的最大公因子(a,b)。将结果写入a.txt中。 2、用辗转相除法计算任意两个整数a、b的最小公倍数。特别地，当a=12345,b=54321时，计算其最小公倍数。将结果写入b.txt中。 3、对e=6597，用辗转相除法求出d，使得ed=1 mod 11200。将结果写入c.txt中。 -1, with the Euc
shiyan1
- /*一个数如果恰好等于它的因子之和，这个数就称为“完数”。例如6=1＋2＋3.编程 找出1000以内的所有完数。*/ -/* If a number is exactly equal to the sum of its factors, this number is called a " complete count." For example, 6 = 1+2+3 program to find all finished within 1000.* /
2
- 一个数如果恰好等于它的因子之和，则称为完数、编写程序，找出1000之内的所有完数。-If a number is exactly equal to the sum of its factors is called complete number, write a program to find the number of all completed within 1000.