A Quantum Teleporter - Code Golf

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.

thank you. is this the same approach for the problem “to find minimum moves to reach n using inc/dec by 1 operations” ?


I am not able to understand your statement completely, if you have the question, you can provide the link.