Fibonacci数列形如:0,1,1,2,3,5,8,13,21,….求Fibonacci数列的前n项.(1)提示用户输入n;(2)每行输出10项.初学者,简单的c++程序
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/06 21:06:03
![Fibonacci数列形如:0,1,1,2,3,5,8,13,21,….求Fibonacci数列的前n项.(1)提示用户输入n;(2)每行输出10项.初学者,简单的c++程序](/uploads/image/z/1115968-40-8.jpg?t=Fibonacci%E6%95%B0%E5%88%97%E5%BD%A2%E5%A6%82%EF%BC%9A0%2C1%2C1%2C2%2C3%2C5%2C8%2C13%2C21%2C%E2%80%A6.%E6%B1%82Fibonacci%E6%95%B0%E5%88%97%E7%9A%84%E5%89%8Dn%E9%A1%B9.%281%29%E6%8F%90%E7%A4%BA%E7%94%A8%E6%88%B7%E8%BE%93%E5%85%A5n%EF%BC%9B%282%29%E6%AF%8F%E8%A1%8C%E8%BE%93%E5%87%BA10%E9%A1%B9.%E5%88%9D%E5%AD%A6%E8%80%85%2C%E7%AE%80%E5%8D%95%E7%9A%84c%2B%2B%E7%A8%8B%E5%BA%8F)
Fibonacci数列形如:0,1,1,2,3,5,8,13,21,….求Fibonacci数列的前n项.(1)提示用户输入n;(2)每行输出10项.初学者,简单的c++程序
Fibonacci数列形如:0,1,1,2,3,5,8,13,21,….求Fibonacci数列的前n项.
(1)提示用户输入n;
(2)每行输出10项.
初学者,简单的c++程序
Fibonacci数列形如:0,1,1,2,3,5,8,13,21,….求Fibonacci数列的前n项.(1)提示用户输入n;(2)每行输出10项.初学者,简单的c++程序
#include
using namespace std;
int main(){
\x05unsigned int n;
\x05int result=1;
int a1=-1,a2;
\x05coutn;
\x05cout
//程序调试通过
#include
using namespace std;
int main()
{
int N,fib;
int fib1=0,fib2=1,n=0;
cout<<"输入一个正整数:";
cin>>N;
while(++n<=N)
{
if(n<=2)
全部展开
//程序调试通过
#include
using namespace std;
int main()
{
int N,fib;
int fib1=0,fib2=1,n=0;
cout<<"输入一个正整数:";
cin>>N;
while(++n<=N)
{
if(n<=2)
{
if(n==1)
fib=fib1;
else
fib=fib2;
}
else
{
fib=fib1+fib2;
fib1=fib2;
fib2=fib;
}
cout<
cout<
cout<
}
收起