GO Solution For UVa 10183 - How Many Fibs?. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

Recall the definition of the Fibonacci numbers:

f1 := 1

f2 := 2

fn := fn−1 + fn−2 (n ≥ 3)

Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].

Input The input contains several test cases. Each test case consists of two non-negative integer numbers a and b. In

...

You can find the full details of the problem How Many Fibs? at UVa Online Judge

Sample Input

0 1
1 1
10 100
1234567890 9876543210
0 0

Sample Output

1
1
5
4

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985