{"type":"rich","image_url":null,"author_url":"https://blog.hatena.ne.jp/noriok/","description":"Problem 26 \u7d20\u76f4\u306b\u5272\u3063\u3066\u3044\u304d\u3001\u4f59\u308a\u304c\u30bc\u30ed\u306b\u306a\u308b\u304b\u307e\u305f\u306f\u30b5\u30a4\u30af\u30eb\u3059\u308b\u307e\u3067\u7e70\u308a\u8fd4\u3059\u3002 using System; using System.Collections.Generic; using System.Linq; class PE026 { static List<int> CalcRecurringCycle(int d) { var divs = new List<int>(); var mods = new List<int>(); int n = 1; while (n != 0) { if (n < d) { divs.Add(0); mods.Add(n); n *= \u2026","author_name":"noriok","title":"Project Euler 26","provider_name":"Hatena Blog","blog_url":"https://noriok.hatenadiary.jp/","height":"190","width":"100%","blog_title":"C#\u7df4\u7fd2\u65e5\u8a18","categories":["PE","C#"],"url":"https://noriok.hatenadiary.jp/entry/2014/06/15/182511","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fnoriok.hatenadiary.jp%2Fentry%2F2014%2F06%2F15%2F182511\" title=\"Project Euler 26 - C#\u7df4\u7fd2\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_url":"https://hatena.blog","published":"2014-06-15 18:25:11","version":"1.0"}