Query

CodeChefOpen on judge ↗

Digo has a Biology exam. The paper has N questions. All the questions have integral marks. Digo has M friends who are sitting around him in a circle. Digo’s friends are numbered from 1 to M, in a clockwise order. Each friend solves exactly one question, not necessarily distinct. Digo can select any index i (1 i M) and a number j, and then copies the answers of his j friends starting from index i,

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