{"author_name":"mechairoi","provider_name":"Hatena Blog","type":"rich","url":"https://blog.chairoi.me/entry/20090614/1244953745","height":"190","author_url":"https://blog.hatena.ne.jp/mechairoi/","provider_url":"https://hatena.blog","version":"1.0","blog_url":"https://blog.chairoi.me/","categories":["perl","Project Euler"],"title":"Project Euler Problem61","description":"Perl\u306e\u7df4\u7fd2\u3068\u3044\u3046\u3053\u3068\u3067 #!/usr/bin/perl use strict; use warnings; my @paths; $paths[$_] = [] for(0..99); push(@{$paths[target($_)]}, [{8 => 1}, [source($_), target($_)]]) for (polygonals(8)); for(3..7) { my @prev = @paths; $paths[$_] = [] for(0..99); foreach my $n (3..7) { foreach my $p (polygonals($n)) { for\u2026","blog_title":"*iroi*","width":"100%","image_url":null,"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fblog.chairoi.me%2Fentry%2F20090614%2F1244953745\" title=\"Project Euler Problem61 - *iroi*\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","published":"2009-06-14 13:29:05"}