2. Nikunj and Donuts #
Created Sunday 19 July 2020
- WA
Solution: Sort the array. Eat the largest cake, first, mult=1. Then the second largest mult=2 etc. This will solve the problem. Because we can only control j and not i.
Created Sunday 19 July 2020
Solution: Sort the array. Eat the largest cake, first, mult=1. Then the second largest mult=2 etc. This will solve the problem. Because we can only control j and not i.