GeeksforGeeks

GeeksforGeeks » Algorithms

Algorithms: 'n' balls 'm' boxes with capacity constraints.

(1 post)

1. 

   alpha
   Member
   Posted 4 months ago #
   
   

   Hi guys,

   I am looking for algorithm to solve the following problem:
   Given 'n' balls and 'm' boxes with capacities c[1]......c[m], find an algorithm to calculate no. of ways in which these 'n' balls can be distributed in given boxes satisfying their capacity constraints. Each box can contain 0 or more balls but less than or equal to its capacity.

   Any algorithm to solve this problem?

Reply

You must log in to post.

RSS feed for this topic