[백준_JAVA_알고리즘] 13241 최소공배수

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{
    	BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
    	
    	long A = 0; long B = 0; long GCD = 0;
    	
		StringTokenizer stringTokenizer = new StringTokenizer(bufferedReader.readLine());
		A = Long.parseLong(stringTokenizer.nextToken());
		B = Long.parseLong(stringTokenizer.nextToken());
		
		GCD = gcd(A,B);
		System.out.println(A*B/GCD);
		
    	bufferedReader.close();
    }
    
	// 최대공약수
	public static long gcd(long a, long b) {a
	    if (b == 0) return a;
	    return gcd(b, a % b);
	}
	
	// 최소공배수
//	public static int lcm(int a, int b) {
//	    return (a * b) / gcd(a, b);
//	}
}

데이터 타입은 long이다