搜索资源列表
gyushu
- 求最大公约数！比较简单！初学，有兴趣可以-Seek the common denominator! Relatively simple! Beginners, who are interested can
2
- 扩展欧几里德算法不但能计算(a,b)的最大公约数，而且能计算a模b及b模a的乘法逆元。平方和乘算法的复杂度：执行次数至少要k次模乘，最多需要２ｋ次模乘。-Extended Euclidean algorithm for computing not only (a, b) the common denominator, and to calculate a modulus b and b modulus a multiplicative inverse of. Square and by the
GreatestCommonDivisor4
- 用c#编的求多个数的最大公约数，同时导出在excel中-Seeking to use c# compiled more than the number of common denominator, while the export in excel
qiuzuida-gongyueshu
- 这是一个用C#编写的程序，主要是最大公约数的问题，有欧几里得算法，循环测试法，因式分解等。-this is a code written by C#.
common-divisor
- 该程序可以求出一个数组内所有数字的最大公约数，读者可以随意设置数组，该程序可以计算并输出其最大公约数-The program can calculate the greatest common divisor of all digits of an array, the reader can be set above the array, the program can calculate and output the greatest common divisor
oujilide
- 欧几里得算法，很详尽的解释说明，扩展欧几里得算法，求最大公约数-Euclidean algorithm, a very detailed explanation, extended Euclidean algorithm, find the greatest common divisor
shu
- 输入两个正整数，求他们的最大公约数和最小公倍数-Enter two positive integers, find their greatest common divisor and least common multiple
c
- 用C语言设计一个简单的程序，作用是能够达到求两个数的最大公约数和最小公倍数的目的-Find the greatest common divisor and least common multiple of two numbers
zhuhangsudiaoyong
- c语言，主函数调用，用于算最大公约数和最小公倍数，还有一段算数组中的最大值-c language, the main function calls for the greatest common divisor and least common multiple operators, as well as the maximum period of arithmetic groups
WindowsFormsApplication1
- C#使用最高效率的计算2个数的最大公倍数和最小公约数，经过潜心简约代码和算法，目前效率很高-C# using maximum efficiency of computing the number of the greatest common factor and the lowest common denominator, after painstaking code simplicity and algorithm, the efficiency is very high
number1
- 求解两个数的最大公约数和公倍数，以及阶乘，求解c（a，b）-Solving common multiple and greatest common divisor of two numbers, as well as factorial, solving the c (a, b)
4
- 下载并安装TURBO PASCAL，调试如下程序，使之正确运行。 （1）计算最大公约数 (2) 计算sum 1! + 2 ! + ... + n!, (n从控制台读入) -下载并安装TURBO PASCAL，调试如下程序，使之正确运行。 （1）计算最大公约数 (2) 计算sum 1!+ 2 !+ ...+ n!, (n从控制台读入)
gongyueshugongbeishu
- 计算两个数的最大公约数以及最小公倍数，输出在屏幕上-Calculate the maximum common divisor of the two numbers and the least common multiple of the output on the screen