← All problemsSign in

Remove Multiples

CodeChefRating 1315Open on judge ↗

You are given integers $N$ and $M$. You have with you the set $S = \{1, 2, 3, \ldots, N\}$. You are also given a set $Q$ of size $M$, which is a [subset](https://en.wikipedia.org/wiki/Subset) of the set $S$. You are required to convert $S$ into $Q$ using the following operation: - Choose an integer $k$ ($1 \le k \le N$) such that there exists a multiple of $k$ in $S$, and remove the **smallest

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