/*author: emil jonson
* function: 输出斐波那契数列
* edition: 1.0.0
*/
#include<assert.h>
#include <iostream>
using namespace std;
/*
* input: 数列元素个数
×return: 无返回,直接输出数列各元素
*/
void fibo(unsigned int num )
{
assert(num >= 2); //保证初始数列元素
unsigned long int *fibon = new unsigned long int[num]; //给数列数组分配空间
fibon[0] = 0;
fibon[1] = 1;
int i;
for( i = 2; i < num; i++ ) //数列赋值
fibon[i] = fibon[i-2]+fibon[i-1];
for( int j = 0; j < i; j++ ) //输出数列
cout<<fibon[j]<<endl;
}
int main()
{
unsigned int count;
cout<<"数列中的元素个数:"<<'/n';
cin>>count;
fibo(count);
system("pause");
}