Why it is overtime

Hi,

Please do not post entire programs here in open threads; this can give too much away to others. Instead, everybody who has solved a particular problem can visit your unsuccessful solution under your profile. For this particular problem, a few observations:

• There shouldn't be any need for random() decisions.
• The problem asks for the number of paths, not the paths themselves. Do you really need to store all paths?
• This problem has the dynamic-programming tag and talks about this approach. Have a look at Dynamic Programming on wikipedia.