greatestcommondivisor.java

来自「算法设计与分析 1. 用直接递归方法计算n！： （2」· Java 代码 · 共 37 行

/**
 * @(#)GreatestCommonDivisor.java
 *
 *
 * @author 
 * @version 1.00 2008/10/21
 */
import java.util.Scanner;
public class GreatestCommonDivisor {
        
    /**
     * Creates a new instance of <code>GreatestCommonDivisor</code>.
     */
    public static int  GreatestCommonDivisor(int n,int m) {
    	
    	if(n%m==0)return m;
    	if(m%n==0)return n;
        if(n>m)return GreatestCommonDivisor(m,n%m);
        return GreatestCommonDivisor(n,m%n);
    }
    
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        int n=0;
        Scanner   scan=new  Scanner(System.in);
        System.out.print("input n=");
        n=scan.nextInt();
        int m=0;
        System.out.print("input m=");
        m=scan.nextInt();
        System.out.println("The GreatestCommonDivisor is:"+GreatestCommonDivisor(n,m));
    }
}