PS lite

CodeChefOpen on judge ↗

Problem setters are busy with their PS these days and have a pending report submission tonight. For setters to not lose marks and get 'A' in PS, they have asked you to solve this problem for them. They have $N$ special cakes from D-Mess, each of same size $X$. $i$-th of them is divided into $i$ equal pieces. Size of each piece is rounded down to $integer$ so that it can be processed easily, thoug

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