← All problemsSign in

Crazy Jumping Frogs

CodeChefRating 1680Open on judge ↗

There are $N$ frogs, numbered from $1$ to $N$. There are also $2N$ buckets arranged in a straight line, numbered from $1$ to $2N$. Let $A_i$ denote the index of the bucket containing frog $i$. You are given the initial values of $A_i$. Every second, the following happens: - If all frogs are in the same bucket already, nothing happens. - Otherwise, each frog will jump one step towards whichever

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start