计科1112班 算法概论第一周作业

package ep1;
//import java.io.*;
import java.util.Scanner;
public class Commondivisor {
public static int gcd(int a,int b)
{
int c; int t;
if(a<b)
{
t=b;
b=a;
a=t;
}
c=a%b ;
while(c!=0)
{
a=b;
b=c;
c=a%b;
}
return b;
}
public static void main(String[] args){
int x,y;
Scanner scan=new Scanner(System.in);
System.out.println("输入两个整数(两个数之间以空格符分开)：");
x=scan.nextInt();
y=scan.nextInt();
System.out.println("两个数的最大公约数是："+gcd(x,y));
}
}