{"published":"2012-07-10 06:58:20","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftech-blog.pocket7878.com%2Fentry%2F20120710%2F1341871100\" title=\"ICPC2011ProblemA - Let&#39;s write \u03b2\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_name":"Pocket7878_dev","description":"\u30c1\u30a7\u30d3\u30b7\u30a7\u30d5\u306e\u5b9a\u7406 (defun sieve-of-erathostenes (num) (let ((sieve (make-array num :initial-element 1))) (setf (aref sieve 0) 0) (loop for i from 1 upto (sqrt num) when (= 1 (aref sieve i)) do (loop for j from (1+ i) until (> (* (1+ i) j) num) do (setf (aref sieve (1- (* (1+ i) j))) 0))) sieve)) (defun count\u2026","url":"https://tech-blog.pocket7878.com/entry/20120710/1341871100","version":"1.0","width":"100%","categories":["Lisp","ICPC"],"author_url":"https://blog.hatena.ne.jp/Pocket7878_dev/","provider_url":"https://hatena.blog","blog_title":"Let's write \u03b2","type":"rich","provider_name":"Hatena Blog","height":"190","blog_url":"https://tech-blog.pocket7878.com/","title":"ICPC2011ProblemA","image_url":null}