c/c++实现斐波那契数列

#include <iostream>
using namespace std;
int fibonacci(int n)
{
    int f_twoback = 1;
    int f_oneback = 1;
    int tmp;
    if(1==n || 2==n) return 1;
    else for(int i=3; i<=n; i++)
    {
        tmp = f_twoback + f_oneback;
        f_oneback = f_twoback;
        f_twoback = tmp;
    }
    return tmp;
}
int main()
{
    for(int i=1; i<=8; i++)
        cout << fibonacci(i) << " ";
    return 0;
}