2609 최대공약수와 최소공배수

---

https://st-lab.tistory.com/154

[백준] 2609번 : 최대공약수와 최소공배수 - JAVA [자바]

 

 

 

---

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

public class Main {
	static boolean arr[];
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine(), " ");
		int n1 = Integer.parseInt(st.nextToken());
		int n2 = Integer.parseInt(st.nextToken());
		StringBuilder sb = new StringBuilder();
		sb.append(gcd(n1, n2)).append('\n').append(lcm(n1, n2));
		System.out.println(sb);
	}
	static int gcd(int a, int b) {
		if(b == 0) {
			return a;
		}
		return gcd(b, a%b);
	}
	static int lcm(int a, int b) {
		return a * b / gcd(a,b);
	}
}