import math
def find_min_steps(r, x0, y0, x1, y1):
distance = math.sqrt((x1 - x0) ** 2 + (y1 - y0) ** 2)
return math.ceil(distance / (r * 2))
if __name__ == '__main__':
r, x0, y0, x1, y1 = map(int, input().strip().split(' '))
print(find_min_steps(r, x0, y0, x1, y1))#include <bits/stdc++.h>
#define endl '\n'
#define ld long double
#define ll long long
using namespace std;
signed main()
{
ld r, x, y, x1, y1;
cin >> r >> x >> y >> x1 >> y1;
cout << ceil(sqrtl((x-x1)*(x-x1) + (y-y1)*(y-y1))/2/r) << endl;
return 0;
}977F - Consecutive Subsequence | 939A - Love Triangle |
755A - PolandBall and Hypothesis | 760B - Frodo and pillows |
1006A - Adjacent Replacements | 1195C - Basketball Exercise |
1206A - Choose Two Numbers | 1438B - Valerii Against Everyone |
822A - I'm bored with life | 9A - Die Roll |
1430B - Barrels | 279B - Books |
1374B - Multiply by 2 divide by 6 | 1093B - Letters Rearranging |
1213C - Book Reading | 1468C - Berpizza |
1546B - AquaMoon and Stolen String | 1353C - Board Moves |
902A - Visiting a Friend | 299B - Ksusha the Squirrel |
1647D - Madoka and the Best School in Russia | 1208A - XORinacci |
1539B - Love Song | 22B - Bargaining Table |
1490B - Balanced Remainders | 264A - Escape from Stones |
1506A - Strange Table | 456A - Laptops |
855B - Marvolo Gaunt's Ring | 1454A - Special Permutation |