Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 5 2 4 3];n=1;
y_correct = [1 3 5 3.5 2 3 4 3.5 3];
assert(isequal(stretch_it_out(x,n),y_correct))
|
2 | Pass |
x = [1 5 2 4 3];n=2;
y_correct=[1 2+1/3 3+2/3 5 4 3 2 2+2/3 3+1/3 4 3+2/3 3+1/3 3];
y=abs(stretch_it_out(x,n)-y_correct);
assert(max(y)<1e-9)
|
3 | Pass |
k=ceil(5*rand)+1
x=1:k:121
n=k-1;
assert(isequal(stretch_it_out(x,n),1:121))
k =
4
x =
Columns 1 through 30
1 5 9 13 17 21 25 29 33 37 41 45 49 53 57 61 65 69 73 77 81 85 89 93 97 101 105 109 113 117
Column 31
121
|
4 | Pass |
x=[1 -1 1 -1 1 -1 1];n=3;
y_correct=[1 0.5 0 -0.5 -1 -0.5 0 0.5 1 0.5 0 -0.5 -1 -0.5 0 0.5 1 0.5 0 -0.5 -1 -0.5 0 0.5 1];
assert(isequal(stretch_it_out(x,n),y_correct))
|
Find best placement for ordered dominoes (harder)
194 Solvers
138 Solvers
The sum of the numbers in the vector
341 Solvers
392 Solvers
127 Solvers