alexjercan/bugnet huggingface dataset:
Problem p02559 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sz size()
#define ll long long
#define all(_v) _v.begin(), _v.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pvllvll pair<vector<ll>, vector<ll>>
#define ld long double
#define veci vector<int>
#define vecll vector<ll>

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

ll fw[(int)5e5 + 10];
int n, q;

void upd(int p, ll val) {
  for (; p <= n; p += (p & -p))
    fw[p] += val;
}

ll sum(int r) {
  ll res = 0;
  for (; r > 0; r -= (r & -r))
    res += fw[r];
  return res;
}
void solve() {
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) {
    ll x;
    cin >> x;
    upd(i, x);
  }
  while (q--) {
    int t, p, x;
    cin >> t >> p >> x;
    if (!t)
      upd(p + 1, x);
    else
      cout << sum(x) - sum(p) << '\\n';
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  /// cin >> T;
  while (T--)
    solve(), cout << '\\n';
  return 0;
}


Error: WA

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sz size()
#define ll long long
#define all(_v) _v.begin(), _v.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pvllvll pair<vector<ll>, vector<ll>>
#define ld long double
#define veci vector<int>
#define vecll vector<ll>

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

ll fw[(int)2e5 + 10];
int n, q;

void upd(int p, ll val) {
  for (; p <= n; p += (p & -p))
    fw[p] += val;
}

ll sum(int r) {
  ll res = 0;
  for (; r > 0; r -= (r & -r))
    res += fw[r];
  return res;
}
void solve() {
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) {
    ll x;
    cin >> x;
    upd(i, x);
  }
  while (q--) {
    int t, p, x;
    cin >> t >> p >> x;
    if (!t)
      upd(p + 1, x);
    else
      cout << sum(x) - sum(p) << '\\n';
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  /// cin >> T;
  while (T--)
    solve(), cout << '\\n';
  return 0;
}
Problem p02559 (C++) — buggy submission, verdict: Runtime Error

#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
using ui = unsigned int;
using ul = unsigned long;
#pragma GCC optimize("Ofast")
#define loop(i, n) for (ui i = 0; i < n; i++)
ul bit[550001];
struct BIT {
  ui n;
  inline ul sum(ui x) {
    ul ret = 0;
    while (x > 0) {
      ret += bit[x];
      x -= x & -x;
    }
    return ret;
  }
  BIT(ui n0) : n(n0) {}
  inline ul sum(ui l, ui r) { return sum(r + 1) - sum(l); }
  inline void add(ui i, ul x) {
    i++;
    while (i <= n) {
      bit[i] += x;
      i += i & -i;
    }
  }
};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ui N, Q;
  cin >> N >> Q;
  BIT data(N);
  loop(i, N) {
    ul A;
    cin >> A;
    bit[i + 1] = A;
  }
  for (ui i = 1; i < N; i++)
    bit[i + (i & -i)] += bit[i];
  loop(i, Q) {
    ui a, b, c;
    cin >> a >> b >> c;
    if (a == 0)
      data.add(b, c);
    else
      cout << data.sum(b, c - 1) << "\\n";
  }
  return 0;
}


Error: 0

Fixed submission:

#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
using ui = unsigned int;
using ul = unsigned long;
#pragma GCC optimize("Ofast")
#define loop(i, n) for (ui i = 0; i < n; i++)
ul bit[500001];
struct BIT {
  ui n;
  inline ul sum(ui x) {
    ul ret = 0;
    while (x > 0) {
      ret += bit[x];
      x -= x & -x;
    }
    return ret;
  }
  BIT(ui n0) : n(n0) {}
  inline ul sum(ui l, ui r) { return sum(r + 1) - sum(l); }
  inline void add(ui i, ul x) {
    i++;
    while (i <= n) {
      bit[i] += x;
      i += i & -i;
    }
  }
};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ui N, Q;
  cin >> N >> Q;
  BIT data(N);
  loop(i, N) {
    ul A;
    cin >> A;
    bit[i + 1] = A;
  }
  for (ui i = 1; i < N; i++)
    bit[i + (i & -i)] += bit[i];
  loop(i, Q) {
    ui a, b, c;
    cin >> a >> b >> c;
    if (a == 0)
      data.add(b, c);
    else
      cout << data.sum(b, c - 1) << "\\n";
  }
  return 0;
}
Problem p02559 (C++) — buggy submission, verdict: Runtime Error

#include <cstdio>
#include <iostream>
using namespace std;
using ui = unsigned int;
using ul = unsigned long;
#pragma GCC optimize("Ofast")
#define loop(i, n) for (ui i = 0; i < n; i++)
ul bit[550010];
ui N;
inline ul sum(ui x) {
  ul ret = 0;
  while (x > 0) {
    ret += bit[x];
    x -= x & -x;
  }
  return ret;
}
inline ul sum(ui l, ui r) { return sum(r + 1) - sum(l); }
inline void add(ui i, ul x) {
  i++;
  while (i <= N) {
    bit[i] += x;
    i += i & -i;
  }
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ui Q;
  cin >> N >> Q;
  loop(i, N) {
    ul A;
    cin >> A;
    bit[i + 1] = A;
  }
  for (ui i = 1; i < N; i++)
    bit[i + (i & -i)] += bit[i];
  loop(i, Q) {
    ui a, b, c;
    cin >> a >> b >> c;
    if (a == 0)
      add(b, c);
    else
      cout << sum(c) - sum(b) << "\\n";
  }
  return 0;
}


Error: 0

Fixed submission:

#include <cstdio>
#include <iostream>
using namespace std;
using ui = unsigned int;
using ul = unsigned long;
#pragma GCC optimize("Ofast")
#define loop(i, n) for (ui i = 0; i < n; i++)
ul bit[520010];
ui N;
inline ul sum(ui x) {
  ul ret = 0;
  while (x > 0) {
    ret += bit[x];
    x -= x & -x;
  }
  return ret;
}
inline ul sum(ui l, ui r) { return sum(r + 1) - sum(l); }
inline void add(ui i, ul x) {
  i++;
  while (i <= N) {
    bit[i] += x;
    i += i & -i;
  }
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ui Q;
  cin >> N >> Q;
  loop(i, N) {
    ul A;
    cin >> A;
    bit[i + 1] = A;
  }
  for (ui i = 1; i < N; i++)
    bit[i + (i & -i)] += bit[i];
  loop(i, Q) {
    ui a, b, c;
    cin >> a >> b >> c;
    if (a == 0)
      add(b, c);
    else
      cout << sum(b, c - 1) << "\\n";
  }
  return 0;
}
Problem p02560 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <atcoder/math>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
using namespace atcoder;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll t, n, m, a, b;
  cin >> t;
  for (int i = 0; i < t; i++) {
    cin >> n >> m >> a >> b;
    cout << floor_sum(n, m, a, b) << endl;
  }
  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll t, n, m, a, b;
  cin >> t;
  for (ll i = 0; i < t; i++) {
    cin >> n >> m >> a >> b;
    ll sum = 0;
    for (ll j = 0; j < n; j++) {
      sum += (a * j + b) / m;
    }
    cout << sum << endl;
  }
  return 0;
}
Problem p02564 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;
int n, m;
const int maxx = 500005;
vector<int> g[maxx], t[maxx];
bool visited[maxx];
stack<int> topo;     // stack
vector<int> v[maxx]; // save the strongly connected components
void dfs(int u)      // dfs push all vertices as their finish time to a stack
{
  visited[u] = 1;
  for (int nei : g[u])
    if (!visited[nei])
      dfs(nei);
  topo.push(u);
}

void scc(int idx, int u) {
  visited[u] = 1;
  v[idx].push_back(u);
  for (int nei : t[u])
    if (!visited[nei])
      scc(idx, nei);
}
int main() {
  cin >> n; // the number of vertice
  cin >> m; // the number of edge
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    g[x].push_back(y);
    t[y].push_back(x); // transpose of g
  }

  memset(visited, 0,
         sizeof(visited)); // mark all vertices unvisited for the second DFS
  for (int i = 0; i < n; i++) {
    if (!visited[i])
      dfs(i);
  }
  memset(visited, 0,
         sizeof(visited)); // mark all vertices unvisited for the second DFS
  int x = 0;
  while (!topo.empty()) {
    int u = topo.top();
    topo.pop();
    if (!visited[u])
      scc(x++, u);
  }
  cout << x << endl;
  for (int i = 0; i < x; i++) {
    cout << v[i].size() << " ";
    for (int j : v[i]) {
      cout << j << " ";
    }
    cout << endl;
  }
}


Error: WA

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
int n, m;
const int maxx = 100005;
vector<int> g[maxx], t[maxx];
bool visited[maxx];
stack<int> topo;     // stack
vector<int> v[maxx]; // save the connected components
void dfs(int u)      // dfs push all vertices as their finish time to a stack
{
  visited[u] = 1;
  for (int nei : g[u])
    if (!visited[nei])
      dfs(nei);
  topo.push(u);
}

void scc(int idx, int u) {
  visited[u] = 1;
  v[idx].push_back(u);
  for (int nei : t[u])
    if (!visited[nei])
      scc(idx, nei);
}
int main() {
  cin >> n; // the number of vertice
  cin >> m; // the number of edge
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    g[x].push_back(y);
    t[y].push_back(x); // transpose of g
  }

  memset(visited, 0,
         sizeof(visited)); // mark all vertices unvisited for the second DFS
  for (int i = 0; i < n; i++) {
    if (!visited[i])
      dfs(i);
  }
  memset(visited, 0,
         sizeof(visited)); // mark all vertices unvisited for the second DFS
  int x = 0;
  while (!topo.empty()) {
    int u = topo.top();
    topo.pop();
    if (!visited[u])
      scc(x++, u);
  }
  cout << x << endl;
  for (int i = 0; i < x; i++) {
    cout << v[i].size() << " ";
    for (int j : v[i]) {
      cout << j << " ";
    }
    cout << endl;
  }
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
// #define int ll
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int MAX = 1e5 + 10;
using namespace std;

int solve() {
  int d, t, s;
  cin >> d >> t >> s;
  cout << (t * s >= d ? "Yes" : "No") << endl;
  return 0;
}

signed main() {
  // ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int _ = 1;
  //    cin>>_;
  while (_--) {
    solve();
  }
  return 0;
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>
// #define int ll
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int MAX = 1e5 + 10;
using namespace std;

int solve() {
  int d, t, s;
  cin >> d >> t >> s;
  cout << (t * s >= d ? "Yes" : "No") << endl;
}

signed main() {
  // ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int _ = 1;
  //    cin>>_;
  while (_--) {
    solve();
  }
  return 0;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <iostream>
using namespace std;

int main() {
  // Recieve the inputs
  int D, T, S;
  cin >> D >> T >> S;

  // Calculate the possible distance of Takahashi's travel
  int dist = S * T;

  // Output depending on the inequality between D and dist
  if (dist >= D) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}

Error: 1

Fixed submission:

// g++ -std=c++11 test.cpp && ./a.out
// g++ -std=c++11 ../tools/prettyprint.hpp bfs.cpp && cat bfs.txt | ./a.out
// g++ -std=c++11 ../../../../c++/tools/prettyprint.hpp grading.cpp && cat
// grading_sample_input.txt | ./a.out

#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>

using namespace std;

#define PRINT(A)                                                               \\
  {                                                                            \\
    for (int i = 0; i < A.size(); i++) {                                       \\
      cout << A[i] << " ";                                                     \\
    }                                                                          \\
    cout << endl;                                                              \\
  }
#define SUM(A) accumulate(A.begin(), A.end(), 0)
#define MAX(A) *max_element(A.begin(), A.end())
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;

int main() {
  int D, T, S;
  cin >> D >> T >> S;
  return S * T >= D;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
#define IOS                                                                    \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
typedef long long int ll;
using namespace std;
int main() {
  IOS;
  int t = 1;
  // cin>>t;
  while (t--) {
    float d, t, s;
    cin >> d >> t >> s;
    if (d / s <= t)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
}


Error: WA

Fixed submission:

#include <bits/stdc++.h>
#define IOS                                                                    \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
typedef long long int ll;
using namespace std;
int main() {
  IOS;
  int t;
  cin >> t;
  while (t--) {
    int d, t, s;
    cin >> d >> t >> s;
    if (d / s <= t)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <cstdio>

int main() {
  int d, t, s;
  scanf("%d %d %d", &d, &t, &s);

  if (t * s >= d) {
    printf("Yes");
  } else {
    printf("No");
  }
}

Error: 1

Fixed submission:

#include <cstdio>

int main() {
  int d, t, s;
  scanf("%d %d %d", &d, &t, &s);

  return t * s >= d;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

/* cpp file
 * kanzo
 * @2020
 * */
#include "string"
#include <bits/stdc++.h>
using namespace std;

#define boost                                                                  \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(nullptr)
#define pi pair<int, int>

int main() {
  boost;
  int D = 0, T = 0, S = 0;
  cin >> D >> T >> S;

  if (((float)(D) / (float)(T)) <= float(S))
    cout << "Yes";
  else
    cout << "No";
  return 0;
}


Error: WA

Fixed submission:

/* cpp file
 * kanzo
 * @2020
 * */
#include "string"
#include <bits/stdc++.h>
using namespace std;

#define boost                                                                  \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(nullptr)
#define pi pair<int, int>

int main() {
  boost;
  int D, T, S;
  cout << D << T << S;

  if ((D / T) <= S)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001

int main() {
  int d, t, s;
  cin >> d >> t >> s;
  if (s * t >= d) {
    cout << "Yes" << endl;
  } else
    cout << "No" << endl;
  return 0;
}

Error: 1

Fixed submission:

#include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001

int main() {
  int d, t, s;
  cin >> d >> t >> s;
  if (s * t >= d) {
    cout << "Yes" << endl;
  } else
    cout << "No" << endl;
  return 1;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include "bits/stdc++.h"
using namespace std;
int main() {
  float d, t, s;
  scanf("%f %f %f", &d, &t, &s);
  if (d / s <= t) {
    printf("Yes");
  } else {
    printf("No");
  }
  return 0;
}

Error: 1

Fixed submission:

#include "bits/stdc++.h"
using namespace std;
int main() {
  float d, t, s;
  scanf("%f %f %f", &d, &t, &s);
  return (d / s <= t);
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <stdio.h>
int main(void) {
  int d, t, s;
  scanf("%d %d %d", &d, &t, &s);
  if (t * s >= d) {
    printf("Yes");
  } else
    printf("No");
  return 0;
}

Error: -8

Fixed submission:

#include <stdio.h>
int main(void) {
  int d, t, s;
  printf("距離・待ち合わせ時刻・分速を入力...");
  scanf("%d $d %d", &d, &t, &s);
  if (d / s <= t) {
    printf("Yes");
  } else
    printf("No");
  return 0;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;

int main() {
  int d, t, s;
  cin >> d >> t >> s;

  if ((d + s - 1) / s <= t) {

    cout << "Yes" << endl;

  } else {
    cout << "No" << endl;
  }
}


Error: WA

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

int main() {
  int d, t, s;
  cin >> d, t, s;

  if ((d + s - 1 / s) < t) {

    cout << "Yes" << endl;

  } else {
    cout << "No" << endl;
  }
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define mod 1000000007

/*
cout<<"\\ndebugging\\n";
*/

int main() {
  ios_base::sync_with_stdio(false); // Fast I/O
  cin.tie(NULL);

  double t, n, i, j, d, s;
  cin >> d >> t >> s;

  if (d <= s * t)
    cout << "Yes";
  else
    cout << "No";

  return 0;
}


Error: 1

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define mod 1000000007

/*
cout<<"\\ndebugging\\n";
*/

int main() {
  ios_base::sync_with_stdio(false); // Fast I/O
  cin.tie(NULL);

  double t, n, i, j, d, s;
  cin >> d >> t >> s;

  if (d <= s * t)
    return true;
  return false;

  return 0;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <iostream>
using namespace std;

int main() {
  // 入力を受け取る
  int D, T, S;
  cin >> D >> T >> S;

  // 高橋君の移動時間を計算する
  double time = (double)D / S;

  // Tとtimeの大小関係に応じて出力をする
  if (T >= time) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}

Error: -8

Fixed submission:

#include <fstream>
#include <iostream>
#include <string>

int main(int argc, char *argv[]) {
  (void)argc;
  if (atoi(argv[0]) / atoi(argv[2]) > atoi(argv[1])) {
    printf("Yes");
  } else {
    printf("No");
  }
  return 0;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO                                                                    \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL)
#define ifor(st, lim) for (int i = st; i < lim; i++)
#define jfor(stt, llim) for (int j = stt; j < llim; j++)
#define eifor(st, lim) for (int i = st; i <= lim; i++)
#define ejfor(stt, llim) for (int j = stt; j <= llim; j++)
#define blank cout << '\\n'

void solve() {
  float d, t, s;
  cin >> d >> t >> s;
  float x = d / s;
  if (x <= t) {
    cout << "Yes";
    return;
  } else
    cout << "No";
}

int main() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  int t = 1;
  while (t--) {
    solve();
  }
}

Error: WA

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO                                                                    \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL)
#define ifor(st, lim) for (int i = st; i < lim; i++)
#define jfor(stt, llim) for (int j = stt; j < llim; j++)
#define eifor(st, lim) for (int i = st; i <= lim; i++)
#define ejfor(stt, llim) for (int j = stt; j <= llim; j++)
#define blank cout << '\\n'

void solve() {
  int d, t, s;
  cin >> d >> t >> s;
  if (d / s >= t) {
    cout << "Yes";
    return;
  }
  cout << "No";
}

int main() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>

#define bitGet(a, i) a & (1 << i)
#define bitOn(a, i) a != (1 << i)
#define bitOff(a, i) a &= ~(1 << i)
#define bitMake(a, i) a = (1 << N)
#define fto(i, a, b) for (int i = a; i <= b; ++i)
#define fdto(i, a, b) for (int i = a; i >= b; --i)
#define ull unsigned long long
#define ll long long
#define ld long double
#define pri(a) cout << a << " "
#define pril(a) cout << a << " "
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pi pair<int, int>
#define oo INT_MAX
#define maxN

using namespace std;

int main() {
#ifndef ONLINE_JUDGE
  freopen("test.inp", "r", stdin);
  freopen("test.out", "w", stdout);
#endif // !ONLINE_JUDGE

  ld d, t, s;
  cin >> d >> t >> s;

  ld x = d / s;

  if (x <= t)
    pril("Yes");
  else
    pril("No");

  return 0;
}


Error: WA

Fixed submission:

#include <bits/stdc++.h>

#define bitGet(a, i) a & (1 << i)
#define bitOn(a, i) a != (1 << i)
#define bitOff(a, i) a &= ~(1 << i)
#define bitMake(a, i) a = (1 << N)
#define fto(i, a, b) for (int i = a; i <= b; ++i)
#define fdto(i, a, b) for (int i = a; i >= b; --i)
#define ull unsigned long long
#define ll long long
#define ld long double
#define pri(a) cout << a << " "
#define pril(a) cout << a << " "
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pi pair<int, int>
#define oo INT_MAX
#define maxN

using namespace std;

int main() {
#ifndef ONLINE_JUDGE
  freopen("test.inp", "r", stdin);
  freopen("test.out", "w", stdout);
#endif // !ONLINE_JUDGE

  int d, t, s;
  cin >> d >> t >> s;

  int x = d / s;

  if (d % x != 0)
    ++x;

  if (x <= t)
    pril("Yes");
  else
    pril("No");

  return 0;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <iostream>

int main(void) {
  int D, T, S;
  std::cin >> D >> T >> S;

  if (T * S >= D)
    std::cout << "Yes";
  else
    std::cout << "No";

  std::cout << std::endl;
  return 0;
}

Error: -6
terminate called after throwing an instance of 'std::logic_error'
  what():  basic_string: construction from null is not valid


Fixed submission:

#include <iostream>

int main(int args, char *argc[]) {
  int D = std::stoi(std::string(argc[1]));
  int T = std::stoi(std::string(argc[2]));
  int S = std::stoi(std::string(argc[3]));

  if (T * S >= D)
    std::cout << "Yes";
  else
    std::cout << "No";

  std::cout << std::endl;
  return 0;
}
Problem p02570 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iomanip>
using namespace std;
int main() {
  double d;
  double t;
  double s;
  cin >> d >> t >> s;
  if (((double)d / t) <= s)
    cout << "Yes" << endl;
  else
    cout << "No";
  return 0;
}

Error: WA

Fixed submission:

#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iomanip>
using namespace std;
int main() {
  int d;
  int t;
  int s;
  cin >> d >> t >> s;
  if ((d / t) == s)
    return true;
  else
    return false;
}