{"height":"190","provider_url":"https://hatena.blog","author_name":"a_kawashiro","version":"1.0","type":"rich","url":"https://a-kawashiro.hatenablog.com/entry/20110508/1304861596","published":"2011-05-08 22:33:16","image_url":null,"categories":["topcoder"],"width":"100%","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110508%2F1304861596\" title=\"SRM439 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>","provider_name":"Hatena Blog","description":"\u30e1\u30e2\u5316\u518d\u5e30\u3002 \u96e3\u3057\u304f\u3066\u89e3\u8aac\u307f\u305f\u3002 #include <string> #include <vector> #include <cstdio> #include <cstring> using namespace std; typedef long long LL; LL DP[(1<<13)][2][15][15]; class PalindromePhrases { public: int n; vector<string> words; bool isPalindome(string s) { for(int i=0;i<s.size();i++) if(s[i]!=s[s.size()-\u2026","title":"SRM439 div1 medium","blog_url":"https://a-kawashiro.hatenablog.com/","author_url":"https://blog.hatena.ne.jp/a_kawashiro/"}