QOJ.ac

QOJ

حد الوقت: 1 s حد الذاكرة: 32 MB مجموع النقاط: 10 الصعوبة: [عرض]

#13510. 斐波那契数

تم استخدام هذه المسألة في المسابقات التالية:

Pogromcy Algorytmow 2003, Runda Próbna

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

斐波那契数定义如下：

$fib(0) = 0$
$fib(1) = 1$
对于 $n \ge 2$，$fib(n) = fib(n-1) + fib(n-2)$

编写一个程序：

从标准输入读取一个整数 $n$，
计算第 $n$ 个斐波那契数（$fib(n)$），
将其输出到标准输出。

输入格式

标准输入的第一行也是唯一的一行包含一个整数 $n$（$0 \le n \le 40$）。

输出格式

程序应向标准输出写入一个整数，表示 $fib(n)$ 的值。

样例

输入格式 1

输出格式 1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.