c++ 非递归
include[HTML_REMOVED]
using namespace std;
const int N = 9999;
int arr[N];
int main() {
long n;
cin>>n;
int i = 0;
arr[0] = 0; arr[1] = 1; arr[2] = 1;
for (i = 0; i < n; i++) {
if(i < 3) {
cout<<arr[i]<<" ";
} else {
arr[i] = arr[i-1] + arr[i-2];
cout<<arr[i]<<" ";
}
}
return 0;
}