搜索资源列表
the-greatest-common-divisor
- 求2个数之间的最大公约数，随便输入2个数字会得到他们之间的最大公约数-Find the greatest common divisor between two numbers, casually enter the two numbers will be the common denominator between them
find-the-greatest
- C++的求最大公约数和最小公倍数的程序，对本科C++课程可能有些帮助-C++, find the greatest common divisor and least common multiple of the program, it maybe helpful for C++ course
Greatest-common-divisor-algorithm
- 求最大公约数C语言的基本算法，C语言基础学习。-Greatest common divisor algorithm
Seek-the-greatest-common-divisor
- 求最大公约数 求最大公约数 -Seek the greatest common divisor
Greatest-common-divisor-(GCD)
- 用递归调用和辗转相除法求两个整数的最大公约数（输入多组数据，每个数在1到1000之间；输出为一行一个公约数）。-Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follo
greatest-commom
- 利用工具类求出一个数的最大公约数，并打印出结果！-Obtained a number of the greatest common divisor
Greatest-com-divsaleast-com-multp
- 利用C语言用好多种方法实现最小公倍数和最大公约数的求解方法。最后想出一种最简单可行的方法，虽然实际意义可能不大，但是还是值得一看。-The use of C language with a good variety of methods to achieve the least common multiple and the greatest common divisor of solving methods. Finally came
9Program-to-find-out-greatest-of-three-number1.zi
- 9Program to find out greatest of three number1
greatest-common-divisor
- project about greatest common divisor
greatest
- 使用C#控制台程序，求最大公约数和最小公倍数-Using the C# console program, seeking the greatest common divisor and least common multiple
greatest-divisor-least-multiple
- 求最大公约数和最小公倍数的一个应用，该文件主要目的是实现最大公约数和最小公倍数的代码-Find the greatest common divisor and least common multiple
greatest-common-divisor
- 输入两个正整数m和n，求其最大公约数和最小公倍数。 程序分析：利用辗除法。 -Enter two positive integers m and n, find their greatest common divisor and least common multiple. Program analysis: the use of rolling division.
the-greatest-common-divisor-
- <1> 用辗转相除法求最大公约数 算法描述: m对n求余为a, 若a不等于0 则 m <- n, n <- a, 继续求余 否则 n 为最大公约数 <2> 最小公倍数 = 两个数的积 / 最大公约数*/-< 1> with the common denominator Euclidean algorithm descr iption: m for n rema
greatest-common-divisor
- 已知几个连续整数，求得最大公约数 简单地c++算法-greatest common divisor
Find-the-greatest-common-divisor
- 求最大公约数的C编程语言，有需要的可以-Find the greatest common divisor
Find-the-greatest-common-
- 求两个整数m和n的最大公约数 求两个整数m和n的最大公约数-Find the greatest common divisor of two integers m and n are two integers m and n greatest common divisor of two integers m and n is the greatest common divisor
Greatest-common-divisor
- 这是关于最大公约数的算法程序。该算法简单易懂-This is about the greatest common divisor of the algorithm program.The algorithm is simple to understand
Greatest-Common-Divisor
- 功能为计算最大公约数, 新人注册, 3Q!-Compute Greatest Common Divisor, newbie here for sign up, thank you!
O-m-and-your-greatest-common-divisor
- 求m和你最大公约数，程序简单精巧，比较实用，希望站长可以采用。-O m and your greatest common divisor
greatest-common-divider
- 一个用于计算两个数的最大公约数的逻辑算术单元-an arithmetic logic unit which is used to calculate the greatest common divider of two numbers