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;
y_correct = [1];
assert(isequal(binary(n),y_correct))
|
2 | Pass |
%%
n = 7;
y_correct = [1 1 1];
assert(isequal(binary(n),y_correct))
|
3 | Pass |
%%
n = 10;
y_correct = [1 0 1 0];
assert(isequal(binary(n),y_correct))
|
747 Solvers
Project Euler: Problem 7, Nth prime
339 Solvers
309 Solvers
298 Solvers
200 Solvers