{"provider_name":"Hatena Blog","url":"https://boxnos.hatenablog.com/entry/20080528/1211962484","categories":["C++","TopCoder"],"provider_url":"https://hatena.blog","published":"2008-05-28 17:14:44","image_url":null,"title":" SRM 162 DIV2 Level One - \u6700\u5c0f\u516c\u500d\u6570","width":"100%","blog_title":"\u30dc\u30af\u30ce\u30b9","description":"C++\u3067\u306f\u3042\u3093\u307e\u308a\u89e3\u304d\u305f\u304f\u306a\u3044\u554f\u984c\u3002 4,5,6\u3068\u304b\u7bc4\u56f2\u304c\u4e0e\u3048\u3089\u308c\u308b\u306e\u3067\u3001\u6700\u5c0f\u516c\u500d\u6570\u3092\u6c42\u3081\u308b\u3002 #include <vector> using namespace std; class LCMRange { public: static int lcm(int first, int last) { vector<int> numbers; int acc = 1; for (int i = first; i <= last; i++) numbers.push_back(i); for (int i = 0; i < numbers.size(); i++) { for(int j = i +\u2026","type":"rich","version":"1.0","height":"190","author_url":"https://blog.hatena.ne.jp/tanakaBox/","author_name":"tanakaBox","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fboxnos.hatenablog.com%2Fentry%2F20080528%2F1211962484\" title=\" SRM 162 DIV2 Level One - \u6700\u5c0f\u516c\u500d\u6570 - \u30dc\u30af\u30ce\u30b9\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_url":"https://boxnos.hatenablog.com/"}