hello

I am stuck in this question its on binary search topic …from pilot course on codeforces

https://codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/D

please help

hello

I am stuck in this question its on binary search topic …from pilot course on codeforces

https://codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/D

please help

Do binary search on time and see how many balloons are inflated in given time. If it is greater than needed then update the answer.

When binary search is comp, you know the optimal time. Now, you can calculate how many balloons each assistant inflated.

2 Likes