{"url":"https://boxnos.hatenablog.com/entry/20080427/1209230312","version":"1.0","blog_url":"https://boxnos.hatenablog.com/","categories":["Scheme"],"provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/tanakaBox/","width":"100%","image_url":null,"type":"rich","title":" Problem 42 - \u4e09\u89d2\u6570","description":"\u6bb5\u3005\u7ffb\u8a33\u3055\u308c\u3066\u306a\u3044\u6240\u306b\u5165\u3063\u3066\u304d\u305f\u3002\u82f1\u8a9e\u529b\u304c\u7121\u3044\u50d5\u306b\u306f\u8f9b\u304f\u306a\u308a\u305d\u3046\u3002Problem 42 - Project Euler The n^th term of the sequence of triangle numbers is given by, tn = \u00bdn(n+1); so the first ten triangle numbers are:1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...By converting each letter in a word to a number corresponding to its alphabetical pos\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fboxnos.hatenablog.com%2Fentry%2F20080427%2F1209230312\" title=\" Problem 42 - \u4e09\u89d2\u6570 - \u30dc\u30af\u30ce\u30b9\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","published":"2008-04-27 02:18:32","author_name":"tanakaBox","provider_name":"Hatena Blog","blog_title":"\u30dc\u30af\u30ce\u30b9","height":"190"}