editorial: https://atcoder.jp/contests/abc195/editorial/902
prob: https://atcoder.jp/contests/abc195/tasks/abc195_b
I’m not able to fully understand how this solution is correct
for tc: 300 333 1
how will the value of M is going to be zero because 1000n <= 333 n where n is lets say 1
hello @raghav007
here u are given A (minimum weight possible) and B maximum weight possible .
now first tell be what is minimum and maximum total weight u can achieve and how when u have to pick n oranges?
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.