#include<cstdio>
#include<algorithm>
using namespace std;
#define n 40
int fib[100];
void so_fib(){
fib[0] = 1;
fib[1] = 1;
for(int i=2;i<n;i++){
fib[i] = fib[i-1] + fib[i-2];
}
for(int i=0;i<n;i++){
printf("%-10d",fib[i]);
if(i%10==9) printf("\n");
}
}
int main() {
so_fib();
return 0;
}
输出:
1 1 2 3 5 8 13 21 34 55
89 144 233 377 610 987 1597 2584 4181 6765
10946 17711 28657 46368 75025 121393 196418 317811 514229 832040
1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986 102334155