Marks :10
: 6 | : 0
Count the number of ways to distribute S candies to 3 children such that no child gets more than K candies.
First line contains 2 integers K≤5000 and S≤3∗K respectively
Print the number of ways of distributing candies
5 15
1
1 2
3
You need to login to view your submissions.
You need to login to view all submissions.
Result : Executed
Feel something is wrong with the test cases?
Result : Accepted
Test Cases :
But to Run or Submit the Problem, you need to Log In.
Continue to Log InYour challenge has been submitted successfully.
You will get a response soon via WhatsApp or Email.
Do let us know your issue.