Sequence of fiber nacci (recursive method)

[Cpp]
/*
* Copyright and version Declaration of the program
* Copyright (c) 2012, a student from the computer College of Yantai University
* All rightsreserved.
* File name: maid. cpp
* Author: Li Meng
* Completion date: January 1, November 25, 2012
* Version: v1.0
* // Www.heatpress123.net
* Input Description: None
* Problem description: The number of 20th output fiber nacci sequences, such as 0, 1, 2, 3, 5, 8...
* Program output: the number of 20th entries in the finacci Sequence
* Problem Analysis: Recursive Method
*/
# Include <iostream>
Using namespace std;
Int fib (int n );
Int main ()
{
Cout <fib (20) <endl;
Return 0;
}
Int fib (int n)
{
If (n = 1)
Return 0;
Else if (n = 2)
Return 1;
Else
Return fib (n-1) + fib (n-2 );
}