{"provider_name":"Hatena Blog","title":"SRM403 div2 hard","width":"100%","blog_url":"https://a-kawashiro.hatenablog.com/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110318%2F1300432280\" title=\"SRM403 div2 hard - 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>","height":"190","image_url":null,"categories":["topcoder"],"published":"2011-03-18 16:11:20","version":"1.0","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","description":"\u4e38\u5199\u3057\u4e0a\u7b49\uff01 \u30fb\u30fb\u30fb\u30fb\u30fb\u30fb\u30fb\u89e3\u3051\u3078\u3093\u304b\u3063\u305f #include <algorithm> #include <utility> #include <vector> #define INF (1<<29) using namespace std; class TheSumOfLuckyNumbers { public: int DP[1000000+1]; bool isLucky(int n) { while(0<n) if(n%10!=4 && n%10!=7) return false; else n/=10; return true; } vector <int> sum(int n) { \u2026","url":"https://a-kawashiro.hatenablog.com/entry/20110318/1300432280","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","type":"rich","author_name":"a_kawashiro","provider_url":"https://hatena.blog"}