C++用数组的方法求Fibonacci数列的第n项

2025-02-23 06:51:13
推荐回答(2个)
回答(1):

#include
using namespace std;
int main(void)
{
int n,i,*fib;
cin>>n;
if(n==1||n==2)
cout<<"第"< else
{
fib=new int[n];
fib[0]=fib[1]=1;
for(i=2;i fib[i]=fib[i-2]+fib[i-1];
for(i=0;i cout<<"第"< delete[] fib;
}
return 0;
}

回答(2):

/*用数组的方法求Fibonacci数列的第n项*/
#include
using namespace std;
int main(void)
{
int n,i,*fib;
cin>>n;
if(n==1||n==2)
cout<<"第"< else
{
fib=new int[n];
fib[0]=fib[1]=1;
for(i=2;i fib[i]=fib[i-2]+fib[i-1];
for(i=0;i cout<<"第"< delete[] fib;
}
return 0;
}