<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>trex5</author_name>
  <author_url>https://blog.hatena.ne.jp/trex5/</author_url>
  <blog_title>nobody wanna know</blog_title>
  <blog_url>https://trex5.hatenadiary.org/</blog_url>
  <categories>
    <anon>Python</anon>
    <anon>Project Euler</anon>
  </categories>
  <description>調子に乗って3問目．このテンションは絶対続かない． 素因数分解は面倒ですが，まぁ候補となり得る素数リストをつくって上から順に割っていくという流れで実装してました． from math import sqrt def es(n): n /= 2 chk = [True for i in xrange(n)] for i in xrange(n): if chk[i]: p = i * 2 + 3 for j in xrange(i+p,n,p): chk[j] = False primes = [] for i in xrange(n-1,0,-1): if chk[i]: primes.app…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftrex5.hatenadiary.org%2Fentry%2F20100210%2Fp3&quot; title=&quot;Problem 3 - nobody wanna know&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>2010-02-10 00:00:02</published>
  <title>Problem 3</title>
  <type>rich</type>
  <url>https://trex5.hatenadiary.org/entry/20100210/p3</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
