编辑这个页面须要登录或更高权限!
在此示例中,您将学习显示前n个数字的斐波那契数列(由用户输入)。
要理解此示例,您应该了解以下C语言编程主题:
斐波那契数列是下一个项是前两个项之和的序列。 斐波那契数列的前两个项是0,然后是1。
The Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21
#include <stdio.h> int main() { int i, n, t1 = 0, t2 = 1, nextTerm; printf("Enter the number of terms: "); scanf("%d", &n); printf("斐波纳契数列: "); for (i = 1; i <= n; ++i) { printf("%d, ", t1); nextTerm = t1 + t2; t1 = t2; t2 = nextTerm; } return 0; }
输出结果
Enter the number of terms: 10 斐波纳契数列: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,
#include <stdio.h> int main() { int t1 = 0, t2 = 1, nextTerm = 0, n; printf("Enter a positive number: "); scanf("%d", &n); //显示前两个项,始终为0和1 printf("Fibonacci Series: %d, %d, ", t1, t2); nextTerm = t1 + t2; while (nextTerm <= n) { printf("%d, ", nextTerm); t1 = t2; t2 = nextTerm; nextTerm = t1 + t2; } return 0; }
输出结果
Enter a positive integer: 100 Fibonacci Series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,