裴波那切數列（2）

#include
using namespace std;
void main() {
int a[1000][200];
memset(a, 0, sizeof(a));
a[0][0] = a[1][0] = 1;
int n,ans;
while (getchar() != EOF)//輸入1進入，CTRL+Z結束
{
cout << "輸入大小；";
cin >> n;
for (int i = 2; i < n; i++) {
int c = 0;
for (int j = 0; j < 200; j++) {
ans = a[i - 1][j] + a[i - 2][j] + c;
c = ans / 100000000;
a[i][j] = ans % 100000000;
}
}
int j = 199;
while (!a[n - 1][j]) {
j--;
}
for (; j >= 0; j--) {
cout << a[n - 1][j];
}
putchar('\n');
}
}