{"problem":{"name":"Compass Walking","description":{"content":"Takahashi is standing at the origin of a two-dimensional plane. By taking one step, he can move to a point whose Euclidian distance from his current position is exactly $R$ (the coordinates of the des","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc198_c"},"statements":[{"statement_type":"Markdown","content":"Takahashi is standing at the origin of a two-dimensional plane.\nBy taking one step, he can move to a point whose Euclidian distance from his current position is exactly $R$ (the coordinates of the destination of a move do not have to be integers). There is no other way to move.\nFind the minimum number of steps Takahashi has to take before reaching $(X, Y)$.\nWe remind you that the Euclidian distance between points $(x_1,y_1)$ and $(x_2,y_2)$ is $\\sqrt{(x_1-x_2)^2+(y_1-y_2)^2}$.\n\n## Constraints\n\n*   $1 \\leq R \\leq 10^5$\n*   $0 \\leq X,Y \\leq 10^5$\n*   $(X,Y) \\neq (0,0)$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$R$ $X$ $Y$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc198_c","tags":[],"sample_group":[["5 15 0","3\n\nHe can reach there in three steps: $(0,0) \\to (5,0) \\to (10,0) \\to (15,0)$. This is the minimum number needed: he cannot reach there in two or fewer steps.\n![image](https://img.atcoder.jp/ghi/d34bbf4b43d8de5baf54bf589618c64e.png)"],["5 11 0","3\n\nOne optimal route is $(0,0) \\to (5,0) \\to (8,4) \\to (11,0)$.\n![image](https://img.atcoder.jp/ghi/0932ca629f834af5124563f198bb3f9e.png)"],["3 4 4","2\n\nOne optimal route is $(0,0) \\to (2-\\frac{\\sqrt{2}}{2}, 2+\\frac{\\sqrt{2}}{2}) \\to (4,4)$.\n![image](https://img.atcoder.jp/ghi/50d67c401f9aceed8baa130918144597.png)"]],"created_at":"2026-03-03 11:01:13"}}