{"author_url":"https://blog.hatena.ne.jp/fortran66/","provider_name":"Hatena Blog","blog_url":"https://fortran66.hatenablog.com/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ffortran66.hatenablog.com%2Fentry%2F20121227%2F1356631840\" title=\"problem 010 - fortran66\u306e\u30d6\u30ed\u30b0\" 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","version":"1.0","categories":["ProjectEuler"],"description":"\u7d20\u6570\u306e\u7dcf\u548c\u306f\uff14\u30d0\u30a4\u30c8\u6574\u6570\u304b\u3089\u30aa\u30fc\u30d0\u30fc\u30d5\u30ed\u30fc\u3057\u3066\u3057\u307e\u3044\u307e\u3057\u305f\u3002 \u30bd\u30fc\u30b9\u30fb\u30d7\u30ed\u30b0\u30e9\u30e0 program PEuler010 implicit none print *, sum( int(ieratos(2 * 10**6), kind = 8) ) ! int4 overflow stop contains function ieratos(n) ! thieve of Eratostenes integer, intent(in) :: n integer, allocatable :: ieratos(:) logical :: tab(n) integer :: i tab = .true.\u2026","blog_title":"fortran66\u306e\u30d6\u30ed\u30b0","published":"2012-12-27 03:10:40","provider_url":"https://hatena.blog","url":"https://fortran66.hatenablog.com/entry/20121227/1356631840","title":"problem 010","image_url":null,"height":"190","author_name":"fortran66","width":"100%"}