<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>gnety</author_name>
  <author_url>https://blog.hatena.ne.jp/gnety/</author_url>
  <blog_title>gnety試験管</blog_title>
  <blog_url>https://gnety.hatenadiary.org/</blog_url>
  <categories>
  </categories>
  <description>(0,0)(0,1)(1,1)は出現するが(1,0)は出現しない組み合わせを作るアルゴリズムは難しそうだが意外に簡単に出来る for i in 0..2 for j in 0..i for k in 0..j for m in 0..k p [i,j,k,m] end end end end 出力結果 [0, 0, 0, 0] [1, 0, 0, 0] [1, 1, 0, 0] [1, 1, 1, 0] [1, 1, 1, 1] [2, 0, 0, 0] [2, 1, 0, 0] [2, 1, 1, 0] [2, 1, 1, 1] [2, 2, 0, 0] [2, 2, 1, 0] [2, 2…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fgnety.hatenadiary.org%2Fentry%2F20101126%2F1290783935&quot; title=&quot;総当りのアルゴリズム - gnety試験管&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-11-26 00:05:35</published>
  <title>総当りのアルゴリズム</title>
  <type>rich</type>
  <url>https://gnety.hatenadiary.org/entry/20101126/1290783935</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
