<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>sugarknri</author_name>
  <author_url>https://blog.hatena.ne.jp/sugarknri/</author_url>
  <blog_title>メモ</blog_title>
  <blog_url>https://sugarknri.hatenablog.com/</blog_url>
  <categories>
  </categories>
  <description>問題はこちら No.533 Mysterious Stairs - yukicoder初期値にちょっと気をつける必要があるがDPやるだけ。 dp[昇った段数合計][直前に段数]=場合の数 dp[1000010][4];n; mod=1000000007; main(){ dp[1][1]=1; dp[2][2]=1; dp[3][1]=dp[3][2]=dp[3][3]=1; scanf(&quot;%d&quot;,&amp;n); for(int i=4;i&lt;=n;i++){ dp[i][1]=(dp[i-1][2]+dp[i-1][3])%mod; dp[i][2]=(dp[i-2][1]+dp[i-2][3])%…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fsugarknri.hatenablog.com%2Fentry%2F2017%2F07%2F23%2F155931&quot; title=&quot;yukicoder No.533 Mysterious Stairs - メモ&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url>http://chart.apis.google.com/chart?cht=tx&amp;chl=%0Aa_n%20%3D%20a_%7Bn-1%7D%20-%20a_%7Bn-2%7D%20%2B%202%2Aa_%7Bn-3%7D%20-%20a_%7Bn-4%7D%20%2B%202%2Aa_%7Bn-5%7D%20%5C%20%5C%20%28n%3E5%29%5C%5C%0Aa_n%20%3D%20a_%7Bn-3%7D%20%2B%20a_%7Bn-4%7D%20%2B%20a_%7Bn-5%7D%20%2B%202%2Aa_%7Bn-6%7D%20%5C%20%5C%20%28n%3E6%29%0A</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2017-07-23 15:59:31</published>
  <title>yukicoder No.533 Mysterious Stairs</title>
  <type>rich</type>
  <url>https://sugarknri.hatenablog.com/entry/2017/07/23/155931</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
