Cody

Problem 44481. How many Fibonacci numbers?

Solution 1909415

Submitted on 22 Aug 2019 by Pauli Huusari
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

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))

m = [] jee = 0 1 m = 1×0 empty double row vector jee = 0 1 5 m = 1×0 empty double row vector jee = 0 1 5 13 m = 1×0 empty double row vector jee = 0 1 5 13 21 y = 4

2   Pass
x = 5:5:100; y_correct = 2; assert(isequal(fib_count(x),y_correct))

m = [] jee = 0 5 m = 1×0 empty double row vector jee = 0 5 55 y = 2

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))

m = [] jee = 0 2 m = 2 m = 1×0 empty double row vector jee = 0 2 3 m = 3 m = 3 m = 3 m = 3 m = 3 m = 1×0 empty double row vector jee = 0 2 3 5 m = 4 y = 3

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))

m = [] jee = 0 2 m = 2 m = 1×0 empty double row vector jee = 0 2 3 m = 3 m = 3 m = 3 m = 3 m = 3 m = 1×0 empty double row vector jee = 0 2 3 5 m = 4 m = 1×0 empty double row vector jee = 1.0e+15 * 0 0.0000 0.0000 0.0000 8.9444 y = 4