조예지

from math import ceil def solution (n, times): answer = 0 lo = ceil(min(times) * n / len(times)) mx = ceil(max(times) * n / len(times)) while lo <= mx: mid = (lo + mx)//2 sum = 0 for i in range(len(times)): sum += mid // times[i] if sum >= n: mx = mid - 1 else: lo = mid + 1 return lo