输入a,b,
输出他们的最大公约数。
package hello1;
import java.util.Scanner;
public class maxgongyueshu {
public static void main(String[]args) {
Scanner in=new Scanner(System.in);
int a=in.nextInt();
int b=in.nextInt();
int gcd=1;
for(int i=2;i<=a&&i<=b;i++)
{
if(a%i==0&&b%i==0)
{
gcd=i;
}
}
System.out.println(a+"和"+b+"的最大公约数为"+gcd);
}
}
2辗转相除法
package hello1;
import java.util.Scanner;
public class gongyueshu2 {
public static void main(String[]args)
{
Scanner in = new Scanner(System.in);
int a=in.nextInt();
int b=in.nextInt();
int oa=a;
int ob=b;
while(b!=0)//辗转相除法
{
int r=a%b;
System.out.println(a+","+b+","+r);
a=b;
b=r;
}
System.out.println(oa+"和"+ob+"的这最大公约数为"+a);
}
}