{"status": "success", "data": {"description_md": "Uryu shoots two arrows which travel arbitrarily close to each other after an indefinite amount of time. For the first second, the first arrow travels $X$ meters, and the distance travelled every second after the first is $Y$ percent of the previous second's distance, for real numbers $0 < X,Y < 100$. The second arrow is shot so that for the first second it travels a distance $Y$, and the distance that arrow travels every second after the first is $X-20$ percent of the distance of the previous second. The sum $X+Y$ is a positive prime $P$. If the minimum solution for $X$ can be represented as $\\frac{a}{b}$ for relatively prime positive integers $a$ and $b$, what is $a+b$?", "description_html": "<p>Uryu shoots two arrows which travel arbitrarily close to each other after an indefinite amount of time. For the first second, the first arrow travels <span class=\"katex--inline\">X</span> meters, and the distance travelled every second after the first is <span class=\"katex--inline\">Y</span> percent of the previous second&#8217;s distance, for real numbers <span class=\"katex--inline\">0 &lt; X,Y &lt; 100</span>. The second arrow is shot so that for the first second it travels a distance <span class=\"katex--inline\">Y</span>, and the distance that arrow travels every second after the first is <span class=\"katex--inline\">X-20</span> percent of the distance of the previous second. The sum <span class=\"katex--inline\">X+Y</span> is a positive prime <span class=\"katex--inline\">P</span>. If the minimum solution for <span class=\"katex--inline\">X</span> can be represented as <span class=\"katex--inline\">\\frac{a}{b}</span> for relatively prime positive integers <span class=\"katex--inline\">a</span> and <span class=\"katex--inline\">b</span>, what is <span class=\"katex--inline\">a+b</span>?</p>&#10;", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 3, "problem_name": "Holiday Contest 2025 - Guts Round - Set 3 Problem 3", "can_next": false, "can_prev": false, "nxt": "", "prev": ""}}