We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

# Project Euler #208: Robot Walks

# Project Euler #208: Robot Walks

+ 1 comment I have had a hard time with similar problems before.

Simply put, there are 2^m possible paths to test. This is easy, unless they are too many. Which they are.

Dynamic programming helps, but not that far. Memory is not enough to remember paths (since they only occationally overlap) and/or there are too many solutions to calculate to do it in time.

It is (perhaps) possible to eliminate some subset of paths.

Can anyone give a hint? Is dynamic programming with some twist possible? Or a completely different approach required?

+ 1 comment Can anyone explain to me what is the use of Modulo K in the input? I'm a little confused

+ 1 comment what does it mean to read from STDIN and output to STDIN? How do you do that?

+ 1 comment faridun kuntemi tu

+ 0 comments fariduni O-O-O-O-O-O-O-O-O-O-O-

Load more conversations

Sort 7 Discussions, By:

Please Login in order to post a comment