Help Milo!

CodeChefOpen on judge ↗

Milo is quite apprehensive regarding the number of registrations that Hack36 would receive for its 3rd edition. Therefore, he keeps on guessing the number of registrations that would be there on a particular $n^{th}$ day. Milo has devised the following estimate for guessing the count. For $n^{th}$ day, the registrations would be received by following methods - - Each registrant will spread the 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