It would really help me if anybody could help me with this.
Type: Posts; User: ihaterecursion
It would really help me if anybody could help me with this.
20 is the max number each number will be. I'm just trying to figure out what a memoization strategy would look like on this problem.
Just another question regarding this problem, would it be possible to apply memoization to this algorithm ( or to a different algorithm solving this problem)? If so how?
The examples are from the problem itself, and my instructor (after I asked) told me that for simplicity the problem assumes the necklace to be just a straight line, so no circle.
Thank you for the...
John, your solution is most probably what the problem was asking for. Thank you very much! If you don't mind could you please add some comments or a brief explanation of what it does so that I can...
Example input/output:
s = 12, r = 17, t = 20, e = 20, TOT = 69
RESULT=67
s = 13, r = 11, t = 14, e = 18, TOT = 56
RESULT=54
s = 7, r = 14, t = 12, e = 10, TOT = 43
RESULT=42
I shared my first attempt in the previous post. This is my second and different attempt which works way better but I don't think it's a completely valid solution for this problem.
Yeah sorry :P
This is my sad attempt at this problem
Hi, I'm learning combinatronics and algorithms in C at uni and stumbled upon this problem which I'm struggling to solve. I'm posting here after trying for 3 days to write a decent solution, but the...