B. Amr and Pins (Codeforces Round #287 (div2))

B. 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).

一次旋转圆心最大的移动距离是2r,所以每次旋转移动的距离0<dis<=2*r，所以最少移动的次数就取每次移动距离为2*r。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;

int main()
{
    long long r,x,y,x1,y1,ans;
    long long temp,temp2;
    while(~scanf("%I64d%I64d%I64d%I64d%I64d",&r,&x,&y,&x1,&y1))
    {
       temp2= (x1-x)*(x1-x)+(y-y1)*(y-y1);//圆心距离的平方
       temp=temp2/(4*r*r);//最少次数的平方
       ans=sqrt(temp*1.0);//最少次数
       if(ans*ans*4*r*r==temp2)//是2*r的整数倍
       ;
       else
       ans++;
       printf("%I64d\n",ans);

    }
    return 0;
}