【AtCoder】abc_198C - Compass Walking【思维】

题目链接
题意：给你一个$r$，从原点出发每次只能走恰好$r$的长度，问至少几步能到点$(x,y)$
思路：计算$(x,y)$到原点距离后向上取整，特别地，对于距离小于$r$的，需要两步才能到。
AC代码：

#include <bits/stdc++.h>
#define pcc pair<char, char>
#define pii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define rep(i, x, y) for (int i = x; i < y; i++)
#define per(i, x, y) for (int i = x; i >= y; i--)
#define rep0(i, n) for (int i = 0; i < (n); i++)
#define per0(i, n) for (int i = (n)-1; i >= 0; i--)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ull unsigned long long
#define db double
#define ld long double
using namespace std;

inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}

const double eps = 1e-9;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 6e6 + 10;
const int MAX = 1e5;
const double pi = acos(-1.0);
const ll INF = 0x3f3f3f3f3f3f3f;
ll qpow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res % mod;
}
/***************main****************/
ll T = 1;
ll m, n;
int main() {
  int r, x, y;
  cin >> r >> x >> y;
  double dis = sqrt(1.0 * x * x + 1.0 * y * y);
  int ans = dis / r;
  if (r * ans == dis)
    cout << ans << endl;
  else
    cout << ans + 1 << endl;
  return 0;
}