[백준] 1166 선물 - BinarySearch / Java

• 문제 링크

1166번: 선물

 

• 풀이 과정

 

• 풀이 코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
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());

        long n = Long.parseLong(st.nextToken());
        long l = Long.parseLong(st.nextToken());
        long w = Long.parseLong(st.nextToken());
        long h = Long.parseLong(st.nextToken());

        double low = 0, high = Math.max(l, Math.max(w, h));
        while (low < high) {
            double mid = (low + high) / 2;

            if (high == mid || low == mid) break;

            if ((long) (l / mid) * (long) (w / mid) * (long) (h / mid) < n) high = mid;
            else low = mid;
        }

        bw.write(String.valueOf(low));
        bw.flush();
    }

}