BEHAPPY - Be Awesome As Barney Stinson
Barney Stinson ;) is way too flirty. He has many girlfriends and he wants to keep all of them happy. He has M girlfriends. He bought N gifts for them. Now he knows that some girlfriends need more gifts and some need less. So he decided that he will give atleast Ai gifts and at most Bi gifts to his ith girlfriend. He has to give away all the N gifts. Tell us in how many different ways he can do this.
For each test case, first line contains two integers M and N, then follows M lines each having two integers Ai and Bi (1 <= i <= M). Input ends with M and N both equal to 0 and that case should not be processed.
For each test case, output the number of different ways in which he can distribute those gifts in a single line.
1 <= M <= 20, 1 <= N <= 100, 0 <= Ai, Bi <=100
3 5 0 1 1 3 1 4 0 0
He can distribute 5 gifts in his 3 girlfriends in 6 different ways as follows (0 1 4), (0 2 3), (0 3 2), (1 1 3), (1 2 2), (1 3 1).
Only backtracking works. No need memorization
Niceeeee! Dp with memoisation.
No need to use dp, just recursion
The problem is good for beginners(for now) like me to get a good hold of bottom-up dp.
Simple Recursion :)
AC in ONE GO !!!
Good problem, weak test cases.
Accepted in one go!!!
AC in 1go....
Standard DP problem. Here's the hint if barney is giving j gifts to i girls then number of ways he can arrive at this situation can be by giving [j-lower(I th girl) , j - upper(I th girl) ] gifts from total gifts to (i-1)th girl and so on :)