1978 Fibonacci Series 3, Fibonacci Series

1978 Fibonacci Series 3, Fibonacci Series
1978 Fibonacci Series 3

 

Time Limit: 1 s space limit: 64000 KB title level: BronzeQuestionDescriptionDescription

The Fibonacci series is like this:

F1 = 1

F2 = 1

F3 = 2

F4 = 3

....

Fn = fn-1 + fn-2

 

Enter an integer n.

Fn

Input descriptionInput Description

An integer n, n <= 40

Output descriptionOutput Description

An integer fn

Sample InputSample Input

3

Sample outputSample Output

2

Data range and promptData Size & Hint

N <= 40

1 #include <iostream>
  2 using namespace std;
  3 int fei (int n)
  4 {
  5 if (n == 1 || n == 2) return 1;
  6 else return fei (n-1) + fei (n-2);
  7}
  8 int main ()
  9 {
10 int n;
11 cin >> n;
12 cout << fei (n);
13 return 0;
14}