https://www.codechef.com/CPOT2021/problems/CPP2107
I have seen a similiar kind of problem previously in a contest where it was to find minimum moves to reach n using inc/dec operations. But i dont remember which problem it was. The solutions for this problem are still hidden. Can someone help with this problem’s solution?

This seems to be a fairly simple problem, as just the minimum time is asked we just have to keep adding till we either reach or exceed the given number N.