I am having trouble with figuring out how to write a function for the following problem, I have to write a program that finds all possible combinations for these three guys (john,nick,stephen) to split a check. John only has $10 bills, nick only has $5 bills and stephen only has $2 bills. The point is for each of them to put a bill down until they reach the correct amount, they never go over. I would like to try writing this recursively but i’m having trouble thinking of a simple way to solve this.
thanks for the help!
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.Read more
Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.Read more
Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.Read more
Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.Read more
By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.Read more