搜索资源列表
公约数与公倍数
- 求最大公约数和最小公倍数的程序，输入两个数，能求出最大公约数和最小公倍数-seek common denominator and implements procedures to import two few, the common denominator can be obtained and implements
liangxi
- 求两个整数的最小公倍数的简单的算法代码，辗转相除法-Least common multiple of two integers a simple algorithm code, the Euclidean algorithm
Exam_1
- 基于C语言的编程，求数值间的最大公约数和最小公倍数-Greatest common divisor
val
- 欧几里得定理求最大公约数，并且利用最大公约数求最小公倍数的算法实现。-Euclidean theorem of seeking the common denominator, and seek the greatest common divisor lcm algorithm
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.
HD1019
- 一道非常简单的杭电题目，求多个数的最小公倍数，这是我的AC代码。-Hang a very simple electrical problem, find the number of the plurality of the least common multiple, this is my AC code.
求最小公倍数
- C语言编程，采用辗转相除法求两个正整数的最小公倍数。