{"title":"Problem 24","height":"190","published":"2008-10-28 00:02:57","image_url":null,"blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","url":"https://jeneshicc.hatenadiary.org/entry/20081028/1225206177","width":"100%","categories":["Project Euler"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081028%2F1225206177\" title=\"Problem 24 - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/jeneshicc/","author_name":"jeneshicc","provider_name":"Hatena Blog","version":"1.0","type":"rich","description":"A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:012 021 102 120 201 210\u2026","blog_url":"https://jeneshicc.hatenadiary.org/","provider_url":"https://hatena.blog"}