how can this be a leading solution?? Are all the cody problems like this?
I don't understand this solution. Can you explain it ?
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
a = 1;
b = 2;
c = 3;
d = 4;
flag_correct = false;
assert(isequal(isTherePythagoreanTriple(a, b, c, d),flag_correct))
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
flag =
0
|
2 | Pass |
%%
a = 2;
b = 3;
c = 4;
d = 5;
flag_correct = true;
assert(isequal(isTherePythagoreanTriple(a, b, c, d),flag_correct))
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
|
3 | Pass |
%%
a = 3;
b = 4;
c = 5;
d = 6;
flag_correct = true;
assert(isequal(isTherePythagoreanTriple(a, b, c, d),flag_correct))
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
|
4 | Pass |
%%
a = 3;
b = 4;
c = 4.5;
d = 5;
flag_correct = true;
assert(isequal(isTherePythagoreanTriple(a, b, c, d),flag_correct))
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
|
5 | Pass |
%%
a = 3;
b = 3.5;
c = 4;
d = 5;
flag_correct = true;
assert(isequal(isTherePythagoreanTriple(a, b, c, d),flag_correct))
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
flag =
1
|
1091 Solvers
What is the next step in Conway's Life?
639 Solvers
1763 Solvers
Convert a vector into a number
503 Solvers
2625 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!