← All problemsSign in

D - Hard Counting Problem

Alice had an array $A$ of $N$ elements, but for no reason whatsoever, a monster has started attacking the array. (Why? How? We don't know either!) The monster does not like non-fixed indices (where a fixed index means that $A_i = i$). Thus, every second starting from $1$, the monster deletes all elements simultaneously from the array at indices $i$ satisfying $A_i \ne i$. The remaining elements

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