C++ 数组求Fibonacci数列

#include
#include
#define N 200
long int F[N];
void Fi(int n);
long int Sum(int n);
void main()
{
int n;
long int sum;
printf("想求少项?请输入:");
scanf("%d",&n);
if(n<=0)
{
printf("输入应于0!\n");
system("pause");
return;
}
Fi(n);
sum=Sum(n);
printf("Fibonacc数列前%d项:%ld\n",n,sum);
system("pause");
}

void Fi(int n)
{
int i=n;
F[0]=F[1]=1;
if(n>2)
for(i=2;i{
F[i]=F[i-1]+F[i-2];
}
printf("Fibonacc数列前%d项:\n",n);
for(i=0;iprintf("%d   ",F[i]);
printf("\n");

}
long int Sum(int n)
{
int i;long int sum=1;
if(n>=2)
sum=2;
if(n>=3)
for(i=2;i{
sum=sum+F[i];
}
return sum;
}
我VC运行确