You are viewing a single comment's thread. Return to all comments →
firstly cap to next odd n (if it was even), then choose shortest path:
int pageCount(int n, int p) { return min(p, (n / 2) * 2 + 1 - p) / 2; }
Seems like cookies are disabled on this browser, please enable them to open this website
Drawing Book
You are viewing a single comment's thread. Return to all comments →
firstly cap to next odd n (if it was even), then choose shortest path: