DHANANJAY AND CANDIES

CodeChefOpen on judge ↗

$Dhananjay$ brought $K$ candies from the market and he wants to distribute those candies to his $N$ children. As $Dhananjay$ is a bit tricky person, he thought that let's distribute those candies with the following condition: - Every $i+1$th children should have more or equal candies than $i$th children, where $1 \leq i \leq N$. So in how many ways $Dhananjay$ can distribute candies to his c

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