find the greatest common divisor
2014-11-13 12:56
281 查看
function gcd(a, b) if b = 0 return a else return gcd(b, a mod b)
相关文章推荐
- [计算最大公因子]Finding the greatest common divisor (gcd) of 2 numbers
- P32 (**) Determine the greatest common divisor of two positive integer numbers.
- Calculate the Greatest Commom Divisor (GCD) and Lowest Common Multiple (LCP) of Two Integers
- P32 (**) Determine the greatest common divisor of two positive integer numbers.
- given two unordered list find the greatest common integer
- The greatest common divisor gcd(最大公约数)
- The Greatest Common Divisor
- 最大公约数计算(Find the Greatest Common Divisior)
- [Templates That Are Usually Used]Greatest Common Divisor
- hdu 5207 Greatest Greatest Common Divisor 数学
- GCD (Greatest Common Divisor)
- hdu 5210 Greatest Greatest Common Divisor
- 最大公约数(greatest common divisor)算法
- hdu 5207 Greatest Greatest Common Divisor(筛法求公约数)
- Find the most common character.
- HDU 1841 Find the Shortest Common Superstring
- 【HDU 5207】Greatest Greatest Common Divisor —— 最大公因子
- More than one way to get gcd(greatest common divisor,最大公约数)
- HDU 1841 Find the Shortest Common Superstring(KMP)
- hdu 5207 Greatest Greatest Common Divisor