Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 3;
y_correct = 15;
assert(isequal(magic_sum(n),y_correct))
|
2 | Pass |
n = 5;
y_correct = 65;
assert(isequal(magic_sum(n),y_correct))
|
3 | Pass |
n = 7;
y_correct = 175;
assert(isequal(magic_sum(n),y_correct))
|
4 | Pass |
n = 8;
y_correct = 260;
assert(isequal(magic_sum(n),y_correct))
|
5 | Pass |
n = 20;
y_correct = 4010;
assert(isequal(magic_sum(n),y_correct))
|
6 | Pass |
n = 100;
y_correct = 500050;
assert(isequal(magic_sum(n),y_correct))
|
7 | Pass |
n = 200;
y_correct = 4000100;
assert(isequal(magic_sum(n),y_correct))
|
8 | Pass |
n = 1000;
y_correct = 500000500;
assert(isequal(magic_sum(n),y_correct))
|
1595 Solvers
Project Euler: Problem 3, Largest prime factor
170 Solvers
Number of digits in an integer
272 Solvers
180 Solvers
341 Solvers