Segmentation Fault

CodeChefRating 1815Open on judge ↗

There are $N$ people numbered from $1$ to $N$ such that: - **Exactly one** of these people is a thief and always lies; - All the others are honest and always tell the truth. If the $i^{th}$ person claims that the thief is **one** person out of $L_i, L_i+1, L_i+2, \cdots, R_i$, determine how many people could be the thief. It is guaranteed that at least one person can be the thief. ### Input -

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