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 #86: Cuboid route

# Project Euler #86: Cuboid route

Contest ends in

#### Sort by

recency

#### |

#### 13 Discussions

#### |

Please Login in order to post a comment

you can find my java solution here

Solved this problem in F#. Insights:

If anybody is interested, I can write down my approach to solve this problem.

. Would definitively advise to complete 75, and use roll distribution on the answer of 75. I dont think there is a way to solve it without generating pythagorean triplet correctly.

Nice question! Im am curious if anyone managed to solve it with Python 3?

My Python 3 solution was just a bit too slow. on my personal comuter it took 15s to compute the table of solutions, which is more than the limit of 10s. However when I translated my solution to Java it finishes in just 0.2s which is much less than the limit of 4s.

Maybe the limit is a bit too low for Python?

It may help to review OEIS A143715. The sequence is explained there and will also help check for correct calculations.

https://oeis.org/A143715