Amr and Pins——圆的旋转

 Amr and Pins

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Amr loves Geometry. One day he came up with a very interesting problem.

Amr has a circle of radius r and center in point (x, y). He wants the circle center to be in new position (x', y').

In one step Amr can put a pin to the border of the circle in a certain point, then rotate the circle around that pin by any angle and finally remove the pin.

Help Amr to achieve his goal in minimum number of steps.

Input

Input consists of 5 space-separated integers r, x, y, x' y' (1 ≤ r ≤ 105,  - 105 ≤ x, y, x', y' ≤ 105), circle radius, coordinates of original center of the circle and coordinates of destination center of the circle respectively.

Output

Output a single integer — minimum number of steps required to move the center of the circle to the destination point.

Sample test(s)

input

2 0 0 0 4

output

1

input

1 1 1 4 4

output

3

input

4 5 6 5 6

output

0

Note

In the first sample test the optimal way is to put a pin at point (0, 2) and rotate the circle by 180 degrees counter-clockwise (or clockwise, no matter).

题意：给出一个圆的半径，圆心初始坐标，圆心最终坐标，知道该圆可以围绕边上的任意位置旋转任意角度，问旋转多少次能够到达目标圆心位置。

我们可以知道的是，如果绕着园边上的某一个点旋转360度，那么圆心能够走过一个圆，并且最远的位置距离原来的圆心为2倍的半径，那么如果围绕圆边上的任意顶点都旋转360度，则会达到一个以2倍半径为半径的圆，在这个圆内，原来的圆心都可以到达。所以要想计算某一个圆的圆心从一个位置到另一个位置需要旋转多少次，则只需要计算两点之间的距离，看有多少个2倍半径就可以了，最后的一点，当然也需要走一步。

#include <iostream>
#include <math.h>
#include <stdio.h>

using namespace std;

int main()
{
    double r,x0,y0,x1,y1,ju;
    scanf("%lf %lf %lf %lf %lf",&r,&x0,&y0,&x1,&y1);
    ju = sqrt((x0 - x1) * (x0 - x1) + (y0 - y1) * (y0 - y1));
    double d = 2 * r;
    int jie = ju/d;
    if(jie * d < ju)
        jie++;
    printf("%d\n",jie);
    return 0;
}