백준 1934번 - 최소공배수 (Java 8)

https://www.acmicpc.net/problem/1934

1934번: 최소공배수

코드 :

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        StringBuilder sb = new StringBuilder();
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        int T = Integer.parseInt(br.readLine());


        for (int i = 0; i < T; i++) {
            st = new StringTokenizer(br.readLine());
            int num1 = Integer.parseInt(st.nextToken());
            int num2 = Integer.parseInt(st.nextToken());
            int lcm = num1 * num2 / GCD(num1, num2);
            sb.append(lcm + "\n");
        }
        System.out.println(sb);

    }
    public static int GCD(int num1, int num2){
        int r = num1 % num2;
        if(r == 0){
            return num2;
        }
        return GCD(num2, r);
    }
}