SP26781 ESYRCRTN - Why Always Recursion
Description
- F(1) = 1
- F(2) = 3
- F(N) = F(N-1) - F(N-2)
Now you are given N, you have to find the value of F(1) + F(2) + ... + F(N).
Input Format
Input starts with an integer T (1
Output Format
For each test case, print the value.