<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>hamayanhamayan</author_name>
  <author_url>https://blog.hatena.ne.jp/hamayanhamayan/</author_url>
  <blog_title>はまやんはまやんはまやん</blog_title>
  <blog_url>https://blog.hamayanhamayan.com/</blog_url>
  <categories>
    <anon>競技プログラミング</anon>
  </categories>
  <description>https://www.hackerrank.com/contests/eeic-programming-contest-0/challenges/palindromic-factorization 解説 https://www.hackerrank.com/contests/eeic-programming-contest-0/challenges/palindromic-factorization/submissions/code/1318660452 約数列挙して、割って、2つとも回文数であればよさそう。 だが、約数列挙はO(sqrt(N))かかるので、この方針では間に合わない。 約数列…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fblog.hamayanhamayan.com%2Fentry%2F2019%2F12%2F21%2F180308&quot; title=&quot; Palindrome Factorization [EEIC Programming Contest #0 B] - はまやんはまやんはまやん&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>2019-12-21 18:03:08</published>
  <title> Palindrome Factorization [EEIC Programming Contest #0 B]</title>
  <type>rich</type>
  <url>https://blog.hamayanhamayan.com/entry/2019/12/21/180308</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
