11335 - Discrete Pursuit

All about problems in Volume 113. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

New poster
Posts: 48
Joined: Sun Jun 22, 2014 6:14 am

Re: 11335 - Discrete Pursuit

Post by red_apricot » Sun May 17, 2015 8:19 pm

OK, let's say we can find the largest non-negative integer n such that n*(n+1)/2 <= a + n*u. That is, we come close to the robber in such a way that the next jump gets the cop ahead of the robber. What next? I see it has to be greedy in some way.

Post Reply

Return to “Volume 113 (11300-11399)”