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.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #208: Robot Walks
  4. Discussions

Project Euler #208: Robot Walks

Sort by

recency

|

8 Discussions

|

  • jzleetcode
     + 0 comments

    Top scorers, care to explain whether there is any algorithm can be better than exponential in time complexiy?

    I am extremely curious on whether that is possible without special logic for differnt n values.

  • elliefiji
     + 1 comment

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

  • zo0ok
     + 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?

  • Gaurav63200
     + 1 comment

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

  • adamchapman1985
     + 1 comment

    I did some editing of the solution at (http://euler.stephan-brumme.com/208/).

    I got it to work for the first testcase but not the others :(