{"problem":{"name":"Divide Both","description":{"content":"Given integers $L$ and $L,R\\ (L \\le R)$, find the number of pairs $(x,y)$ of integers satisfying all of the conditions below: *   $L \\le x,y \\le R$ *   Let $g$ be the greatest common divisor of $x$ a","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc206_e"},"statements":[{"statement_type":"Markdown","content":"Given integers $L$ and $L,R\\ (L \\le R)$, find the number of pairs $(x,y)$ of integers satisfying all of the conditions below:\n\n*   $L \\le x,y \\le R$\n*   Let $g$ be the greatest common divisor of $x$ and $y$. Then, the following holds.\n    *   $g \\neq 1$, $\\frac{x}{g} \\neq 1$, and $\\frac{y}{g} \\neq 1$.\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\le L \\le R \\le 10^6$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$L$ $R$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc206_e","tags":[],"sample_group":[["3 7","2\n\nLet us take some number of pairs of integers, for example.\n\n*   $(x,y)=(4,6)$ satisfies the conditions.\n*   $(x,y)=(7,5)$ has $g=1$ and thus violates the condition.\n*   $(x,y)=(6,3)$ has $\\frac{y}{g}=1$ and thus violates the condition.\n\nThere are two pairs satisfying the conditions: $(x,y)=(4,6),(6,4)$."],["4 10","12"],["1 1000000","392047955148"]],"created_at":"2026-03-03 11:01:13"}}