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 |
%%
x = 1;
y_correct = false;
assert(isequal(multipleof9(x),y_correct))
|
2 | Pass |
%%
x = 9;
y_correct = true;
assert(isequal(multipleof9(x),y_correct))
|
3 | Pass |
%%
x = 10;
y_correct = false;
assert(isequal(multipleof9(x),y_correct))
|
4 | Pass |
%%
x = 111222;
y_correct = true;
assert(isequal(multipleof9(x),y_correct))
|
Project Euler: Problem 10, Sum of Primes
555 Solvers
Back to basics 9 - Indexed References
348 Solvers
243 Solvers
310 Solvers
241 Solvers