斐波那契数列第N项

#include<stdio.h>
int FibonacciSequence(int n)
{
	int f1=1;
	int f2=1;
	int f3=1;
	for(int i=3;i<=n;i++)
	{
		f3=f1+f2;
		f1=f2;
		f2=f3;
	}
	return f3;
}

int main()
{
	for(int i=1;i<7;i++)
	printf("第%d项为%d\n",i,FibonacciSequence(i));
   return 0;
}