LanQiaoTestCodes/求最大公约数.java

30 lines
569 B
Java
Raw Permalink Normal View History

2023-04-23 12:34:32 +00:00
package Course_Codes;
import java.util.Scanner;
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Լ<EFBFBD><D4BC>
public class <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Լ<EFBFBD><EFBFBD> {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int a=sc.nextInt();
int b=sc.nextInt();
System.out.println("ŷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ã<EFBFBD>"+Gcd1(a,b));
System.out.println("<EFBFBD>ݹ飺"+Gcd(a,b));
}
//Gcd=<3D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Լ<EFBFBD><D4BC>
public static int Gcd(int a,int b) {
return b==0?a:Gcd(b,a%b);
}
public static int Gcd1(int a,int b) {
while(b>0) {
int temp=a%b;
a=b;
b=temp;//Gcd(a,b)=>Gcd(b,a%b)
}
return a;
}
}