Codeforces EDU Binary Search Step 2 C, D

Hello PROgrammers. Today we are going to solve problem C and D from Codeforces EDU binary search step 2. These problems are optimization problems, that require discrete binary search. Time-stamps: Problem C: 06:21 Problem D: 14:20 Solution (problem C): https://ideone.com/e.js/xighhV Solution (problem D): https://ideone.com/e.js/3POjnw More Practice Problems on Discrete Binary Search: SPOJ (AGGRCOW): https://www.spoj.com/problems/AGGRCOW/ SPOJ (EKO): https://www.spoj.com/problems/EKO/ SPOJ (PRATA): https://www.spoj.com/problems/PRATA/ Leetcode (Packages): https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/ Leetcode (Koko eating bananas): https://leetcode.com/problems/koko-eating-bananas/ Leetcode (Mutated Arrays): https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/ Leetcode (Smallest Threshold divisor): https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/