Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
a = [93 1147 473 259 629 1591 851 533 2021 86 817 2279 1763 961 1073 205]
len_correct = 5;
d_correct = 43;
[len,d] = divisor_run(a);
assert(isequal(len,len_correct) && isequal(d,d_correct))
a =
Columns 1 through 8
93 1147 473 259 629 1591 851 533
Columns 9 through 16
2021 86 817 2279 1763 961 1073 205
|
2 | Pass |
%%
a = [166 553 1241 869 237 395 1079 1577];
len_correct = 3;
d_correct = 79;
[len,d] = divisor_run(a);
assert(isequal(len,len_correct) && isequal(d,d_correct))
|
3 | Pass |
%%
a = [533 205 123 287 451 697 82];
len_correct = 7;
d_correct = 41;
[len,d] = divisor_run(a);
assert(isequal(len,len_correct) && isequal(d,d_correct))
|
4 | Pass |
%%
a = [3937 7493 1397 5633 6439 3151 5617 685 7261 5069 ...
959 3973 411 2603 2329 1781 262];
len_correct = 12;
d_correct = 137;
[len,d] = divisor_run(a);
assert(isequal(len,len_correct) && isequal(d,d_correct))
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
Project Euler: Problem 10, Sum of Primes
707 Solvers
584 Solvers
414 Solvers
Calculate Amount of Cake Frosting
7547 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!