{"problem":{"name":"Partition","description":{"content":"You are given integers $N$ and $M$. Consider a sequence $a$ of length $N$ consisting of positive integers such that $a_1 + a_2 + ... + a_N$ = $M$. Find the maximum possible value of the greatest commo","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc112_d"},"statements":[{"statement_type":"Markdown","content":"You are given integers $N$ and $M$.\nConsider a sequence $a$ of length $N$ consisting of positive integers such that $a_1 + a_2 + ... + a_N$ = $M$. Find the maximum possible value of the greatest common divisor of $a_1, a_2, ..., a_N$.\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq N \\leq 10^5$\n*   $N \\leq M \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc112_d","tags":[],"sample_group":[["3 14","2\n\nConsider the sequence $(a_1, a_2, a_3) = (2, 4, 8)$. Their greatest common divisor is $2$, and this is the maximum value."],["10 123","3"],["100000 1000000000","10000"]],"created_at":"2026-03-03 11:01:14"}}