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 |
x = [1 4 5 7 10 11 13 20 21 23 29];
y_correct = 4;
assert(isequal(fib_count(x),y_correct))
|
2 | Pass |
x = 5:5:100;
y_correct = 2;
assert(isequal(fib_count(x),y_correct))
|
3 | Pass |
%x = [2 2 3 3 3 3 3 3 5 5 6 6 6 7 86168291600238450732788312165664788095941068326060883324529903470149056115823592713458328176574447204501];
% Changed the test suite to a number that can be represented as an integer in DOUBLE
x = [2 2 3 3 3 3 3 3 5 5 6 6 6 7 8944394323791465];
y_correct = 3;
assert(isequal(fib_count(x),y_correct))
|
4 | Pass |
x = [2 2 3 3 3 3 3 3 5 5 6 6 6 7 8944394323791464];
y_correct = 4;
assert(isequal(fib_count(x),y_correct))
|
485 Solvers
Create logical matrix with a specific row and column sums
170 Solvers
347 Solvers
Circular Primes (based on Project Euler, problem 35)
140 Solvers
615 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!