Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n=10;
y_correct = 17;
assert(isequal(sum_prime(n),y_correct))
|
2 | Pass |
n=1;
y_correct = 0;
assert(isequal(sum_prime(n),y_correct))
|
3 | Pass |
n=1000;
y_correct = 76127;
assert(isequal(sum_prime(n),y_correct))
|
4 | Pass |
n=185;
y_correct = 3447;
assert(isequal(sum_prime(n),y_correct))
|
14229 Solvers
Back to basics 19 - character types
189 Solvers
Return unique values without sorting
488 Solvers
118 Solvers
Test Problem; Create a 5x5 array containing all ones
198 Solvers