java源代码:辗转相除法求最大公因数

import java.util.Scanner;

public class EuclideanAlgorithm {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		@SuppressWarnings("resource")
		Scanner scanner=new Scanner(System.in);
		System.out.print("请输入需要计算的两个数：");
		int x=scanner.nextInt();
		int y=scanner.nextInt();
		if(y>x) {
			int temp=0;
			temp=x;
			x=y;
			y=temp;						
		}
		int a=x%y;
		while(a!=0) {
			x=y;
			y=a;
			a=x%y;
		}
		System.out.println(y);

	}