Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^2: Highest total sum path problem

by QM (Parson)
on Mar 06, 2020 at 17:01 UTC ( #11113912=note: print w/replies, xml ) Need Help??


in reply to Re: Highest total sum path problem
in thread Highest total sum path problem

Shouldn't this be unambiguous? How far is a "slide"?
up-slide down-slide left-slide up-slide right down right-slide down-slide left up-slide down-slide down-slide left up-slide

-QM
--
Quantum Mechanics: The dreams stuff is made of

Replies are listed 'Best First'.
Re^3: Highest total sum path problem
by tybalt89 (Prior) on Mar 06, 2020 at 17:40 UTC

    There were no examples of that in the original post.

    Sigh, yet another case of an incomplete spec.

      <cough> Can you really blame it on the spec?

      Instead you could actually output the distance slid, and move on.

      -QM
      --
      Quantum Mechanics: The dreams stuff is made of

        I easily could, but then my output wouldn't match the requested output :)

Re^3: Highest total sum path problem
by LanX (Cardinal) on Mar 08, 2020 at 01:02 UTC
    > Shouldn't this be unambiguous?

    Well, in this case it is, because the order of the added values is unique.

    Cheers Rolf
    (addicted to the Perl Programming Language :)
    Wikisyntax for the Monastery

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://11113912]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2021-01-18 01:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?