<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>fortran66</author_name>
  <author_url>https://blog.hatena.ne.jp/fortran66/</author_url>
  <blog_title>fortran66のブログ</blog_title>
  <blog_url>https://fortran66.hatenablog.com/</blog_url>
  <categories>
    <anon>ProjectEuler</anon>
  </categories>
  <description>工夫せず素朴に求めます。4バイト整数ではオーバーフローしました。 ソース・プログラム program PEuler014 implicit none integer :: i, k, kk(1e6) integer(8) :: m do i = 1, 1e6 k = 1 m = i do if (mod(m, 2) == 0) then m = m / 2 else m = 3 * m + 1 end if if (m == 1) exit k = k + 1 end do kk(i) = k end do print *, maxloc(kk), ':', maxval(kk) stop e…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Ffortran66.hatenablog.com%2Fentry%2F20121230%2F1356881672&quot; title=&quot;Problem 14 - fortran66のブログ&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2012-12-30 00:34:32</published>
  <title>Problem 14</title>
  <type>rich</type>
  <url>https://fortran66.hatenablog.com/entry/20121230/1356881672</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
