{"height":"190","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","provider_name":"Hatena Blog","url":"https://a-kawashiro.hatenablog.com/entry/20110430/1304144798","image_url":null,"categories":["topcoder"],"blog_url":"https://a-kawashiro.hatenablog.com/","width":"100%","author_name":"a_kawashiro","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110430%2F1304144798\" title=\"SRM484 div1 medium - a_kawashiro\u306e\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","description":"\u89e3\u8aac\u898b\u307e\u3057\u305f\u3002 Login - TopCoder Wiki class PuyoPuyo { public: int theCount(int L, int N) { memset(DP,0,sizeof(DP)); DP[0][0]=1; for(int i=0;i<N;i++) { DP[i+1][L-1]=(DP[i+1][L-1]+4*DP[i][0])%1000000007; for(int j=1;j<N;j++) { DP[i+1][j+L-1]=(DP[i+1][j+L-1]+3*DP[i][j])%1000000007; DP[i+1][j-1]=(DP[i+1][j-1]+\u2026","title":"SRM484 div1 medium","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","published":"2011-04-30 15:26:38","version":"1.0","provider_url":"https://hatena.blog"}