Chef And Concert

CodeChefOpen on judge ↗

### Problem Chef is planning to attend a concert with his friends. He has $N$ friends, numbered from $1$ to $N$. The tickets of the concert are being sold quickly and chef doesn't want to miss this concert. The $i$-th friend can only purchase the ticket on $X_i$-th day. More specifically, the $i$-th friend can purchase the ticket on day $X_i, 2X_i, 3X_i,......$ and before $(i-1)$-th friend.

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