This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 6;
c_correct = 1;
assert(isequal(goldbach2(n),c_correct))
|
2 | Pass |
n = 10;
c_correct = 2;
assert(isequal(goldbach2(n),c_correct))
|
3 | Pass |
n = 50;
c_correct = 4;
assert(isequal(goldbach2(n),c_correct))
|
4 | Pass |
n = 480;
c_correct = 29;
assert(isequal(goldbach2(n),c_correct))
|
Swap the first and last columns
9905 Solvers
365 Solvers
Project Euler: Problem 10, Sum of Primes
556 Solvers
500 Solvers
408 Solvers