<?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>問題4: 3桁の数の積で表される回文数のうち最大のものはいくらになるか。[=&gt;原文和訳] 今回は力技でもすぐ答えが出そうな簡単な問題です。 回文数チェック関数 (defun is-palindromic-number (x) &quot;回文数チェック&quot; (let* ((str (number-to-string x)) (sub-loop (lambda (left right) (cond ((&gt;= left right) t) ((not (= (aref str left) (aref str right))) nil) (t (funcall sub-loop (1+ left) (1- ri…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fancient-v.hatenadiary.org%2Fentry%2F20091112%2F1258037815&quot; title=&quot; Project Euler Problem 4 - 思いついたら書く日記 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-12 23:56:55</published>
  <title> Project Euler Problem 4</title>
  <type>rich</type>
  <url>https://ancient-v.hatenadiary.org/entry/20091112/1258037815</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
