搜索资源列表
GCD
- 最大公约数最小公倍数的C++求解,提供了多种思路解答,
gong_y_p
- 数学公式:最小公倍数=原来的两数之乘积÷最大公约数
cc
- 实现两个数的最大公约数和最小公倍数的计算
bicd
- 一个关于最小公倍数的算法,是本人自己编的,不会与别的雷同,同样的算法,但是个人的思路不同。-A least common multiple of the algorithm, are my own, and will not be identical with the other, the same algorithm, but the idea of different individuals.
c
- 求两个数的最大和最小公约数 和最小公倍数
1234
- 这是用C++编写的求最小公倍数最大公约数的程序`方便学生们实践课-This is written in C++, the least common multiple greatest common divisor of the program requirements to facilitate the students ``` Practice Course
gcd_lcm
- 给出两整数a与b, 找出a与b的最小公倍数LCM(a,b), 找出a与b的最大公因子GCD(a,b).-finds the LCM(Lowest Common Multiple)/GCD(Greatest Common Divisor) of two positive integers
zuixiaogongbeishuzuidagongyinshu
- 此程序可以进行数学中的求最小公倍数和最大公因数,用了BASIC 的FOR 循环,供初学者研究。-This program can be in mathematics and seek the least common multiple greatest common factor, using the BASIC of the FOR loop, for beginners of.
5
- 编制实现两正整数最大公约数、最小公倍数的类。利用最大公约数、最小公倍数的类编制分数相加功能类-Prepared to achieve the greatest common divisor of two positive integers, least common multiple of the class. Using the common denominator, least common multiple of the class added to the preparation of
lzxc
- 辗转相除法求最大公约数和最小公倍数,辗转相除法求最大公约数和最小公倍数-辗转相除法求最大公约数和最小公倍数
013
- 通过字符串操作模拟控制台的cd命令,要求至少完成 “cd 【目录名】”、“cd ..” 和“cd \” 三个命令。实例可以参考:开始->运行->cmd->键入上述三个命令观察提示符前的字符串变化,帮助可通过cd /?显示;可使用字符串处理函数。并用此程序练习和熟悉调试过程。 实验014:重写实验007和012,要求使用函数IsPrime实现判断一个数是否是素数,GCD返回两个数的最大公约数,LCM返回两个数的最小公倍数,并在main中调用。-Through the stri
hw1
- 输入两个数, 计算最大公约数和最小公倍数-Enter two numbers to calculate the greatest common divisor and least common multiple !!!!!!!!!!!!!!!!!!!!!!!!!
tools
- 本科写的小程序,计算最大公约数和最小公倍数-Undergraduate small program written to calculate the greatest common divisor and least common multiple
zuixiaogongbeishu
- 这个程序能求两个数的最小公倍数,以及最大公约数-The program can find the least common multiple of two numbers, and the greatest common divisor
1
- 求出任给两个正整数的最大公约数和最小公倍数-Compting the greatest common divisor and least common multiple of two numbers.
1178-1030
- 浙大ACM1030/1078,求最小公倍数-zui xiao gongbeishu
Cchengxi
- 输入两个正整数m和n,求其最大公约数和最小公倍数。-Enter two positive integers m and n, find the greatest common divisor and least common multiple.
gcdlcm
- 计算出最大公约数与最小公倍数,考虑0的情况-Calculate the maximum and minimum LCD, when considering 0
VB
- 求两个数的做大公约数以及最小公倍数并且完备数-Find two numbers and big divisor and least common multiple of the number of complete
find-the-greatest
- C++的求最大公约数和最小公倍数的程序,对本科C++课程可能有些帮助-C++, find the greatest common divisor and least common multiple of the program, it maybe helpful for C++ course