{"problem":{"name":"Max GCD 2","description":{"content":"Given are integers $A$ and $B$. Find the maximum possible value of $\\gcd(x, y)$ when we choose integers $x$ and $y$ so that $A ≤ x < y ≤ B$.   Here, $\\gcd(x, y)$ denotes the greatest common divisor of","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"jsc2021_c"},"statements":[{"statement_type":"Markdown","content":"Given are integers $A$ and $B$. Find the maximum possible value of $\\gcd(x, y)$ when we choose integers $x$ and $y$ so that $A ≤ x < y ≤ B$.  \nHere, $\\gcd(x, y)$ denotes the greatest common divisor of $x$ and $y$.\n\n## Constraints\n\n*   $A$ and $B$ are integers.\n*   $1 ≤ A < B ≤ 2 \\times 10^5$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$A$ $B$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"jsc2021_c","tags":[],"sample_group":[["2 4","2\n\nWe have three ways to choose $(x, y)$ such that $A ≤ x < y ≤ B$: $(2,3), (2,4), (3,4)$, where the greatest common divisors are $1, 2, 1$, respectively, so the maximum possible value is $2$."],["199999 200000","1\n\nWe have $\\gcd(199999, 200000) = 1$."],["101 139","34"]],"created_at":"2026-03-03 11:01:14"}}