[JAVA] 백준 2609: 최대공약수와 최소공배수

GCB와 LCM을 재귀함수를 사용해 풀었다

import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringTokenizer st = new StringTokenizer(br.readLine());

        int a = Integer.parseInt(st.nextToken());
        int b = Integer.parseInt(st.nextToken());

        int resultG = gcd(a, b);
        int resultL = (a*b) / resultG;


        bw.write(String.valueOf(resultG));
        bw.newLine();
        bw.write(String.valueOf(resultL));

        bw.flush();
        bw.close();
        br.close();
    }

    static int gcd(int x, int y){
        if(y == 0) return x;
        return gcd(y, x % y);
    }
}