Problem 1103. Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
Solution Stats
Problem Comments
-
5 Comments
To creator of this group,
Please check the test case 3 in the Problem of calculating side length from area of triangle. One ';' is missing which is not allowing the case to pass for correct solution.
This problem really highlights problems with the Cody scoring system. The score using a double for loop to brute force the lengths beats out a single for loop using equations. I tested my code in Matlab vs double loops and it's faster than most double loops I tested by several orders of magnitude for larger numbers (p>1000). There is also some sort of caching going on where my code gets orders of magnitude faster again if ran a few times vs most double for loops.
There is one exception with a double loop that is really fast by Hung Hoang. They use the for loops in a way that doesn't make it O^2.
interesting problem
Solution Comments
Show commentsGroup

Project Euler II
- 12 Problems
- 51 Finishers
- Sums of cubes and squares of sums
- Sum of big primes without primes
- Project Euler: Problem 11, Largest product in a grid
- Highly divisible triangular number (inspired by Project Euler 12)
- Divisors for big integer
- Large Sum (inspired by Project Euler 13)
- Longest Collatz Sequence
- Project Euler: Problem 16, Sums of Digits of Powers of Two
- Project Euler: Problem 18, Maximum path sum I
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Numbers spiral diagonals (Part 1)
- Numbers spiral diagonals (Part 2)
Problem Recent Solvers1889
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!