Problem p04022 (C++)

Buggy submission (status: Runtime Error):
/*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).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)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c)                                                         \
  (sort(c.begin(), c.end()),                                                   \
   c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET                                                                  \
  int ___T;                                                                    \
  scanf("%d", &___T);                                                          \
  for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
  _W(x.F);
  putchar(' ');
  _W(x.S);
}
template <class T> void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin())
      putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
#ifdef HOME
#define DEBUG(...)                                                             \
  {                                                                            \
    printf("# ");                                                              \
    printf(__VA_ARGS__);                                                       \
    puts("");                                                                  \
  }
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
  x = (x + v) % MOD;
  if (x < 0)
    x += MOD;
}
/*}}}*/
const int SIZE = 1e5 + 10;
int p[SIZE];
vector<int> pp;
void prime_init() {
  for (int i = 2; i < SIZE; i++) {
    if (!p[i]) {
      pp.PB(i);
      for (int j = i; j < SIZE; j += i) {
        if (!p[j])
          p[j] = i;
      }
    }
  }
}
bool is_prime(int x) { return p[x] == x; }
int one_cnt;
int an;
VPLL d;
void go(LL x) {
  LL v = pow((LD)x, 1. / 3);
  while (v * v * v < x)
    v++;
  if (v * v * v == x) {
    one_cnt++;
    return;
  }
  LL inv = 1;
  LL me = 1;
  for (int i = 0; pp[i] * pp[i] * pp[i] <= x; i++) {
    if (x % pp[i] == 0) {
      int cnt = 1;
      x /= pp[i];
      while (x % pp[i] == 0) {
        cnt++;
        x /= pp[i];
      }
      cnt %= 3;
      if (cnt == 1) {
        inv *= pp[i] * pp[i];
        if (inv > 10000000000LL) {
          an++;
          return;
        }
        me *= pp[i];
      } else if (cnt == 2) {
        inv *= pp[i];
        if (inv > 10000000000LL) {
          an++;
          return;
        }
        me *= pp[i] * pp[i];
      }
    }
  }
  if (x != 1) {
    LL v = sqrt((LD)x);
    if (v * v == x) {
      me *= x;
      inv *= v;
    } else {
      me *= x;
      if (inv > 10000000000LL / x * x) {
        an++;
        return;
      }
      inv *= x * x;
    }
  }
  if (inv > 10000000000LL) {
    an++;
    return;
  }
  if (me < inv) {
    d.PB(MP(me, 1));
  } else {
    d.PB(MP(inv, 0));
  }
}
int main() {
  prime_init();
  int N;
  R(N);
  REP(i, N) {
    LL x;
    R(x);
    go(x);
  }
  sort(ALL(d));
  for (int i = 0, j; i < SZ(d); i = j) {
    int cnt[2] = {};
    for (j = i; j < SZ(d) && d[j].F == d[i].F; j++) {
      cnt[d[j].S]++;
    }
    an += max(cnt[0], cnt[1]);
  }
  an += (one_cnt > 0);
  W(an);
  return 0;
}


Fixed submission:
/*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).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)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c)                                                         \
  (sort(c.begin(), c.end()),                                                   \
   c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET                                                                  \
  int ___T;                                                                    \
  scanf("%d", &___T);                                                          \
  for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
  _W(x.F);
  putchar(' ');
  _W(x.S);
}
template <class T> void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin())
      putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
#ifdef HOME
#define DEBUG(...)                                                             \
  {                                                                            \
    printf("# ");                                                              \
    printf(__VA_ARGS__);                                                       \
    puts("");                                                                  \
  }
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
  x = (x + v) % MOD;
  if (x < 0)
    x += MOD;
}
/*}}}*/
const int SIZE = 1e5 + 10;
int p[SIZE];
vector<int> pp;
void prime_init() {
  for (int i = 2; i < SIZE; i++) {
    if (!p[i]) {
      pp.PB(i);
      for (int j = i; j < SIZE; j += i) {
        if (!p[j])
          p[j] = i;
      }
    }
  }
}
bool is_prime(int x) { return p[x] == x; }
int one_cnt;
int an;
VPLL d;
void go(LL x) {
  LL v = pow((LD)x, 1. / 3);
  while (v * v * v < x)
    v++;
  if (v * v * v == x) {
    one_cnt++;
    return;
  }
  LL inv = 1;
  LL me = 1;
  for (int i = 0; (LL)pp[i] * pp[i] * pp[i] <= x; i++) {
    if (x % pp[i] == 0) {
      int cnt = 1;
      x /= pp[i];
      while (x % pp[i] == 0) {
        cnt++;
        x /= pp[i];
      }
      cnt %= 3;
      if (cnt == 1) {
        inv *= pp[i] * pp[i];
        if (inv > 10000000000LL) {
          an++;
          return;
        }
        me *= pp[i];
      } else if (cnt == 2) {
        inv *= pp[i];
        if (inv > 10000000000LL) {
          an++;
          return;
        }
        me *= pp[i] * pp[i];
      }
    }
  }
  if (x != 1) {
    LL v = sqrt((LD)x);
    if (v * v == x) {
      me *= x;
      inv *= v;
    } else {
      me *= x;
      if (inv > 10000000000LL / x * x) {
        an++;
        return;
      }
      inv *= x * x;
    }
  }
  if (inv > 10000000000LL) {
    an++;
    return;
  }
  if (me < inv) {
    d.PB(MP(me, 1));
  } else {
    d.PB(MP(inv, 0));
  }
}
int main() {
  prime_init();
  int N;
  R(N);
  REP(i, N) {
    LL x;
    R(x);
    go(x);
  }
  sort(ALL(d));
  for (int i = 0, j; i < SZ(d); i = j) {
    int cnt[2] = {};
    for (j = i; j < SZ(d) && d[j].F == d[i].F; j++) {
      cnt[d[j].S]++;
    }
    an += max(cnt[0], cnt[1]);
  }
  an += (one_cnt > 0);
  W(an);
  return 0;
}