This week's book giveaway is in the OCPJP forum. We're giving away four copies of OCA/OCP Java SE 7 Programmer I & II Study Guide and have Kathy Sierra & Bert Bates on-line! See this thread for details.
i am trying to solve project euler problem 76.
"How many different ways can one hundred be written as a sum of at least two positive integers?"
i tried a recursive approach but i get incorrect answers.
for 5 the answer should be 6. i get answer 7.
for 6 the answer should be 10. i get answer 9.
recursion has never been easy for me and i don't see what i am doing wrong.
this problem should ideally be solved using dynamic programming since the recursive solution will probably be slow, so any suggestions in that regard are welcome also. here is what i have.
Recursion and looping is a pretty heady topic to just walk through and figure out what is going wrong wrong. What I would do (were I you) would be:
1) start with a smaller number than 100
2) walk through the process by hand. Write each iteration so I can see how I got to the answer.
3) add print statements so I can see what is being counted in code. Or add break points and run in a debugger so I can look at different values as the code executes.
4) Compare #3 to #2 and see where the mistake is coming from
5) Scale up toe 100.
Randall, recursion becomes much easier if your code is self-documenting. I wouldn't call recurse() a particularly descriptive method name. What problem does it solve?
What if you have a method int waysToWrite(int number, int limit)? It will determine in how many ways you can write number, with none of the terms of the sums exceeding limit. Let's take 7 as an example:
My implementation of waysToWrite() didn't use dynamic programming, and took about 10 seconds to come up with the answer for waysToWrite(100, 99). You can add a HashMap that stores answers you already computed in a previous run, which will probably cause the program to come up with the final answer instantaneously.