Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n=1;
y_correct=1;
assert(isequal(ismunch(n),y_correct))
|
2 | Pass |
n=0;
y_correct=1;
assert(isequal(ismunch(n),y_correct))
|
3 | Pass |
n=153;
y_correct=0;
assert(isequal(ismunch(n),y_correct))
|
4 | Pass |
n=634;
y_correct=0;
assert(isequal(ismunch(n),y_correct))
|
5 | Pass |
n=3435;
y_correct=1;
assert(isequal(ismunch(n),y_correct))
|
6 | Pass |
n=3534;
y_correct=0;
assert(isequal(ismunch(n),y_correct))
|
7 | Pass |
n=438579088;
y_correct=1;
assert(isequal(ismunch(n),y_correct))
|
The Goldbach Conjecture, Part 2
1286 Solvers
Calculate the Levenshtein distance between two strings
456 Solvers
Back to basics 11 - Max Integer
678 Solvers
965 Solvers
140 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!