Problems Description
<p class="p0"> <br /> </p> <p class="p0"> 小明刚刚看完电影《Page <span>39</span><span>级台阶》,离开电影院的时候,他数了数礼堂前的台阶数,恰好是</span><span>39</span><span>级</span><span>! </span><span>站在台阶前,他突然又想着一items问题: 如果我每一步只能迈上</span><span>1</span><span>items或</span><span>2</span><span>items台阶。先迈左脚,然后左右交替,最后一步是迈右脚,也就是说一Total要走偶数步。那么,上完</span><span>39</span><span>级台阶,有多少种不同的上法呢?从键盘输入给定一items</span><span>n</span><span>(</span><span>n<=39</span><span>),表示几阶台阶,编程计算并输出种类的数目。</span> </p> <span></span> <p> <br /> </p>
Input格式
<p class="p0"> 1<span>items数</span><span>n</span><span>(</span><span>n<=39</span><span>),表示几阶台阶。</span> </p>
Output格式
51167078
Sample
Sample Input 1
39
Sample Output 1
51167078
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪