{"author_name":"fortran66","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ffortran66.hatenablog.com%2Fentry%2F20121227%2F1356618768\" title=\"problem 003 - 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>","blog_title":"fortran66\u306e\u30d6\u30ed\u30b0","provider_name":"Hatena Blog","height":"190","author_url":"https://blog.hatena.ne.jp/fortran66/","image_url":null,"type":"rich","url":"https://fortran66.hatenablog.com/entry/20121227/1356618768","title":"problem 003","version":"1.0","categories":["ProjectEuler"],"blog_url":"https://fortran66.hatenablog.com/","width":"100%","description":"\u30bd\u30fc\u30b9\u30fb\u30d7\u30ed\u30b0\u30e9\u30e0 program PEuler3 implicit none integer, parameter :: ki = selected_int_kind(12) integer(ki), parameter :: nx = 600851475143 !13195 integer, allocatable :: iptab(:) iptab = ieratos( int(sqrt(real(nx))) ) ! prime numbers up to possible max factor !print '(a, *(i8))', 'factors ', pack(iptab, m\u2026","published":"2012-12-27 23:32:48"}