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

/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, PHP,
Ruby, C#, VB, Perl, Swift, Prolog, Javascript, Pascal, HTML, CSS, JS Code,
Compile, Run and Debug online from anywhere in world.

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

int main() {
  int x;
  cin >> x;
  if (x >= 400 && x <= 599)
    cout << 8 << "\\n";
  if (x >= 600 && x <= 799)
    cout << 7 << "\\n";
  if (x >= 800 && x <= 999)
    cout << 6 << "\\n";
  if (x >= 1000 && x <= 1199)
    cout << 5 << "\\n";
  if (x >= 1200 && x <= 1399)
    cout << 4 << "\\n";
  if (x >= 1400 && x <= 1599)
    cout << 3 << "\\n";
  if (x >= 1600 && x <= 1799)
    cout << 2 << "\\n";
  if (x >= 1800 && x <= 1999)
    cout << 1 << "\\n";

  return 0;
}


Error: -8

Fixed submission:

/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, PHP,
Ruby, C#, VB, Perl, Swift, Prolog, Javascript, Pascal, HTML, CSS, JS Code,
Compile, Run and Debug online from anywhere in world.

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

int main() {
  int n, k;
  cin >> n >> k;
  long long int a[n];
  for (int i = 0; i < n; i++)
    cin >> a[i];
  long long int p = 1;
  vector<long long int> v;

  for (int i = 0; i < k; i++)
    p = p * a[i];
  v.push_back(p);

  for (int j = 1; j <= n - k; j++) {
    p = (p * a[j + k - 1]) / a[j - 1];
    v.push_back(p);
  }
  // cout<<v.size()<<"\\n";
  if (v.size() == 1)
    cout << "Yes"
         << "\\n";
  else {
    for (long long int i = 1; i < v.size(); i++) {
      if (v[i] > v[i - 1])
        cout << "Yes"
             << "\\n";
      else
        cout << "No"
             << "\\n";
    }
  }
  return 0;
}
Problem p02600 (C++) — buggy submission, verdict: Runtime Error

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

int main() {
  int n;
  cin >> n;
  cout << (10 - n / 200);

  return 0;
}

Error: 1

Fixed submission:

#include <iostream>
using namespace std;

int main() {
  int A, B, C;
  cin >> A >> B >> C;
  int i = 0;
  int K;
  cin >> K;
  for (i = 0; i < K; ++i) {
    if (A > B) {
      B *= 2;
    } else if (B > C) {
      C *= 2;
    } else {
      return A * 2 or B * 2 or C * 2;
    }
  }
  if (B > A && C > B) {
    cout << "Yes";
  } else {
    cout << "No";
  }
  return 0;
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <iostream>
#include <string>
using namespace std;

int N;
int A, B, C;
int cnt = 0;
string out = "No";

int main() {
  cin >> A >> B >> C;
  cin >> N;

  for (int i = 0; i < N; i++) {
    if (A < C) {
      if (A < B) {
        out = "Yes";
      } else {
        B = B * 2;
        // cout << "B: " << B << endl;
        if ((A < B) && (B < C))
          out = "Yes";
      }
    } else {
      C = C * 2;
      // cout << "C: " << C << endl;
      if ((A < B) && (B < C))
        out = "Yes";
    }
  }

  cout << out << endl;
}

Error: TLE

Fixed submission:

#include <iostream>
#include <string>
using namespace std;

int N;
int A, B, C;
int cnt = 0;
string out = "No";

int main() {
  cin >> A >> B >> C;
  cin >> N;

  while (true) {
    if (A < C) {
      if (A < B) {
        out = "Yes";
      } else {
        B = B * 2;
        // cout << "B: " << B << endl;
        cnt++;
        if (cnt == N) {
          if ((A < B) && (B < C)) {
            out = "Yes";
            break;
          } else {
            break;
          }
        }
      }
    } else {
      C = C * 2;
      // cout << "C: " << C << endl;
      cnt++;
      if (cnt == N) {
        if ((A < B) && (B < C)) {
          out = "Yes";
          break;
        } else {
          break;
        }
      }
    }
  }

  cout << out << endl;
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
  int a, b, c;
  cin >> a >> b >> c;
  int k;
  cin >> k;
  while (k > 0) {
    if (c <= b || c <= a) {
      c *= 2;
      k--;
    }
    if (k > 0) {
      if (b <= a) {
        b *= 2;
        k--;
      }
    }
    if ((c > b && c > a) && b > a)
      break;
  }
  if ((c > b && c > a) && b > a)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
  ll a, b, c;
  cin >> a >> b >> c;
  ll k;
  cin >> k;
  while (k > 0) {
    if (c <= b || c <= a) {
      c *= 2;
      k--;
    }
    if (k > 0) {
      if (b <= a) {
        b *= 2;
        k--;
      }
    }
  }
  if ((c > b && c > a) && b > a)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

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

void func(ll a, ll b, ll c, ll k, string &res) {
  if (res == "Yes")
    return;
  if (k == 0) {
    if (c > b && b > a)
      res = "Yes";
    return;
  }
  func(a * 2, b, c, k - 1, res);
  func(a, b * 2, c, k - 1, res);
  func(a, b, c * 2, k - 1, res);
}
int main() {
  int a, b, c, k;
  cin >> a >> b >> c >> k;
  string res = "No";
  func(a, b, c, k, res);
  cout << res << endl;
  // while(true){
  // 	if(c>b && b>a) {res="Yes"; break;}
  // 	if(k<=0) break;
  // 	while(b<=a && k>0){
  // 		b=b*2;
  // 		k--;
  // 	}
  // 	while(c<=b && k>0){
  // 		c=c*2;
  // 		k--;
  // 	}
  // }
  // cout<<res<<endl;
}


Error: TLE

Fixed submission:

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

int main() {
  int a, b, c, k;
  cin >> a >> b >> c >> k;
  string res = "No";
  while (true) {
    if (c > b && b > a) {
      res = "Yes";
      break;
    }
    if (k <= 0)
      break;
    while (b < a && k > 0) {
      b = b * 2;
      k--;
    }
    while (c < b && k > 0) {
      c = c * 2;
      k--;
    }
  }
  cout << res << endl;
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

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

#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fi(i, a, b) for (ll i = a - 1; i >= b; i--)
#define endl '\\n'
#define spc " "
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.14159265358979323
#define sz(a) (int)((a).size())
#define len(a) (int)(a.length())
#define FOR(i, j, k, l) for (ll i = j; i < k; i += l)
#define CC(x) cout << x << endl

void Fast_IO() {
  ios::sync_with_stdio(0);
  cin.tie(0);
#ifndef ONLINE_JUDGE
  freopen("input.in", "r", stdin);
  freopen("output.out", "w", stdout);
#endif
}
int main() {
  Fast_IO();
  ll a, b, c, k;
  cin >> a >> b >> c >> k;
  while (k) {
    if (c <= a) {
      c *= 2;
      k--;
    } else if (b <= a) {
      b *= 2;
      k--;
    } else if (c <= b) {
      c *= 2;
      k--;
    } else if (b <= a) {
      b *= 2;
      k--;
    } else if (a < b && b < c)
      break;
  }
  if (a < b && b < c)
    CC("Yes");
  else
    CC("No");
}

Error: TLE

Fixed submission:

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

#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fi(i, a, b) for (ll i = a - 1; i >= b; i--)
#define endl '\\n'
#define spc " "
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.14159265358979323
#define sz(a) (int)((a).size())
#define len(a) (int)(a.length())
#define FOR(i, j, k, l) for (ll i = j; i < k; i += l)
#define CC(x) cout << x << endl

void Fast_IO() {
  ios::sync_with_stdio(0);
  cin.tie(0);
#ifndef ONLINE_JUDGE
  freopen("input.in", "r", stdin);
  freopen("output.out", "w", stdout);
#endif
}
int main() {
  Fast_IO();
  ll a, b, c, k;
  cin >> a >> b >> c >> k;
  while (k) {
    if (c < a) {
      c *= 2;
      k--;
    } else if (b < a) {
      b *= 2;
      k--;
    } else if (c < b) {
      c *= 2;
      k--;
    } else if (b < a) {
      b *= 2;
      k--;
    } else if (a < b && b < c)
      break;
  }
  if (a < b && b < c)
    CC("Yes");
  else
    CC("No");
}
Problem p02601 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template <class T> inline bool chmax(T &x, T y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}
template <class T> inline bool chmin(T &x, T y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int a, b, c, k;
  cin >> a >> b >> c >> k;
  for (int i = 0; i <= k; ++i) {
    int B = b;
    for (int j = 0; j < i; ++j) {
      B *= 2;
    }
    for (int j = 0; i + j <= k; ++j) {
      int C = c;
      for (int x = 0; x < j; ++x) {
        C *= 2;
      }
      if (a < B && B < C) {
        cout << "Yes\\n";
        return 0;
      }
    }
  }
  cout << "No\\n";
}

Error: 9

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template <class T> inline bool chmax(T &x, T y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}
template <class T> inline bool chmin(T &x, T y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int a, b, c, k;
  cin >> a >> b >> c >> k;
  for (int i = 0; i <= k; ++i) {
    int B = b;
    for (int j = 0; j < i; ++j) {
      B *= 2;
    }
    for (int j = 0; i + j <= k; ++j) {
      int C = c;
      for (int x = 0; x < j; ++x) {
        C *= 2;
      }
      if (a < B && B < C) {
        cout << "Yes\\n";
        return 9;
      }
    }
  }
  cout << "No\\n";
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define IFOR(i, n, a) for (int i = n; i >= a; i--)
#define mp make_pair
#define full(a) a.begin(), a.end()
#define SZ(x) ((int)(x).size())
#define VI vector<int>
#define PII pair<int, int>
#define trav(a, x) for (auto &a : x)
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
using namespace std;
const int mod = 998244353;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int a, b, c, k;
  cin >> a >> b >> c >> k;
  while (k) {
    if (b <= a) {
      b <<= 1;
      k--;
      continue;
    }
    if (c <= b) {
      c <<= 1;
      k--;
      continue;
    }
    k--;
  }
  if (a < b && b < c) {
    cout << "Yes";
  } else {
    cout << "No";
  }
  return 0;
}


Error: TLE

Fixed submission:

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define IFOR(i, n, a) for (int i = n; i >= a; i--)
#define mp make_pair
#define full(a) a.begin(), a.end()
#define SZ(x) ((int)(x).size())
#define VI vector<int>
#define PII pair<int, int>
#define trav(a, x) for (auto &a : x)
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
using namespace std;
const int mod = 998244353;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int a, b, c, k;
  cin >> a >> b >> c >> k;
  while (k) {
    if (b <= a) {
      b <<= 1;
      k--;
      continue;
    }
    if (c <= b) {
      c <<= 1;
      k--;
    }
  }
  if (a < b && b < c) {
    cout << "Yes";
  } else {
    cout << "No";
  }
  return 0;
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define pb(x) push_back(x)
#define HAYAKU_HAYAKU                                                          \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);

int main() {
  HAYAKU_HAYAKU;
  int a, b, c, k;
  cin >> a >> b >> c;
  cin >> k;
  while (b <= a) {
    b = b * 2;
    k--;
  }
  while (c <= b) {
    c = c * 2;
    k--;
  }
  k >= 0 ? cout << "Yes" : cout << "No";
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define pb(x) push_back(x)
#define HAYAKU_HAYAKU                                                          \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
int main() {
  HAYAKU_HAYAKU;
  int a, b, c, k;
  cin >> a >> b >> c;
  cin >> k;
  while (k > 0) {
    if (b < a) {
      b = b * 2;
      k--;
    } else if (c < b) {
      c = c * 2;
      k--;
    }
    // cout<<a<<' '<<b<<' '<<c<<' '<<k<<endl;
  }
  (a < b) && (b < c) ? cout << "Yes" : cout << "No";
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; n > i; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using VI = vector<ll>;
using vis = vector<string>;
using vvi = vector<vi>;
int gcd(int a, int b) {
  if (a % b == 0)
    return b;
  return gcd(b, a % b);
}
int main() {
  int a, b, c, k, i = 0;
  cin >> a >> b >> c >> k;
  while (i < k) {
    if (!(b > a)) {
      b *= 2;
    } else if (!(c > b)) {
      c *= 2;
    }
    ++i;
  }
  if (b > a && c > b) {
    cout << "Yes" << endl;
    return 0;
  } else {
    cout << "No" << endl;
    return 0;
  }
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; n > i; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using VI = vector<ll>;
using vis = vector<string>;
using vvi = vector<vi>;
int gcd(int a, int b) {
  if (a % b == 0)
    return b;
  return gcd(b, a % b);
}
int main() {
  int a, b, c, k, i = 0;
  cin >> a >> b >> c >> k;
  while (i < k) {
    if (b <= a) {
      b *= 2;
      ++i;
    } else if (c <= a) {
      c *= 2;
      ++i;
    } else if (b > a && c > b) {
      cout << "Yes" << endl;
      return 0;
    }
  }
  if (b > a && c > b) {
    cout << "Yes" << endl;
    return 0;
  } else {
    cout << "No" << endl;
    return 0;
  }
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi (3.141592653589)
#define mod 1e9 + 7
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define mint(a, b, c) min(c, min(a, b))
#define minf(a, b, c, d) min(d, min(c, min(a, b)))
#define maxt(a, b, c) max(c, max(a, b))
#define maxf(a, b, c, d) max(d, max(c, max(a, b)))
#define vi vector<int>
#define vul vector<unsigned long long int>
#define vll vector<long long int>
#define oset                                                                   \\
  tree<int, null_type, less<int>, rb_tree_tag,                                 \\
       tree_order_statistics_node_update>
#define fast                                                                   \\
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace __gnu_pbds;
using namespace std;
typedef unsigned long long int ul;
typedef long long int ll;
int main() {
  fast;
  int a, b, c;
  cin >> a >> b >> c;
  int k;
  cin >> k;
  int i = 0;
  while (b <= a) {
    b = b * 2;
    i++;
  }
  while (c <= b) {
    c = c * 2;
    i++;
  }
  if (i <= k)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}

Error: TLE

Fixed submission:

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi (3.141592653589)
#define mod 1e9 + 7
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define mint(a, b, c) min(c, min(a, b))
#define minf(a, b, c, d) min(d, min(c, min(a, b)))
#define maxt(a, b, c) max(c, max(a, b))
#define maxf(a, b, c, d) max(d, max(c, max(a, b)))
#define vi vector<int>
#define vul vector<unsigned long long int>
#define vll vector<long long int>
#define oset                                                                   \\
  tree<int, null_type, less<int>, rb_tree_tag,                                 \\
       tree_order_statistics_node_update>
#define fast                                                                   \\
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace __gnu_pbds;
using namespace std;
typedef unsigned long long int ul;
typedef long long int ll;
int main() {
  fast;
  int a, b, c;
  cin >> a >> b >> c;
  int k;
  cin >> k;
  int i = 0;
  while (i < k) {
    while (i < k && b <= a) {
      b = b * 2;
      i++;
    }
    while (i < k && c <= b) {
      c = c * 2;
      i++;
    }
  }
  if (a < b && b < c)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
  int a, b, c, k;
  cin >> a >> b >> c >> k;
  while (k > 0) {
    if (a < b && b < c)
      break;
    while (b <= a && k > 0) {
      b = b * 2;
      k--;
    }
    while (c <= b && k > 0) {
      c = c * 2;
      k--;
    }
  }
  if (a < b && b < c)
    cout << "Yes";
  else
    cout << "No";
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
  int a, b, c, k;
  cin >> a >> b >> c >> k;
  while (k > 0) {
    if (a < b && b < c)
      break;
    while (b < a && k > 0) {
      b = b * 2;
      k--;
    }
    while (c < b && k > 0) {
      c = c * 2;
      k--;
    }
  }
  if (a < b && b < c)
    cout << "Yes";
  else
    cout << "No";
}
Problem p02601 (C++) — buggy submission, verdict: Runtime Error

#include <iostream>

using namespace std;

int main() {
  int a, b, c, k;
  cin >> a >> b >> c >> k;

  int count = 0;

  while (b <= a)
    b = b * 2, count++;
  while (c <= b)
    c = c * 2, count++;

  if (count <= k)
    cout << "Yes";
  else
    cout << "No";
}

Error: -8

Fixed submission:

#include <iostream>
#include <vector>

using namespace std;

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n);
  for (int i = 0; i < n; ++i)
    cin >> v[i];

  long long int temp = 1;

  for (int i = 0; i < k; ++i)
    temp = (temp * v[i]);

  int a = (n - k);
  int b = 0, c = k, count = 0;

  while (count < a) {
    long long int temp1 = (temp / v[b]) * v[c];
    if (temp1 > temp)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;

    temp = temp1;
    c++;
    b++;
    count++;
  }
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

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

#define sws                                                                    \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define fo(i, n) for (int i = 0; i < n; i++)

const int INF = 1e9;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;

int main() {
  sws;

  int a, b, c, k;
  cin >> a >> b >> c >> k;

  while (k > 0 and (c <= a or b <= a or c <= b)) {
    while (k > 0 and (c <= a or c <= b)) {
      c *= 2;
      k--;
    }

    while (k > 0 and b <= a) {
      b *= 2;
      k--;
    }
  }

  if (b > a and c > a and c > b) {
    cout << "Yes\\n";
  } else {
    cout << "No\\n";
  }

  return 0;
}

Error: TLE

Fixed submission:

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

#define sws                                                                    \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define fo(i, n) for (int i = 0; i < n; i++)

const int INF = 1e9;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;

int main() {
  sws;

  int a, b, c, k;
  cin >> a >> b >> c >> k;

  while (k > 0) {
    while (k > 0 and (c <= a or c <= b)) {
      c *= 2;
      k--;
    }

    while (k > 0 and b <= a) {
      b *= 2;
      k--;
    }
  }

  if (b > a and c > a and c > b) {
    cout << "Yes\\n";
  } else {
    cout << "No\\n";
  }

  return 0;
}
Problem p02601 (C++) — buggy submission, verdict: Time Limit Exceeded

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

int main() {
  ll a, b, c, t;
  cin >> a >> b >> c;
  cin >> t;
  ll r = 0;
  while (r < t) {
    if (b > a && c > b) {
      break;
    }
    if (b <= a) {
      b = b * 2;
      r++;
    } else if (c <= b) {
      c = c * 2;
      r++;
    }
  }
  if (b > a && c > b) {
    cout << "Yes";
  } else {
    cout << "No";
  }
  return 0;
}

Error: TLE

Fixed submission:

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

int main() {
  ll a, b, c, t;
  cin >> a >> b >> c;
  cin >> t;
  while (t > 0) {
    if (b > a && c > b) {
      break;
    }
    if (b < a) {
      b = b * 2;
      t--;
    } else if (c < b) {
      c = c * 2;
      t--;
    }
  }
  if (b > a && c > b) {
    cout << "Yes";
  } else {
    cout << "No";
  }
  return 0;
}