Problems Description
<p> The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55...} are defined by the recurrence: <br /> F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2 <br /> Write a program to calculate the Fibonacci Numbers. </p>
Input格式
<p> Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。 </p>
Output格式
<p> For each case, print a number Fn on a separate line,which means the nth Fibonacci Number. </p>
Sample
Sample Input 1
1
Sample Output 1
1
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪