Trip to Wonderland

CodeChefOpen on judge ↗

Once Gajjo went to wonderland. There he saw there are $N$ age groups living. Each group has age Ai ($1 \leq i \leq N$). An age group Ai can punish all the members of age groups less than or equals to Ai/((Ai%k)+2). Gajjo does not like this. He wants a happy wonderland where no one gets punished. Also, he wants to maximize the number of age groups in wonderland. Help him to find out the number of g

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