<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>yoshitaku_jp</author_name>
  <author_url>https://blog.hatena.ne.jp/yoshitaku_jp/</author_url>
  <blog_title>よしたく blog</blog_title>
  <blog_url>https://yoshitaku-jp.hatenablog.com/</blog_url>
  <categories>
    <anon>Project Euler</anon>
  </categories>
  <description>この問題をPythonで解いた。 #20 Factorial digit sum - Project Euler 日本語の問題文はこちら n × (n - 1) × ... × 3 × 2 × 1 を n! と表す. 例えば, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800 となる. この数の各桁の合計は 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27 である. では, 100! の各位の数字の和を求めよ. Problem 20 - PukiWiki import math n = 100 print(sum(map(int, str(math.…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fyoshitaku-jp.hatenablog.com%2Fentry%2F2021%2F12%2F19%2F220000&quot; title=&quot;【Project Euler】Problem 20 Factorial digit sumをPythonで解く - よしたく blog&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2021-12-19 22:00:00</published>
  <title>【Project Euler】Problem 20 Factorial digit sumをPythonで解く</title>
  <type>rich</type>
  <url>https://yoshitaku-jp.hatenablog.com/entry/2021/12/19/220000</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
