{"height":"190","title":"SRM398 div1 medium","version":"1.0","author_name":"a_kawashiro","published":"2011-04-29 14:59:03","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","url":"https://a-kawashiro.hatenablog.com/entry/20110429/1304056743","categories":["topcoder"],"blog_url":"https://a-kawashiro.hatenablog.com/","description":"cache[y][x][\u4f55\u500b\u8a2a\u308c\u305f][\u6700\u5f8c\u306b\u8a2a\u308c\u305f\u756a\u53f7]\u3067\u30e1\u30e2\u5316\u518d\u5e30\u3002 #include <cstring> #include <vector> #include <cstdio> using namespace std; int field[60][60]; int cache[60][60][60][60]; class CountPaths { public: int rec(int y,int x,int v,int l) { if(y<1 || x<1 || v<0) return 0; else { int &r=cache[y][x][v][l]; if(r!=-1) ; els\u2026","provider_name":"Hatena Blog","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","width":"100%","image_url":null,"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110429%2F1304056743\" title=\"SRM398 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>","type":"rich"}