求fibonacci数列的前12项的C语言代码
时间: 2024-02-22 21:57:23 浏览: 83
以下是求Fibonacci数列前12项的C语言代码:
```c
#include <stdio.h>
int main() {
int n1 = 0, n2 = 1, nextTerm, i;
printf("Fibonacci Series: ");
for (i = 1; i <= 12; ++i) {
printf("%d, ", n1);
nextTerm = n1 + n2;
n1 = n2;
n2 = nextTerm;
}
return 0;
}
```
输出结果如下:
```
Fibonacci Series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,
```
相关问题
fibonacci数列前30项c语言代码
以下是斐波那契数列前30项的C语言代码:
```c
#include <stdio.h>
int main() {
int n = 30, i;
long long fib[30];
fib[0] = 0;
fib[1] = 1;
for (i = 2; i < n; i++) {
fib[i] = fib[i-1] + fib[i-2];
}
printf("斐波那契数列前30项为:\n");
for (i = 0; i < n; i++) {
printf("%lld ", fib[i]);
}
return 0;
}
```
输出结果:
```
斐波那契数列前30项为:
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
```
用一堆数组求斐波那契数列前20项C语言方式
以下是用数组求斐波那契数列前20项的C语言代码:
#include <stdio.h>
int main() {
int fib[20];
fib[0] = 0;
fib[1] = 1;
for (int i = 2; i < 20; i++) {
fib[i] = fib[i-1] + fib[i-2];
}
for (int i = 0; i < 20; i++) {
printf("%d ", fib[i]);
}
return 0;
}