CANDY BAR (Medium)

CodeChefOpen on judge ↗

Jim enters a candy shop which has $N$ different types of candies, each candy is of the same price. Jim has enough money to buy $K$ candies. In how many different ways can he purchase $K$ candies if there are infinite candies of each kind? ###Category: - Medium (20 Marks) - 5 test cases of 20 pts each ###Input: First integer denotes the number of tests to be conducted($T$) Next 2$T$ input

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