Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 1;
y_correct = [1,1];
[m,n] = best_square_plot(x);
assert(isequal(sort([m,n]),y_correct))
|
2 | Pass |
%%
x = 3;
y_correct = [2,2];
[m,n] = best_square_plot(x);
assert(isequal(sort([m,n]),y_correct))
|
3 | Pass |
%%
x = 4;
y_correct = [2,2];
[m,n] = best_square_plot(x);
assert(isequal(sort([m,n]),y_correct))
|
4 | Pass |
%%
x = 5;
y_correct = [2,3];
[m,n] = best_square_plot(x);
assert(isequal(sort([m,n]),y_correct))
|
5 | Pass |
%%
x = 11;
y_correct = [3,4];
[m,n] = best_square_plot(x);
assert(isequal(sort([m,n]),y_correct))
|
6 | Pass |
%%
x = 26;
y_correct = [5,6];
[m,n] = best_square_plot(x);
assert(isequal(sort([m,n]),y_correct))
|
7 | Pass |
%%
x = 111;
y_correct = [11,11];
[m,n] = best_square_plot(x);
assert(isequal(sort([m,n]),y_correct))
|
8 | Pass |
%%
x = 4531;
y_correct = [67,68];
[m,n] = best_square_plot(x);
assert(isequal(sort([m,n]),y_correct))
|
Extract leading non-zero digit
967 Solvers
Find the "ordinary" or Euclidean distance between A and Z
119 Solvers
Matrix with different incremental runs
91 Solvers
Make a run-length companion vector
453 Solvers
40 Solvers