Latest Posts in CSES
Factory Machines CSES Solution | CSES Problem Set | Binary Search
Raunit Verma- inCSESA factory has n machines which can be used to make products. Your goal is to make a total of t products. For each machine, you know the number of seconds it needs to make a single product. The machines can work simultaneously, and you can freely decide their schedule. What is the shortest time needed to make t products?
Multiplication Table CSES Solution | CSES Problem Set | Binary Search
Raunit Verma- inCSESFind the middle element when the numbers in an n \times n multiplication table are sorted in increasing order. It is assumed that n is odd. For example, the 3 \times 3 multiplication table is as follows:
Array Division Solution with Explanation | CSES Problem Set | Binary Search
Raunit Verma- inCSESYou are given an array containing n positive integers. Your task is to divide the array into k subarrays so that the maximum sum in a subarray is as small as possible.