910111213141516171819202122232425262728293031323334353637383940

import java.util.*;

class SmallestDivisorFinder {
    // Helper method to calculate sum by divisor
    private int sumByD(int[] arr, int div) {
        int sum = 0;
        for (int num : arr) {
            sum += Math.ceil((double) num / div);
        }
        return sum;
    }

    // Method to find the smallest divisor using binary search
    public int smallestDivisor(int[] arr, int limit) {
        if (arr.length > limit) return -1;

        int low = 1;
        int high = Arrays.stream(arr).max().getAsInt();

        while (low <= high) {
            int mid = (low + high) / 2;
            if (sumByD(arr, mid) <= limit) {
                high = mid - 1; // Try smaller divisor
            } else {
                low = mid + 1;  // Try larger divisor
            }
        }

        return low;
    }

    public static void main(String[] args) {
        SmallestDivisorFinder solver = new SmallestDivisorFinder();
        int[] arr = {1, 2, 3, 4, 5};
        int limit = 8;
        int result = solver.smallestDivisor(arr, limit);
        System.out.println("The minimum divisor is: " + result);
    }
}

123456789101112131415161718192021222324252627282930

import math

class SmallestDivisorFinder:
    # Helper method to calculate sum by divisor
    def sumByD(self, arr, div):
        return sum(math.ceil(x / div) for x in arr)

    # Method to find the smallest divisor using binary search
    def smallestDivisor(self, arr, limit):
        if len(arr) > limit:
            return -1

        low = 1
        high = max(arr)

        while low <= high:
            mid = (low + high) // 2
            if self.sumByD(arr, mid) <= limit:
                high = mid - 1  # Try smaller divisor
            else:
                low = mid + 1   # Try larger divisor

        return low

# Driver code
solver = SmallestDivisorFinder()
arr = [1, 2, 3, 4, 5]
limit = 8
print("The minimum divisor is:", solver.smallestDivisor(arr, limit))

1234567891011121314151617181920212223242526272829303132333435363738394041

class SmallestDivisorFinder {
  // Helper method to compute the sum of ceil(arr[i] / div)
  sumByD(arr, div) {
    let sum = 0;
    for (let num of arr) {
      sum += Math.ceil(num / div);
    }
    return sum;