Given four different positive numbers, a, b, c and d, provided in increasing order: a < b < c < d, find if any three of them comprise sides of a right-angled triangle. Return true if they do, otherwise return false .
See Problem 1550 Can I make a right triangle ?
Thanks Tanya, have enjoyed these.
if (a==2|a==3)
flag=true;
end
The cases are very limited to make such a code valid
This is not a valid solution to this puzzle!!
This is a smart solution that is not cheating the system.
Logical enough!
Great work!
Lol saying great work on your own solution :P
Great work :)
Haha that's how we roll!
why the leading solution size is always 10, how could that possible?
Yeah, I know this is cheating, taking advantage of the limited test suite. I just wanted to see what the other small scores were about.
i need to change this
hardcore brute force
Should work for any case and doesn't contain str2num or regexp :)
Fifth test cannot be true because 3.5^2 = 12.25
and no integer after squaring and adding will give such result
how can this be a leading solution?? Are all the cody problems like this?
I don't understand this solution. Can you explain it ?
Still without str2num or regexp
this would fail on assert(isequal(isTherePythagoreanTriple(1,4,7,9),false))
The benefit of a limited test suite.
Without using str2num or regexp
1690 Solvers
Project Euler: Problem 2, Sum of even Fibonacci
707 Solvers
Create a square matrix of multiples
342 Solvers
395 Solvers
434 Solvers