文件名称:GCDP
- 所属分类：
- JSP源码/Java
- 资源属性：
- [Java] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 3kb
- 下载次数：
- 0次
- 提 供 者：
- 陈**
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
演算法-透過輾轉相除法求出最大公因數, 再透過最大公因數求最小公倍數,最大公因數(GCD)可以使用輾轉相除法來求，最小公倍數(LCM)則由這個公式來求 :
GCD * LCM = 兩數乘積-Algorithm- through Euclidean division to find the greatest common factor, through the greatest common factor and least common multiple and greatest common divisor (GCD) can use the Euclidean algorithm to seek the least common multiple (LCM) from this formula to seek: GCD* LCM = product of the two numbers
GCD * LCM = 兩數乘積-Algorithm- through Euclidean division to find the greatest common factor, through the greatest common factor and least common multiple and greatest common divisor (GCD) can use the Euclidean algorithm to seek the least common multiple (LCM) from this formula to seek: GCD* LCM = product of the two numbers
(系统自动生成,下载前可以参看下载内容)
下载文件列表
GCDP\GCDP.java
....\GCDP1.java
....\GCDP2.java
....\GCDP3.java
....\GCDP4.java
....\GCDP5.java
GCDP