{"provider_name":"Hatena Blog","blog_title":"mayoko\u2019s diary","type":"rich","published":"2016-04-30 00:30:00","description":"\u554f\u984c No.368 LCM of K-products - yukicoder \u89e3\u6cd5 \u6700\u5c0f\u516c\u500d\u6570\u306f, \u5404\u7d20\u56e0\u6570\u304c\u6700\u5927\u306e\u3082\u306e\u3092\u7d44\u307f\u5408\u308f\u305b\u305f\u3082\u306e\u306b\u306a\u308a\u307e\u3059\u3002\u3088\u3063\u3066, \u5404\u7d20\u56e0\u6570\u3092\u8abf\u3079\u3066, p \u306e\u7d20\u56e0\u6570\u3092\u8003\u3048\u308b\u5834\u5408\u306f p \u306e\u6307\u6570\u304c\u591a\u3044\u9806\u306b K \u500b\u53d6\u3063\u3066\u304f\u308b, \u3068\u3044\u3046\u3088\u3046\u306b\u3084\u308c\u3070 OK \u3067\u3059\u3002 const int MAXN = 1010; int A[MAXN]; map<int, vi> mp; void calc(int x, map<int, int>& M) { for (int i = 2; i*i <= x; i++) { int cnt = 0; while (x%i == 0) { x \u2026","categories":[],"url":"https://mayokoex.hatenablog.com/entry/2016/04/30/003000","author_url":"https://blog.hatena.ne.jp/mayokoex/","width":"100%","image_url":null,"version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmayokoex.hatenablog.com%2Fentry%2F2016%2F04%2F30%2F003000\" title=\"yukicoder No.368 LCM of K-products - mayoko\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_url":"https://hatena.blog","title":"yukicoder No.368 LCM of K-products","blog_url":"https://mayokoex.hatenablog.com/","author_name":"mayokoex","height":"190"}