{"image_url":null,"author_name":"fortran66","height":"190","url":"https://fortran66.hatenablog.com/entry/20121227/1356618957","version":"1.0","blog_title":"fortran66\u306e\u30d6\u30ed\u30b0","title":"problem 005","type":"rich","categories":["ProjectEuler"],"author_url":"https://blog.hatena.ne.jp/fortran66/","published":"2012-12-27 23:35:57","provider_name":"Hatena Blog","provider_url":"https://hatena.blog","description":"\u30bd\u30fc\u30b9\u30fb\u30d7\u30ed\u30b0\u30e9\u30e0 program PEuler5 implicit none integer, parameter :: n = 20 integer, allocatable :: itab(:), ipow(:) integer :: k itab = ieratos(n) ipow = log(real(n)) / log(real(itab)) ! max prime power print *, product(itab**ipow) ! lcm stop contains function ieratos(n) ! thieve of Eratostenes integer, i\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ffortran66.hatenablog.com%2Fentry%2F20121227%2F1356618957\" title=\"problem 005 - 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_url":"https://fortran66.hatenablog.com/","width":"100%"}