Good Integers

CodeChefOpen on judge ↗

Chef is eager to celebrate diwali. But he is assigned the task to distribute sweets to his neighbours. Consider Chef's neighbour live on a number line starting from 1. Chef doesn't like some of his neighbours. More specifically, he has $N$ neighbours which he doesn't like, given by $A_1, A_2,...A_N$. Chef decides that he will exclude these neighbours while distrubing sweets. As it is tedious tas

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