Add to Subsequence

CodeChefRating 1737Open on judge ↗

Chef has an array $A$ of length $N$. In one operation, Chef can choose any [subsequence](https://en.wikipedia.org/wiki/Subsequence) of the array and any integer $X$ and then add $X$ to **all** the elements of the chosen subsequence. Determine the **minimum** number of operations required to make all the elements of the array **distinct**. ### Input - The first line of input will contain a singl

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