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

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
// #pragma GCC target("avx,avx2")
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")

// # include <x86intrin.h>
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i, x, y) for (ll i = x; i <= y; i++)
#define FOr(i, x, y) for (ll i = x; i >= y; i--)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to... Red

inline void Input_Output() {
  // freopen(".in", "r", stdin);
  // freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m, k;
int cnt[N];
string s;
int a[N];
vector<int> g[N];
int u[N];
int ans, res;
int cur;

int main() {
  SpeedForce;
  cin >> n;

  For(a, -300, 300) For(b, -300, 300) {
    int dif = a - b;

    if (dif != 0 && n % dif == 0) {
      ld now = a * (ld)a * (ld)a * (ld)a + a * (ld)a * (ld)a * (ld)b +
               a * (ld)a * (ld)b * (ld)b + a * (ld)b * (ld)b * (ld)b +
               b * (ld)b * (ld)b * (ld)b;
      if (now < inf && (ll)now == n / dif) {
        cout << a << ' ' << b << '\\n';
        exit(0);
      }
    }
  }

  assert(0);
  return Accepted;
}

// B...a

Error: WA

Fixed submission:

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
// #pragma GCC target("avx,avx2")
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")

// # include <x86intrin.h>
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i, x, y) for (ll i = x; i <= y; i++)
#define FOr(i, x, y) for (ll i = x; i >= y; i--)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to... Red

inline void Input_Output() {
  // freopen(".in", "r", stdin);
  // freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m, k;
int cnt[N];
string s;
int a[N];
vector<int> g[N];
int u[N];
int ans, res;
int cur;

int main() {
  SpeedForce;
  cin >> n;

  For(a, -100, 100) For(b, -100, 100) {
    int dif = a - b;
    if (dif != 0 && n % dif == 0) {
      ld now = a * (ld)a * (ld)a * (ld)a + a * (ld)a * (ld)a * (ld)b +
               a * (ld)a * (ld)b * (ld)b + a * (ld)b * (ld)b * (ld)b +
               b * (ld)b * (ld)b * (ld)b;
      // cout << now << '\\n';
      if (now < inf && (ll)now == n / dif) {
        cout << a << ' ' << b << '\\n';
        exit(0);
      }
    }
  }
  assert(0);
  cout << "WHAT";

  return Accepted;
}

// B...a