One book 1201 Fibonacci sequence

Original link http://ybt.ssoier.cn:8088/problem_show.php?pid=1201

【 Title Description 】

  Fibonacci sequence refers to such a sequence : The first and second numbers of the sequence are 1, Next, each number is equal to the front 2 Sum of numbers .

Give a positive integer a, Request the... In Fibonacci sequence a What's the number .

【 Input 】

The first 1 Row is the number of groups of test data n, Follow behind n Line input . Each group of test data accounts for 1 That's ok , Include a positive integer a(1<=a<=20).

【 Output 】

The output is n That's ok , Each line of output corresponds to an input . The output should be a positive integer , It is the... In Fibonacci sequence a The size of the number .

【 sample input 】

4
5
2
19
1

【 sample output 】

5
1
4181
1

Examine the subject

Fibonacci number one a Item equal to a-1 Add item a-2 term . Just recursively find the first two items .

step

1. Define recursive call function

int f(int x)
{
    if(x==1 || x==2) return 1;// The values of the first and second terms are 1
    else return f(x-1)+f(x-2); // Recursively call 
}

2. The main function

int main()
{
    cin>>n;// share n Group 
    while(n--)// Repeat input 
    {
        cin>>a; 
        cout<<f(a)<<endl;// Please a Item value 
    }
    return 0;
}

Complete code

#include<iostream>
using namespace std;
int a,n;
int f(int x)
{
    if(x==1 || x==2) return 1;// The values of the first and second terms are 1
    else return f(x-1)+f(x-2); // Recursively call 
}
int main()
{
    cin>>n;// share n Group 
    while(n--)// Repeat input 
    {
        cin>>a; 
        cout<<f(a)<<endl;// Please a Item value 
    }
    return 0;
}

Novice , Your advice are most welcome