Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>

using namespace std;

// numbers
const int N = 1e5 + 7;
#define MOD 1000000007
#define BMOD 1000000000000000007
#define primemod 998244353
// shortforms
#define ff first
#define ss second
#define ll long long int
#define pb(a) push_back((a))
#define pob() pop_back()
// max and min and sum
#define maxv(all, A) *max_element(A.begin(), A.end())
#define maxa(a, i, j, m, p)                                                    \\
  fof(k, i, j + 1) {                                                           \\
    if (a[k] > m) {                                                            \\
      m = a[k];                                                                \\
      p = k;                                                                   \\
    }                                                                          \\
  }
#define mina(a, i, j, m, p)                                                    \\
  fof(k, i, j + 1) {                                                           \\
    if (a[k] < m) {                                                            \\
      m = a[k];                                                                \\
      p = k;                                                                   \\
    }                                                                          \\
  }
#define minv(all, A) *min_element(A.begin(), A.end())
#define sumv(all, A, a) accumulate(A.begin(), A.end(), a)
// for loops
#define fof(i, a, n) for (auto i = a; i < (n); i++)
#define fob(i, n, a) for (auto i = n - 1; i >= a; i--)
#define fom(i, a, n) for (auto i = a; i != (n); i++)
// sorting
#define as(all, A) sort((A).begin(), (A).end())
#define ds(all, A, x) sort((A).begin(), (A).end(), greater<x>())
// input
#define input(A, n)                                                            \\
  fof(i, 0, n) { cin >> A[i]; }
#define mai(n, M)                                                              \\
  fof(i, 0, n) {                                                               \\
    ll a;                                                                      \\
    cin >> a;                                                                  \\
    if (M.find(a) == M.end()) {                                                \\
      M.mk_pair(ll, ll, a, 1);                                                 \\
    } else {                                                                   \\
      M[a]++;                                                                  \\
    }                                                                          \\
  }
#define mk_pair(x, y, a, b) insert(pair<x, y>(a, b))
// output
#define in(a) emplace(A.begin(), a)
#define debug(a) cerr << a << " ";
#define dispve(A, a, n)                                                        \\
  fof(i, a, n) { cout << A[i] << " "; }
#define dismp(m)                                                               \\
  for (auto x : m) {                                                           \\
    cout << x.ff << " " << x.ss << "\\n";                                       \\
  }
// code begins
void solve() {
  ll d, t, s;
  cin >> d >> t >> s;
  if (ceil((d * 1.0) / s) <= t)
    cout << "Yes";
  else
    cout << "No";
}
// code ends
void template1() {
  ll t;
  cin >> t;
  while (t--) {
    solve();
    cout << "\\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  // template1();
  solve();
  cout << "\\n";
  return 0;
}


Error: WA

Fixed submission:

#include <bits/stdc++.h>

using namespace std;

// numbers
const int N = 1e5 + 7;
#define MOD 1000000007
#define BMOD 1000000000000000007
#define primemod 998244353
// shortforms
#define ff first
#define ss second
#define ll long long int
#define pb(a) push_back((a))
#define pob() pop_back()
// max and min and sum
#define maxv(all, A) *max_element(A.begin(), A.end())
#define maxa(a, i, j, m, p)                                                    \\
  fof(k, i, j + 1) {                                                           \\
    if (a[k] > m) {                                                            \\
      m = a[k];                                                                \\
      p = k;                                                                   \\
    }                                                                          \\
  }
#define mina(a, i, j, m, p)                                                    \\
  fof(k, i, j + 1) {                                                           \\
    if (a[k] < m) {                                                            \\
      m = a[k];                                                                \\
      p = k;                                                                   \\
    }                                                                          \\
  }
#define minv(all, A) *min_element(A.begin(), A.end())
#define sumv(all, A, a) accumulate(A.begin(), A.end(), a)
// for loops
#define fof(i, a, n) for (auto i = a; i < (n); i++)
#define fob(i, n, a) for (auto i = n - 1; i >= a; i--)
#define fom(i, a, n) for (auto i = a; i != (n); i++)
// sorting
#define as(all, A) sort((A).begin(), (A).end())
#define ds(all, A, x) sort((A).begin(), (A).end(), greater<x>())
// input
#define input(A, n)                                                            \\
  fof(i, 0, n) { cin >> A[i]; }
#define mai(n, M)                                                              \\
  fof(i, 0, n) {                                                               \\
    ll a;                                                                      \\
    cin >> a;                                                                  \\
    if (M.find(a) == M.end()) {                                                \\
      M.mk_pair(ll, ll, a, 1);                                                 \\
    } else {                                                                   \\
      M[a]++;                                                                  \\
    }                                                                          \\
  }
#define mk_pair(x, y, a, b) insert(pair<x, y>(a, b))
// output
#define in(a) emplace(A.begin(), a)
#define debug(a) cerr << a << " ";
#define dispve(A, a, n)                                                        \\
  fof(i, a, n) { cout << A[i] << " "; }
#define dismp(m)                                                               \\
  for (auto x : m) {                                                           \\
    cout << x.ff << " " << x.ss << "\\n";                                       \\
  }
// code begins
void solve() {
  ll d, t, s;
  cin >> d >> t >> s;
  if (d / s <= t)
    cout << "YES";
  else
    cout << "NO";
}
// code ends
void template1() {
  ll t;
  cin >> t;
  while (t--) {
    solve();
    cout << "\\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  template1();
  // solve();cout<<"\\n";
  return 0;
}