A Study in Combinatorics

CodeChefOpen on judge ↗

Its the day of the final exam of the Combinatorics course. The question paper consists of K sections and there are a total of N questions, with ith section consisting of Ni questions. The students can attempt some(possibly all) questions in any order, but there is just one constraint that he/she cannot attempt two questions of same section consecutively, i.e. if suppose the student has attempted

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