Clunky, but I'm happy ^_^
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
a = 1;
b = 2;
out = sumDigits(a);
assert(isequal(out, b))
|
2 | Pass |
%%
a = 10;
b = 7;
out = sumDigits(a);
assert(isequal(out, b))
|
3 | Pass |
%%
a = 16;
b = 25;
out = sumDigits(a);
assert(isequal(out, b))
|
Find state names that end with the letter A
551 Solvers
Count from 0 to N^M in base N.
200 Solvers
340 Solvers
Project Euler: Problem 5, Smallest multiple
241 Solvers
Create a Multiplication table matrix...
226 Solvers