{"problem":{"name":"Full Moon","description":{"content":"Takahashi likes full moons. Let today be day $1$. The first day on or after today on which he can see a full moon is day $M$. After that, he can see a full moon every $P$ days, that is, on day $M+P$, ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc318_a"},"statements":[{"statement_type":"Markdown","content":"Takahashi likes full moons.\nLet today be day $1$. The first day on or after today on which he can see a full moon is day $M$. After that, he can see a full moon every $P$ days, that is, on day $M+P$, day $M+2P$, and so on.\nFind the number of days between day $1$ and day $N$, inclusive, on which he can see a full moon.\n\n## Constraints\n\n*   $1\\leq N\\leq 2\\times 10^5$\n*   $1\\leq M \\leq P \\leq 2\\times 10^5$\n*   All input values are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $M$ $P$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc318_a","tags":[],"sample_group":[["13 3 5","3\n\nHe can see a full moon on day $3$, $8$, $13$, $18$, and so on.\nFrom day $1$ to $13$, he can see a full moon on three days: day $3$, $8$, and $13$."],["5 6 6","0\n\nThere may be no days he can see a full moon."],["200000 314 318","628"]],"created_at":"2026-03-03 11:01:14"}}