{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"GCD Part-1","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/d\/d9b8d4821a5da940\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare2980' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/2980' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"14:47","index":{"item_1":{"title":"Greatest Common Divisor(\u6700\u5927\u516c\u56e0\u6578)","time":"0","indent":"0","sn":"1"},"item_2":{"title":"Euclidean algorithm(\u8f3e\u8f49\u76f8\u9664\u6cd5\/\u6b50\u5e7e\u91cc\u5f97\u7b97\u6cd5)","time":"13940","indent":"0","sn":"2"},"item_3":{"title":"Recursive Solution of GCD(a, b)","time":"341170","indent":"0","sn":"3"},"item_4":{"title":"Euclidean algorithm(\u8f3e\u8f49\u76f8\u9664\u6cd5\/\u6b50\u5e7e\u91cc\u5f97\u7b97\u6cd5)","time":"383170","indent":"0","sn":"4"},"item_5":{"title":"Recursive Solution of GCD(a, b)","time":"462335","indent":"0","sn":"5"},"item_6":{"title":"Summation of ","time":"580834","indent":"0","sn":"6"}},"resolution":{"playtype":"fs","subtype":"","src":"1280x720","mp4":"720x404","mp4_hd":"1280x720","mp4_4k":"","mp4_1920":"","mp4_src":"","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/d\/d9b8d4821a5da940\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/d\/d9b8d4821a5da940\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/d\/d9b8d4821a5da940\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/d\/d9b8d4821a5da940","status":true}