[UVA][循環節] 12620 - Fibonacci Sum
A - Fibonacci Sum
Background
A Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1.
f (1) = 1; f (2) = 1; f (n > 2) = f (n - 1) + f (n - 2)
The Problem
...
