Question

VC编程，显示Fibonacci数列的前30项（每行5输出项）。

Answer 1

#include "stdafx.h"
#include <iomanip>
#include<iostream>
using namespace std;

void main()
{

int a=1,b=1,c,i=28;
cout<<setw(10)<<a<<setw(10)<<b;
while(i--)
{
c=a+b;
cout<<setw(10)<<c;
if(i%5==0) cout<<endl;

b=a;
a=c;
}
}
//斐波那契数列有好多算法，如果单是显示，简单地用几个变量就行了

Answer 2

#include<iostream>
#include<fstream>
using namespace std;
long long int Fibonacci( long long int Fibonacci1[],int n)
{
if(n==0)
{
return 0;
}
if(n==1)
{
Fibonacci1[1]=1;
return 1;
}
if(!Fibonacci1[n-1])//若数组该项未计算，即非零，则调用递归计算
return Fibonacci1[n]=Fibonacci(Fibonacci1,n-1)+Fibonacci1[n-2];
else
return Fibonacci1[n-1];
}
void main()
{
int m,n;
char op;
ofstream outfile("input.txt");//创建文本
long long int Fibonacci1[91];
for(int i=0;i<91;i++)
{
Fibonacci1[i]=0;
}
do
{
cout<<"请输入0-90内的一个整数。"<<endl;
cin>>m;
if(m>=0&&m<=90)
{
outfile<<m<<endl;//写入文本
outfile.close();
ifstream infile("input.txt");
infile>>n;//从文本读入数据到程序
infile.close();
cout<< Fibonacci(Fibonacci1,n)<<endl;
break;
}
else
{
cout<<"WRONG!"<<endl;
cout<<" 还想继续吗？（y or n）"<<endl;
cin>>op;
}
}while(op=='y'||op=='Y');
getchar();
getchar();

}
这是我以前写的，能算出每一项，你自己看着怎么输出吧。
这个是在vs2008上写的，6.0不能编译的。

Answer 3

#include <iostream>
using namespace std;

/*!
\param[in] uMax How many numbers will be shown
\param[in] uLineLength Numbers per line
\return true when succeed, false when something is wrong
*/
bool PrintFibonacci(unsigned uMax, unsigned uLineLength);

int main(void)
{
(void)PrintFibonacci(30, 5);

cout<<endl;

return 0;
}

bool PrintFibonacci(unsigned uMax, unsigned uLineLength)
{
unsigned uLeft, uRight, uNum, uCount;

if (uMax == 0 || uLineLength == 0 || uLineLength > 10)
// Arguments problem
return false;

uLeft = 0;
uRight = 0;
uNum = 1;
uCount = 0;

do {
cout<<uNum;

uLeft = uRight;
uRight = uNum;
uNum = uLeft + uRight;

++uCount;
cout<<(((uCount % uLineLength) == 0) ? "\n" : "\t");

if (uNum < uLeft || uNum < uRight)
// Out of range
break;
} while (uCount < uMax);

return uCount == uMax;
}