Jonesy Wants Help

CodeChefOpen on judge ↗

Peely and Jonesy are playing game of Energy Sequences. Energy Sequence is known as $[x,x*e,x*e^2,x*e^3,......,x*e^k]$ for any value $x$ and $k$, where $e=energy$ Peely gives Jonesy a Sequence and Energy, Jonesy's task is to find the longest energy sub-sequence of the given Sequence. As Always Jonesy is busy, He asks your help to complete the task. sub-sequence of an array can be obta

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