greatestcommondivisor.java

来自「《算法设计与分析》王晓东编著」· Java 代码 · 共 35 行

import java.util.Scanner;
public class GreatestCommonDivisor {

	/**
	 * @param args
	 */
	public static int gcd(int m,int n){
		if(m>n){
			int r = m%n;
			if(r==0) return n;
			return gcd(n,r);
		}
		if(m==n){
			return m;
		}
		int r=n%m;
		if(r==0) return m;
		return gcd(m,r);
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		System.out.print("m = ");
		int m = in.nextInt();
		System.out.print("n = ");
		int n = in.nextInt();
		if(m==0||n==0) {
			System.out.print("m*n shouldn't not be 0 !!");
			return;
		}
		System.out.print("The Greatest Common Divisor between m,n is "+gcd(m,n));
	}

}