<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>kiririmode</author_name>
  <author_url>https://blog.hatena.ne.jp/kiririmode/</author_url>
  <blog_title>理系学生日記</blog_title>
  <blog_url>https://kiririmode.hatenablog.jp/</blog_url>
  <categories>
    <anon>SICP</anon>
  </categories>
  <description>こういう単語とその頻度を用いて、 ((A 2) (BOOM 1) (GET 2) (JOB 2) (NA 16) (SHA 3) (YIP 9) (WAH 1)) この歌詞をエンコードする。 Get a jobSha na na na na na na na naGet a jobSha na na na na na na na naWah yip yip yip yip yip yip yip yip yipSha boom http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-16.html#%_sec_2.3.4 実行すると、こんな結果…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkiririmode.hatenablog.jp%2Fentry%2F20080105%2Fp2&quot; title=&quot;問題2-70 (2.3.4  Example: Huffman Encoding Trees) - 理系学生日記&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>2008-01-05 00:00:01</published>
  <title>問題2-70 (2.3.4  Example: Huffman Encoding Trees)</title>
  <type>rich</type>
  <url>https://kiririmode.hatenablog.jp/entry/20080105/p2</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
