{"url":"https://kmjp.hatenablog.jp/entry/2026/04/12/1030","version":"1.0","description":"\u4e2d\u76e4\u3048\u3089\u304f\u624b\u9593\u53d6\u3063\u3066\u308b\u56de\u3002 https://codeforces.com/contest/1154/problem/G","categories":["Codeforces"],"height":"190","width":"100%","author_url":"https://blog.hatena.ne.jp/kmjp/","author_name":"kmjp","provider_url":"https://hatena.blog","published":"2026-04-12 10:30:00","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkmjp.hatenablog.jp%2Fentry%2F2026%2F04%2F12%2F1030\" title=\"Codeforces #552: Div3. G. Minimum Possible LCM - kmjp&#39;s blog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","type":"rich","title":"Codeforces #552: Div3. G. Minimum Possible LCM","blog_url":"https://kmjp.hatenablog.jp/","image_url":null,"blog_title":"kmjp's blog","provider_name":"Hatena Blog"}