C++ Solution For UVa Problem: Fibonacci Freeze - 495.cpp
495.cpp, C++ Solution of problem: UVa 495 - Fibonacci Freeze. In this post we will see how we can solve this challenge in C++ for UVa Online Judge.
The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence:
F0 = 0
F1 = 1
Fi = Fi−1 + Fi−2 for all i ≥ 2
Write a program to calculate the Fibonacci Numbers.
Input The input to your program would be a sequence of numbers smaller or equal than 5000, each on a separate line, specifying which Fibonacci number to calculate.
Output Your program should output the...
You can find the full details of the problem Fibonacci Freeze at UVa Online Judge
Solution: Please check the 495.cpp snippet for the solution.
Solution originally posted at: Github by @SITZ