[BOJ] 8992 집기 게임Read more
[LeetCode] Find the Smallest Divisor Given a Threshold

1283. Find the Smallest Divisor Given a Threshold

Given an array of integers nums and an integer threshold, we will choose a positive integer divisor, divide all the array by it, and sum the division’s result. Find the smallest divisor such that the result mentioned above is less than or equal to threshold.

Each result of the division is rounded to the nearest integer greater than or equal to that element. (For example: 7/3 = 3 and 10/2 = 5).

The test cases are generated so that there will be an answer.

Read more
[BOJ] 11111 두부장수 장홍준 2Read more
[BOJ] 9413 제주도 관광Read more
[BOJ] 3640 제독Read more
[BOJ] 1585 경찰Read more
[BOJ] 10937 두부 모판 자르기Read more
[BOJ] 11407 책 구매하기 3Read more
[BOJ] 11405 책 구매하기Read more
[BOJ] 열혈강호 6Read more