<h1 id="heading">题目</h1>
<blockquote>
<h2 id="description">Description</h2>
<blockquote>
<div class='image'><a href='../../data/images/C613-1001-1.jpg' target='_blank' rel='noopener noreferrer'><img src="../../data/images/C613-1001-1.jpg" /></a></div>
ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 11,so it is 1n。ZJiaQ want to put a mook jong in a brick. because of the hands of the mook jong， the distance of two mook jongs should be equal or more than 2 bricks. Now ZJiaQ want to know how many ways can ZJiaQ put mook jongs legally(at least one mook jong).
 
</blockquote>
<h2 id="input">Input</h2>
<blockquote>
There ar multiply cases. For each case, there is a single integer n( 1 &lt; = n &lt; = 60)
</blockquote>
<h2 id="output">Output</h2>
<blockquote>
Print the ways in a single line for each case.
</blockquote>
<h2 id="sample-input">Sample Input</h2>
<blockquote>
1 
2 
3 
4 
5 
6
</blockquote>
<h2 id="sample-output">Sample Output</h2>
<blockquote>
1 
2 
3 
5 
8 
12
</blockquote>
</blockquote>
<h1 id="heading-1">题解</h1>
显然存在规律 
由于相邻的两个需要相邻两格 
因此 <code>dp[i]</code> 和 <code>dp[i-3]</code> 存在关系 
找规律有 <code>dp[i] = dp[i-1] + dp[i-3] + 1</code>
具体证明画图很容易理解
数据有限,打表
<h1 id="heading-2">代码</h1>
<pre style="background-color:#fff">/*
By:OhYee
Github:OhYee
Blog:http://www.oyohyee.com/
Email:oyohyee@oyohyee.com

かしこいかわいい？
エリーチカ！
要写出来Хорошо的代码哦~
*/
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;string&gt;
#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;list&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;map&gt;
#include &lt;set&gt;
#include &lt;functional&gt;
#include &lt;bitset&gt;
using namespace std;

const int maxn = 65;
long long dp[] = {0,1,2,3,5,8,12,18,27,40,59,87,128,188,276,405,594,871,1277,1872,2744,4022,5895,8640,12663,18559,27200,39864,58424,85625,125490,183915,269541,395032,578948,848490,1243523,1822472,2670963,3914487,5736960,8407924,12322412,18059373,26467298,38789711,56849085,83316384,122106096,178955182,262271567,384377664,563332847,825604415,1209982080,1773314928,2598919344,3808901425,5582216354,8181135699,11990037125,17572253480,25753389180,37743426306,55315679787};

bool Do() {
 int n;
 if(!(cin &gt;&gt; n))
 return false;
 cout &lt;&lt; dp[n]&lt;&lt;endl;
 return true;
}

int main() {
 /*
 for(int i = 4;i &lt; 65;i++) {
 dp[i] = dp[i - 1] + dp[i - 3] + 1;
 cout&lt;&lt;dp[i]&lt;&lt;&#34;,&#34;;
 }
 */
 while(Do());
 return 0;
}
</pre>

HDU 5366.The mook jong