Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 6;
c_correct = 1;
assert(isequal(goldbach2(n),c_correct))
c =
1
|
2 | Pass |
%%
n = 10;
c_correct = 2;
assert(isequal(goldbach2(n),c_correct))
c =
2
|
3 | Pass |
%%
n = 50;
c_correct = 4;
assert(isequal(goldbach2(n),c_correct))
c =
4
|
4 | Pass |
%%
n = 480;
c_correct = 29;
assert(isequal(goldbach2(n),c_correct))
c =
29
|
650 Solvers
Create a square matrix of multiples
330 Solvers
Number of 1s in a binary string
1233 Solvers
1234 Solvers
482 Solvers