斐波那契数列
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
说明
斐波那契数列: 0, 1, 1, 2, 3, 5, 8,13,21,34,55,… ，从第三项起，每一项都是紧挨着的前两项的各。用递归程序求斐波那契数列的任意一项。输入格式
一个整数：所求的基数n (1<=n<=35)输出格式
一个整数：第n项数据的值。10
34
来源
基础题-4. 递归 洛谷2025-11-16周训练
- Status
- Done
- Rule
- XCPC
- Problem
- 7
- Start at
- 2025-11-16 14:15
- End at
- 2025-11-16 17:15
- Duration
- 3 hour(s)
- Host
-
xinling
- Partic.
- 26