斐波那契数列 前40位

#include <bits/stdc++.h>
using namespace std;

int main() {
	int a[40];
	a[0] = 0;
	a[1] = 1;
	for (int i = 2; i < 40; i++)
		a[i] = a[i - 1] + a[i - 2];
	cout << a[0] << " ";
	for (int i = 1; i < 40; i++) {
		cout << a[i] << " ";
		if (i % 10 == 0)
			cout << endl;
	}
	return 0;
}