Gold Cloning Machine

CodeChefOpen on judge ↗

As part of his new invention, the gold cloning machine, Gyro Gearloose has to calculate nCr for large values of n (take a guess, why!!). But he has not added this part to the machine, as he has not yet been able to compute them efficiently. Now, Scrooge McDuck wants this machine completed by tomorrow. As Gyro is busy working on the aesthetics of the machine, he wants you to write and test the code

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