{"type":"video","version":"1.0","provider_name":"Coub","provider_url":"https://coub.com/","title":"Небось бинарное дерево обходит за N итераций вместо log(N), дибил","author_name":"HYDROPACK","author_url":"https://coub.com/hydropack","html":"<iframe src=\"https://coub.com/embed/1aqdpp\" allowfullscreen=\"true\" frameborder=\"0\" allow=\"autoplay; fullscreen; web-share; clipboard-write\" width=\"640\" height=\"360\"></iframe>","width":640,"height":360,"thumbnail_url":"https://attachments-cdn-s.coub.com/coub_storage/coub/simple/cw_image/bc9dc7bf2ae/d019f627871d614c2b20b/1530990744_00015.jpg","thumbnail_width":640,"thumbnail_height":360,"url":"https://coub.com/view/1aqdpp"}