1062辗转相除法(欧几里得定理)

package aa;
import java.math.*;
import java.util.Scanner;
public class demo1 {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int m = input.nextInt();
        int n = input.nextInt();

        int yue = Math.min(m,n);
        int chu = Math.max(m,n)%Math.min(m,n);
        for (int i = Math.max(yue,chu); i >0 ; i--) {
            if(yue%i==0&&chu%i==0){
                System.out.println(i);
                break;
            }

//        for (int i = Math.max(m,n); i >0 ; i--) {
//            if(n%i==0&&m%i==0){
//                System.out.println(i);
//                break;
//            }
        }
    }}

正确的：

import java.math.*;
import java.util.Scanner;
public class demo1 {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int a = input.nextInt();
        int b = input.nextInt();
        System.out.println(gcd(a, b));  //求a和b的最大公约数
        System.out.println(lcm(a, b));  //求a和b的最小公倍数
        input.close();
    }

    public static int lcm(int a, int b) {
        return a * b / gcd(a, b);
    }

    public static int gcd(int a, int b) {
        if (b == 0) return a;
        return gcd(b, a%b);
    }
}

(2条消息) 经典算法之辗转相除法(欧几里得定理)_striner的博客-优快云博客