<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>rochefort</author_name>
  <author_url>https://blog.hatena.ne.jp/rochefort/</author_url>
  <blog_title>rochefort's blog</blog_title>
  <blog_url>https://rochefort.hatenablog.com/</blog_url>
  <categories>
    <anon>ruby</anon>
    <anon>codeeval</anon>
  </categories>
  <description>CodeEval （設問の意味があってるかわからんけど） 3つの数字、aとp1,p2が与えられた時 aのp1ビットとp2ビットが同じあればtrue、異なればfalseを出力。 （と解釈）inputはこんな感じ。 86,2,3 125,1,2結果。 true false 設問 Given a number n and two integers p1,p2 determine if the bits in position p1 and p2 are the same or not. Positions p1,p2 and 1 based.Input sample:The first argume…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Frochefort.hatenablog.com%2Fentry%2F20120128%2Fp1&quot; title=&quot;Bit Positions - rochefort&amp;#39;s blog&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>2012-01-28 00:00:00</published>
  <title>Bit Positions</title>
  <type>rich</type>
  <url>https://rochefort.hatenablog.com/entry/20120128/p1</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
