欧几里得法

采用辗转相除法求两个正整数m和n的最大公约数。

package xxxx;
import java.util.Scanner;
public class A {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
	     Scanner scanner=new Scanner(System.in);
	     int a=scanner.nextInt(); 
	     int b=scanner.nextInt();	   
       int r=0;
       if(a>b){
    	 while(a%b!=0) {
    		 r=a%b;
    		 a=b;
    		 b=r;
    	 }
    	System.out.println(b);
     }
       else if(a==b){
    	  System.out.println(b);
       }
       else{
    	   while(b%a!=0){
    		   r=b%a;
    		   b=a;
    		   a=r;
    	   }
    	   System.out.println(a);
       }
	}

}