{"provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","author_name":"a_kawashiro","description":"\u6570\u5b66\u3002\u5199\u3057\u305f\u3002 #include <vector> #include <algorithm> #include <list> using namespace std; class SmoothNumbersHard { public: int countSmoothNumbers(int n, int k) { vector<int> p(n+1,0); for(int i=2;i<=n;i++) if(!p[i]) for(int j=i;j<=n;j+=i) p[j]=i; int ans=0; for(int i=1;i<=n;i++) if(p[i]<=k) ans++; return\u2026","width":"100%","provider_name":"Hatena Blog","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","height":"190","image_url":null,"url":"https://a-kawashiro.hatenablog.com/entry/20110224/1298557714","published":"2011-02-24 23:28:34","blog_url":"https://a-kawashiro.hatenablog.com/","categories":["topcoder"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110224%2F1298557714\" title=\"SRM388 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>","title":"SRM388 div2 hard","type":"rich","version":"1.0"}