FibonacciSequence | Topcoder Archive

Problem Statement

A fibonacci sequence is defined recursively as follows:

F₁ = F₂ = 1;
F_n = F_n-1 + F_n-2;

Given two integers a and b, return the number of fibonacci numbers between a and b, inclusive.

Definition

Class:: FibonacciSequence
Method:: numFibs
Parameters:: int, int
Returns:: int
Method signature:: int numFibs(int a, int b)
(be sure your method is public)

Constraints

a will be between 2 and 1000, inclusive.
b will be between a and 1000, inclusive.

Examples

```
2
```
```
5
```
```
Returns: 3
```
The fibonacci sequence is {1,1,2,3,5,...}. There are 3 fibonacci numbers between 2 and 5, inclusive: {2,3,5}.
```
12
```
```
13
```
```
Returns: 1
```
```
13
```
```
13
```
```
Returns: 1
```

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.