I have no idea if this is the right place to ask a question like this. As I searched if it was, I couldn't get the answer. If not, please remind me and I will delete this. I have a specific problem that I can't solve. Please suggest solutions if possible. The problem goes like:
We have n1 boxes of 50kg and n2 boxes of 100kg cargo. We have a plane which contains at most k kg. We have to ship all the cargo from one mountain to another. The principle of shipping is that at any given time (from 1 mountain to 2 or vice versa) there should be at least 1 cargo on the plane. The question is, how many ways are there to ship all the cargo in minimum number of shippings. (Like if the minimum number of flights required to ship is 5, then question is how many ways are there to ship all the cargo in 5 flights). A way is considered different if at least one flight had different amount of boxes.
I'm guessing that graph traversal should be used. Tell me if I'm wrong.