Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
a = [1 2 3 4];
t = 0;
b_correct = [4 3 2 1];
assert(isequal(targetSort(a,t),b_correct))
d =
1 2 3 4
|
2 | Pass |
%%
a = -4:10;
t = 3.6;
b_correct = [-4 -3 10 -2 9 -1 8 0 7 1 6 2 5 3 4];
assert(isequal(targetSort(a,t),b_correct))
d =
Columns 1 through 9
7.6000 6.6000 5.6000 4.6000 3.6000 2.6000 1.6000 0.6000 0.4000
Columns 10 through 15
1.4000 2.4000 3.4000 4.4000 5.4000 6.4000
|
3 | Pass |
%%
a = 12;
t = pi;
b_correct = 12;
assert(isequal(targetSort(a,t),b_correct))
d =
8.8584
|
4 | Pass |
%%
a = -100:-95;
t = 100;
b_correct = [-100 -99 -98 -97 -96 -95];
assert(isequal(targetSort(a,t),b_correct))
d =
200 199 198 197 196 195
|
Project Euler: Problem 8, Find largest product in a large string of numbers
196 Solvers
357 Solvers
1019 Solvers
341 Solvers
393 Solvers