{"url":"https://fortran66.hatenablog.com/entry/20121227/1356615709","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ffortran66.hatenablog.com%2Fentry%2F20121227%2F1356615709\" title=\"problem 001 - 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/","version":"1.0","height":"190","image_url":null,"categories":["ProjectEuler"],"published":"2012-12-27 22:41:49","title":"problem 001","provider_name":"Hatena Blog","blog_title":"fortran66\u306e\u30d6\u30ed\u30b0","width":"100%","description":"\u3042\u3093\u307e\u308a\u3084\u308b\u6c17\u3082\u3057\u306a\u3044\u304c\u3001\u305f\u307e\u306b\u6687\u3064\u3076\u3057\u306b\u3002 http://projecteuler.net/ \u30bd\u30fc\u30b9\u30fb\u30d7\u30ed\u30b0\u30e9\u30e0 program PEuler1 implicit none integer, parameter :: nn = 1000 - 1 integer :: i, num(nn) num = [(i, i = 1, nn)] print *, sum(num, mask = mod(num, 3) == 0 .or. mod(num, 5) == 0) stop end program PEuler1 \u5b9f\u884c\u7d50\u679c 233168 \u7d9a\u884c\u3059\u308b\u306b\u306f\u4f55\u304b\u30ad\u30fc\u3092\u62bc\u3057\u3066\u304f\u3060\u3055\u3044 . . .","provider_url":"https://hatena.blog","author_name":"fortran66","author_url":"https://blog.hatena.ne.jp/fortran66/","type":"rich"}