1-2 Fibonacci sequence
来源:互联网 发布:linux内核开发流程 编辑:程序博客网 时间:2024/04/30 22:55
题目描述:输入一个整数N,输出斐波那契数列的前N项。
#include <cstdio>void R(int f1, int f2, int k);int N;int main() { scanf("%d", &N); printf("F(1)=1\nF(2)=1\n"); R(1, 1, 3); return 0;}void R(int f1, int f2, int k) { if(k == N+1) { return; } else { printf("F(%d)=%d\n", k, f1+f2); R(f2, f1+f2, k+1); } return;}
p.s.:全局变量最好用大写字母,局部变量最好用小写字母,易于区分,不易混淆。
0 0
- 1-2 Fibonacci sequence
- fibonacci sequence
- Fibonacci Sequence
- Fibonacci sequence
- Fibonacci sequence
- SZ Fibonacci Sequence
- JZOJ1240. Fibonacci sequence
- JZOJ 1240. Fibonacci sequence
- JZOJ.1240. Fibonacci sequence
- Sicily 1779 Fibonacci Sequence Multiplication
- Fibonacci sequence of k order
- 斐波纳契数列(Fibonacci Sequence)
- A Problem With Fibonacci Sequence
- Sicily 1779. Fibonacci Sequence Multiplication
- LintCode算法题:Fibonacci Sequence
- ural 1133. Fibonacci Sequence math
- Javaの算法之Fibonacci Sequence
- LeetCode - Fibonacci Sequence/Dynamic Programming - Climbing Stairs
- 【第四章】 资源 之 4.3 访问Resource ——跟我学spring3
- 信号量的初始值
- linux驱动中的等待队列头
- UVa - 156 Ananagrams(STL)
- 关于Ping和Tracert命令原理详解
- 1-2 Fibonacci sequence
- UVa - 10474 Where is the Marble?(STL)
- Android开发本地及网络Mp3音乐播放器(十五)网络音乐及歌词下载功能实现
- UVa - 10815 Andy's First Dictionary(STL)
- linux的内核定时器
- poj 1692 Crossed Matchings(DP)
- pull解析
- web前端题目集锦
- ipcs 查询进程间通信状态