Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re^3: Highest total sum path problem

by tybalt89 (Monsignor)
on Mar 06, 2020 at 17:40 UTC ( [id://11113914]=note: print w/replies, xml ) Need Help??


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

There were no examples of that in the original post.

Sigh, yet another case of an incomplete spec.

Replies are listed 'Best First'.
Re^4: Highest total sum path problem
by QM (Parson) on Mar 07, 2020 at 15:27 UTC
    <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 :)

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others admiring the Monastery: (4)
As of 2024-06-16 16:43 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    erzuuli‥ 🛈The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.