{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fnaoyat.hatenablog.jp%2Fentry%2F2017%2F06%2F15%2F112752\" title=\"\u5c0f\u3055\u3044\u6570n\uff08100\u4e07\u307e\u3067\u3068\u304b\uff09\u306e\u7d20\u56e0\u6570\u5206\u89e3 - naoya_t@hatenablog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","version":"1.0","url":"https://naoyat.hatenablog.jp/entry/2017/06/15/112752","provider_name":"Hatena Blog","blog_url":"https://naoyat.hatenablog.jp/","image_url":null,"title":"\u5c0f\u3055\u3044\u6570n\uff08100\u4e07\u307e\u3067\u3068\u304b\uff09\u306e\u7d20\u56e0\u6570\u5206\u89e3","author_name":"n4_t","published":"2017-06-15 11:27:52","author_url":"https://blog.hatena.ne.jp/n4_t/","type":"rich","height":"190","description":"CodeChef\u306e\u30d5\u30a9\u30fc\u30e9\u30e0\u3067 June Challenge 2017\u306e\u554f\u984c Chef and Prime Queries (PRMQ) \u306e\u89e3\u6cd5\u3092\u8aad\u3093\u3067\u3044\u3066 discuss.codechef.com\u7d20\u56e0\u6570\u5206\u89e3\u3092\u3059\u308b\u306e\u306b This can be done by creating a Smallest Prime Factor array in the sieve function itself. \u3068\u3042\u3063\u3066\u3002\u30a8\u30e9\u30c8\u30b9\u30c6\u30cd\u30b9\u306e\u7be9 (Sieve of Eratosthenes) \u3092\u3059\u308b\u3068\u304d\u306b\u3001\u7be9\u3068\u540c\u6642\u306b\u4e00\u756a\u5c0f\u3055\u3044\u7d20\u56e0\u6570\u306e\u30c6\u30fc\u30d6\u30eb\u3092\u4f5c\u3063\u3066\u3057\u307e\u3048\u3070\u7d20\u56e0\u6570\u5206\u89e3\u304c\u7c21\u5358\u3001\u3063\u3066\u3044\u3046\u8a71\u3002","blog_title":"naoya_t@hatenablog","categories":["memo","Algorithms"],"provider_url":"https://hatena.blog"}