{"author_name":"fortran66","image_url":null,"blog_url":"https://fortran66.hatenablog.com/","version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ffortran66.hatenablog.com%2Fentry%2F20121227%2F1356625775\" title=\"problem 007 - 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>","categories":["ProjectEuler"],"type":"rich","description":"\u30ac\u30a6\u30b9\u306e\u7d20\u6570\u5b9a\u7406\u306b\u3088\u3063\u3066\u5927\u4f53\u306e\u5024\u306e\u898b\u5f53\u3092\u3064\u3051\u3066\u305d\u3053\u307e\u3067\u306e\u7d20\u6570\u3092\u3084\u3084\u5927\u76ee\u306b\u6c42\u3081\u307e\u3059\u3002 \u30bd\u30fc\u30b9\u30fb\u30d7\u30ed\u30b0\u30e9\u30e0 program PEuler007 implicit none integer, parameter :: np = 10001 integer, allocatable :: iptab(:) integer :: n ! np ~ n / log(n) ! approximate number of primes less than n : Gauss ! approximate np-th prime n ~ np * log(n) ~ np * log( np * log(n) ) \u2026","width":"100%","height":"190","url":"https://fortran66.hatenablog.com/entry/20121227/1356625775","title":"problem 007","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/fortran66/","blog_title":"fortran66\u306e\u30d6\u30ed\u30b0","provider_name":"Hatena Blog","published":"2012-12-27 01:29:35"}