This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Interesting... (not a reflection on this particular solution but cody in general) - most of the lowest scored answers could be entries in an "obfuscated code" contest.
I'm curious how all these "Size 10" solutions look like. I don't get even close to this value. I terms of education, it would be great to see example codes which are able to go this low.
Brilliant !
I join you @Eugen, it would be great to share some "Size 10" solutions samples.
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
%%
n = 1;
area_correct = 25;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
| 2 | Pass |
%%
n = 2;
area_correct = 41;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
| 3 | Pass |
%%
n = 3;
area_correct = 66;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
| 4 | Pass |
%%
n = 50;
area_correct = 439116598409;
tolerance = 1e-3;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
494 Solvers
740 Solvers
180 Solvers
170 Solvers
190 Solvers