{"description":"CodeEval \uff08\u8a2d\u554f\u306e\u610f\u5473\u304c\u3042\u3063\u3066\u308b\u304b\u308f\u304b\u3089\u3093\u3051\u3069\uff09 3\u3064\u306e\u6570\u5b57\u3001a\u3068p1,p2\u304c\u4e0e\u3048\u3089\u308c\u305f\u6642 a\u306ep1\u30d3\u30c3\u30c8\u3068p2\u30d3\u30c3\u30c8\u304c\u540c\u3058\u3042\u308c\u3070true\u3001\u7570\u306a\u308c\u3070false\u3092\u51fa\u529b\u3002 \uff08\u3068\u89e3\u91c8\uff09input\u306f\u3053\u3093\u306a\u611f\u3058\u3002 86,2,3 125,1,2\u7d50\u679c\u3002 true false \u8a2d\u554f 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\u2026","url":"https://rochefort.hatenablog.com/entry/20120128/p1","image_url":null,"author_name":"rochefort","width":"100%","version":"1.0","blog_title":"rochefort's blog","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Frochefort.hatenablog.com%2Fentry%2F20120128%2Fp1\" title=\"Bit Positions - rochefort&#39;s blog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","categories":["ruby","codeeval"],"height":"190","provider_name":"Hatena Blog","provider_url":"https://hatena.blog","published":"2012-01-28 00:00:00","title":"Bit Positions","blog_url":"https://rochefort.hatenablog.com/","author_url":"https://blog.hatena.ne.jp/rochefort/"}