搜索资源列表
zuidahezuixiao
- 最大公约数和最小公倍数，希望对你们有点帮助吧-majors and implements, and I hope to help it a bit you
huibian
- 这是用masm32编写的一个用于求两个数的最大公约数和最小公倍数的程序，并且有可视化的界面。-masm32 used for the preparation of a request for the two majors and least common multiple procedures, and a visual interface.
qiuzuidagongyueshuhezuixiaogongbeishu
- 函数求两个整数的最大公约数和最小公倍数的源程序-integer function for the two majors and the least common multiple source files
gcd
- 从键盘输入两个常数，求其最大公约数，并以常数形式输出-the greatest common divsion
123
- 16位汇编语言编写的求两数的最大公约数和最小公倍数程序。-16 seeking the two greatest common divisor and least common multiple program written in assembly language.
yueshu
- 汇编实现利用欧几里得算法，求最大公约数，同时求出最新公倍数-Assembly to achieve the Euclidean algorithm, greatest common divisor, and find the latest common multiple
142
- 求两个整数的最大公约数和最小公倍数，并编写主函数调用这两个子函数，输出结果，两个整数由键盘输入。-#include<iostream> using namespace std int x(int a,int b) //x为求最大公约数的函数 { int t=0 if(a>b)t=b else t=a for(int i=t i>=1 i--)if(a i==0&&b i==0)break return i
gcd
- 通过输入的控制，比较两个数的大小，再求取两个数的最大公约数-By the input control, comparison of two numbers, size, and then calculate the greatest common divisor of two numbers
234
- 用c语言编程实现计算两个数的最大公约数，是一个比较简单的c语言作业练习-Calculate the greatest common divisor of two numbers using c programming language, is a relatively simple the c language operating practice
fibna
- 给出任意两数，可得到两数的最大公约数。通过三种算法实现，分别比较了三种算法的运行时间。-Given any two numbers, the greatest common divisor of two numbers can be obtained. There are three algorithms were compared three algorithms running time.
ee2_2
- 编写一个C#控制台应用程序，对输入两个正整数m和n，程序能够求出它们的最大公约数和最小公倍数。-Write a C# console application, the input two positive integers m and n, the program can be obtained their greatest common divisor and least common multiple.
greatest-divisor-least-multiple
- 求最大公约数和最小公倍数的一个应用，该文件主要目的是实现最大公约数和最小公倍数的代码-Find the greatest common divisor and least common multiple
Find-the-greatest-common-divisor
- 求最大公约数的C编程语言，有需要的可以-Find the greatest common divisor
123
- 输入两个正整数m和n，使用辗转相除法求它们的最大公约数和最小公倍数。-Enter two positive integers m and n, using the Euclidean algorithm find their greatest common divisor and least common multiple
zuidagongyueshu
- MIPS 汇编实现求最大公约数 用mars运行-MIPS assembler achieve greatest common divisor run by mars
dys
- 求两个或两个数以上的最大公约数，有可视页面(For the two or two numbers above the common denominator)