Lolo and Chocolates

CodeChefOpen on judge ↗

Lolo and Coco are budding mathematicians. They are playing with **The PolyKnomKnom Machine**. The working of machine is as follows: Each **PolyKnomKnom Machine** takes in $a$ number of chocolates and outputs $b$ number of chocolates such that $P(a)=b$ for some polynomial $P$ with non-negative integer coefficients. Lolo and Coco, both have $1$ chocolate initially. Coco puts in her one and onl

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