题目描述
<p class="p0"> 3 = 2+1 = 1+1+1 共<span>三种拆法 </span> </p> <p class="p0"> 4 = 3 + 1 = 2 + 2 = 2 + 1 + 1 = 1 + 1 + 1 + 1 <span>共五种拆法</span> </p> <p class="p0"> 5 = 4 + 1 = 3 + 2 = 3 + 1 + 1 = 2 + 2 + 1 = 2 + 1 + 1 + 1 = 1 + 1 +1 +1 +1 <span>共七种拆法</span> </p> <p class="p0"> 依此类推,请问一个从键盘输入的<span>n</span><span>值(</span><span>2<n<100</span><span>)拆解方法有多少种?</span> </p>
输入格式
<p class="p0"> 1<span>个数</span><span>n</span><span>。表示要拆解的数字。</span> </p>
输出格式
<p class="p0"> 1<span>个数。表示拆解方法的个数。</span> </p>
样例
样例输入 1
10
样例输出 1
42
提交代码
请先登录后提交
🤖 AI 解题助手
DeepSeek
就绪