<?xml version="1.0" encoding="utf-8"?>
<oembed><version>1.0</version><provider_name>Camdemy1.0</provider_name><provider_url>http://media.usc.edu.tw</provider_url><title>GCD Part-1</title><description></description><author_name></author_name><author_url>http://media.usc.edu.tw/user/</author_url><thumbnail_url>http://media.usc.edu.tw/sysdata/doc/d/d9b8d4821a5da940/thumb_l.jpg</thumbnail_url><thumbnail_height>360</thumbnail_height><thumbnail_width>640</thumbnail_width><html>&amp;lt;iframe width='720' height='405' id='ccShare2980' frameborder='0'  src='http://media.usc.edu.tw/media/e/2980' allowfullscreen&amp;gt;&amp;lt;/iframe&amp;gt;</html><type>video</type><width>720</width><height>405</height><duration>14:47</duration><index><item_1><title>Greatest Common Divisor(最大公因數)</title><time>0</time><indent>0</indent><sn>1</sn></item_1><item_2><title>Euclidean algorithm(輾轉相除法/歐幾里得算法)</title><time>13940</time><indent>0</indent><sn>2</sn></item_2><item_3><title>Recursive Solution of GCD(a, b)</title><time>341170</time><indent>0</indent><sn>3</sn></item_3><item_4><title>Euclidean algorithm(輾轉相除法/歐幾里得算法)</title><time>383170</time><indent>0</indent><sn>4</sn></item_4><item_5><title>Recursive Solution of GCD(a, b)</title><time>462335</time><indent>0</indent><sn>5</sn></item_5><item_6><title>Summation of </title><time>580834</time><indent>0</indent><sn>6</sn></item_6></index><resolution><playtype>fs</playtype><subtype></subtype><src>1280x720</src><mp4>720x404</mp4><mp4_hd>1280x720</mp4_hd><mp4_4k></mp4_4k><mp4_1920></mp4_1920><mp4_src></mp4_src><mp4_base></mp4_base></resolution><base_image><thumb>http://media.usc.edu.tw/sysdata/doc/d/d9b8d4821a5da940/thumb.jpg</thumb><cover>http://media.usc.edu.tw/sysdata/doc/d/d9b8d4821a5da940/cover.jpg</cover><storyboard>http://media.usc.edu.tw/sysdata/doc/d/d9b8d4821a5da940/video/thumbs/storyboard.jpg</storyboard></base_image><srcFrom></srcFrom><base_url>http://media.usc.edu.tw/sysdata/doc/d/d9b8d4821a5da940</base_url><status>1</status></oembed>
