搜索资源列表
最大公约数算法
- 求2个数之间的最大公约数，随便输入2个数字会得到他们之间的最大公约数
CBigInt_CommonDivision.zip
- 本程序代码，主要为了测试大整数的四则运算 ，以及在此基础上进行求最大公约数的计算。 bigint_lib_dll文件夹中分别为编译好的lib库文件和dll库文件以及源代码。 test_bigintcommondevision文件夹中为测试程序，工程使用的是lib库文件。 头文件中部分函数没有定义。,This procedure code, mainly to test the four large integer arithmetic, as well as on the ba
Euclidium
- 歐基理德輾轉相除法(之一) 以歐基理德輾轉相除法求出m，n這2個整數的最大公因數 -Reed Euclid division algorithm (one) to Euclid division algorithm Reed obtained m, n this two integers gcd
fasterEuclidium
- 歐基理德輾轉相除法(之二) m與n相差太大時，可用(m％n)來取代(m-n)，這樣的處理效率較高。以下便以此方法求出最大公因數。 -Reed Euclid division algorithm (II) m and n be too significant, the available (m％ n) to replace the (mn), this kind of treatment more efficient. The following will be obtained in t
maxandmin
- 自己编写的最新数据处理程序，其中的求最大公约数和最小公倍数非常有价值-I have written the latest data-processing procedures, which seek the common denominator and least common multiple very valuable
bei
- 本程序目的求两个整数的最大公约数和最小公倍数-The purpose of this procedure for the common denominator of two integers and the least common multiple
work
- 自动从一加到一百，求最大公约数，查找最大的数-Automatically added from the 100, and the common denominator, find the largest number of
aaa
- 求最大公约数和最小公倍数.用C++写的，希望对大家有用。-Seek the common denominator and least common multiple. Using C++ written in the hope that useful to everyone.
Exercise1
- 很简单的一个求最大公约数算法,并求求余次数,以及100以内各求余次数的最小整数队.-A very simple algorithm for seeking the common denominator, and I beg the frequency and the seeking of more than 100 times less than the smallest integer teams.
verilog2
- 求出两个在100以内的正整数的最大公约数和最小公倍数。（不采用mod函数）-Obtained within two in the 100 and the least common multiple greatest common divisor of positive integers. (Without using mod function)
1515
- 求 最大公倍数 输入两个数 求他们的最大公倍数-The biggest common multiple input seeking their greatest common multiple of two numbers
CPP-common-mothod
- 面向对象源码 常用算法 累加 阶乘 求最大最小值 求最大公约数 数组元素-For object source commonly used algorithms accumulate factorial seeking maximum and minimum demand the greatest common divisor of array elements
gongyueshu
- 求最大公约数 Seek the greatest common divisor-Seek the greatest common divisor
cdsafsafewf
- 求s=a+aa+aaa+aaaa+aa...a的值，求最大公约数和最小公倍数-Seeking s = a+aa+aaa+aaaa+aa ... a value, find the greatest common divisor and least common multiple
AlgorithmAnalysis
- 该VC程序中，包含了求最大公约数的三种方法：1、欧几里得算法；2、求全部质因数方法；3、连续整数检测方法-The VC program, including the common denominator of the three methods: 1, Euclidean algorithm 2, find all the prime factor method 3 consecutive integers detection method
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 remainder of a, if a is not equal
zdgys
- 利用辗转法求最大公约数 -Use method for flounder flounder method for the use of the common denominator common denominator
CPP
- 此压缩包包含六个C++程，包含“杨辉三角”、求最大公约数和最大公倍数等问题-This archive contains six C++ away with Pascal s Triangle , find the common denominator and the greatest common factor and other issues
辗转相除2
- 用简便的辗转相除求最大公约数，用三种方法for，while，do while(For the common denominator with a simple division, with the three methods of for, while, do, while)
C
- 一个简单的程序，求最小公倍数和最大公因数(A simple procedure for finding the least common multiple and the greatest common factor.)