Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
C = 0;
lim = 5;
N_correct = 5;
assert(isequal(mandelbrot(C,lim),N_correct))
|
2 | Pass |
C = [0 0.5; 1 4];
lim = 5;
N_correct = [5 4; 2 1];
assert(isequal(mandelbrot(C,lim),N_correct))
|
3 | Pass |
i = sqrt(-1);
C = [i 1 -2*i -2];
lim = 10;
N_correct = [10 2 1 10];
assert(isequal(mandelbrot(C,lim),N_correct))
|
Find the longest sequence of 1's in a binary sequence.
2443 Solvers
351 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
477 Solvers
304 Solvers