This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 2;
y_correct = [1 2; 2 4];
assert(isequal(timestables(x),y_correct))
n =
1 2
|
2 | Pass |
%%
x = 5;
y_correct = [1 2 3 4 5; 2 4 6 8 10; 3 6 9 12 15; 4 8 12 16 20; 5 10 15 20 25];
assert(isequal(timestables(x),y_correct))
n =
1 2 3 4 5
|
Project Euler: Problem 7, Nth prime
339 Solvers
190 Solvers
Who knows the last digit of pi?
488 Solvers
Vectorize the digits of an Integer
236 Solvers
Flag largest magnitude swings as they occur
524 Solvers