斐波拉契数列第n项
#include <iostream>
using namespace std;
int main()
{
int n,i,fibn,f,g;
cin>>n;
f=0;
g=1;
for (i=0;i<n;i++)
{
if(i==0)
{
fibn=0;
}
else if(i>0)
{
fibn=f+g;
f=g;
g=fibn;
}
}
cout<<fibn<<endl;
return 0;
}