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 = 1;
t = 1;
assert(isequal(factorial(n),t))
|
2 | Pass |
%%
n = 2;
t = 2;
assert(isequal(factorial(n),t))
|
3 | Pass |
%%
n = 3;
t = 6;
assert(isequal(factorial (n),t))
|
4 | Pass |
%%
n = 6;
t = 720;
|
721 Solvers
Project Euler: Problem 10, Sum of Primes
556 Solvers
535 Solvers
243 Solvers
MATCH THE STRINGS (2 CHAR) very easy
194 Solvers