{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110619%2F1308449103\" title=\"SRM331 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>","height":"190","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","author_name":"a_kawashiro","type":"rich","width":"100%","url":"https://a-kawashiro.hatenablog.com/entry/20110619/1308449103","blog_url":"https://a-kawashiro.hatenablog.com/","provider_name":"Hatena Blog","description":"2^10\u306f\u4f7f\u308f\u306a\u304b\u3063\u305f\u3002 #include <algorithm> #include <vector> using namespace std; class Shopping { public: int minNumber(int X, vector <int> values) { sort(values.begin(),values.end()); if(values[0]!=1) { return -1; } else { int r=1; int s; for(s=1;s<X;) { int n=0; while(n+1<values.size() && values[n+1]<=s+1\u2026","version":"1.0","image_url":null,"title":"SRM331 div1 medium","published":"2011-06-19 11:05:03","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","categories":[],"provider_url":"https://hatena.blog"}