搜索资源列表
Euclid
- c语言 欧几里得除法-Euclidean division of c language
acm
- acm中各种代码，除此参与acm有欧几里得，拓展欧几里得，求素数等问题-acm various code involved in addition there acm Euclid, Euclid expansion, and issues such as prime numbers
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
euclid[1]
- 实现了eculid算法，是一个很好的算法，实用于RSA-Achieved eculid algorithm, the algorithm is a good, practical in the RSA
euclid
- extended euclidean algorithm for polynomials with maple
euclidesfunciones
- Euclid s Extended Algorithm Algoritmo de Euclides Extendido
euclid1
- c++ implementation of euclid works on visual studio 2010 express on windows xp professional
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 follows: Let m and n be variables c
Euclid
- 欧几里得算法,用来计算两个数的最大公约数。此算法，基于数论的偶记离得算法-Euclidean algorithm, used to calculate the greatest common divisor of two numbers. This algorithm, based on number theory even remember from the algorithm
Euclidean-algorithm
- 欧几里得算法 非常给力 值得参考 招来不易啊-Euclid' s algorithm is very difficult to force ah worth considering provoke
KuoZhanOuJiLiDeSuanFa
- 利用Visual C++6.0实现扩展的欧几里得算法，有详细的注释，帮助理解。-Euclid algorithm for Visual using C++6.0, with detailed notes to help understand.