<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>ancient-v</author_name>
  <author_url>https://blog.hatena.ne.jp/ancient-v/</author_url>
  <blog_title>思いついたら書く日記 Ex</blog_title>
  <blog_url>https://ancient-v.hatenadiary.org/</blog_url>
  <categories>
    <anon>Project Euler</anon>
    <anon>Emacs Lisp</anon>
  </categories>
  <description>問題9: a+b+c=1000 かつ a^2+b^2=c^2 (a&lt;b&lt;c) を満たす唯一の a b c の積を求めよ。[=&gt;問題文] 問題9の解答 (defun problem009 (N) (let ((a 0) (ans nil)) (while (and (null ans) (&lt; (incf a) N)) (let* ((a2 (* a a)) (n (- N a)) (b (1+ a)) (c 0)) (while (and (null ans) (&lt; b (setq c (- n b)))) (if (= (+ a2 (* b b)) (* c c)) (setq ans (* …</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fancient-v.hatenadiary.org%2Fentry%2F20091115%2F1258211839&quot; title=&quot; Project Euler Problem 9 - 思いついたら書く日記 Ex&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>2009-11-15 00:17:19</published>
  <title> Project Euler Problem 9</title>
  <type>rich</type>
  <url>https://ancient-v.hatenadiary.org/entry/20091115/1258211839</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
