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;
S1 = rand(n);
f=@(x)S1*x;
assert(isequal(S_param(f, n),S1))
ans =
0.8147
|
2 | Pass |
%%
n = 4;
S1 = rand(n);
f=@(x)S1*x;
assert(isequal(S_param(f, n),S1))
ans =
0.9058 0.0975 0.9649 0.4854
0.1270 0.2785 0.1576 0.8003
0.9134 0.5469 0.9706 0.1419
0.6324 0.9575 0.9572 0.4218
|
7685 Solvers
73 Solvers
263 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
Sum the entries of each column of a matrix which satisfy a logical condition.
111 Solvers