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

#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;

#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost;
using ml = multiprecision::cpp_int;
using md = multiprecision::cpp_dec_float_100;
#endif

/***** type *****/
using ll = long long;
using ld = long double;
using pll = pair<long long, long long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define coutld cout << fixed << setprecision(10) // cout double
#define output(x)                                                              \\
  do {                                                                         \\
    cout << x << endl;                                                         \\
    exit(0);                                                                   \\
  } while (0)
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define fori(i, ...)                                                           \\
  if (ll i = -1)                                                               \\
    for (__VA_ARGS__)                                                          \\
      if (i++, 1)
#define each(i, e, c) fori(i, auto &&e : c) // for each
/***** const value *****/
#define llong_max 9223372036854775807 // 9 * 10^18
#define ldbl_max 1.79769e+308         // 1.7 * 10^308
#define pi 3.1415926535897932         // 3.14 ...
/***** lambda *****/
auto Ceil = [] // if (a % b != 0) return a / b + 1;
    (auto x) { return (ll)ceil(x); };
auto Count = [] // long long count value
    (auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = [] // char to number
    (auto c) { return (ll)c - (ll)'0'; };
auto LtoC = [] // number to char
    (auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
    (auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
    (auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
    (auto n) { return (ll)pow(10, n); };
auto Size = [] // long long collection size
    (auto &c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
    (auto b, auto e) { return accumulate(b, e, 0LL); };

/***** operator *****/
template <class T, class S>
pair<T, S> operator+(pair<T, S> l, pair<T, S> r) { // pair<T, S> + pair<T, S>
  return {l.first + r.first, l.second + r.second};
}
template <class T, class S>
pair<T, S> operator-(pair<T, S> l, pair<T, S> r) { // pair<T, S> - pair<T, S>
  return {l.first - r.first, l.second - r.second};
}

/***** template *****/
template <class T>
void MakeVVT(ll ys, ll xs, vvt<T> &v,
             T fill = T()) { // vector<vector<T>> resize + fill
  v.resize(ys);
  rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T>
void MakeVVVT(ll zs, ll ys, ll xs, vvvt<T> &v,
              T fill = T()) { // vector<vector<vector<T>>> resize + fill
  v.resize(zs);
  rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T>
void InputVVT(ll ys, ll xs, vvt<T> &v,
              T fix = T()) { // input vector<vector<T>> (T != struct) + fix
  MakeVVT(ys, xs, v, fix);
  rep(y, 0, ys) rep(x, 0, xs) {
    cin >> v[y][x];
    v[y][x] += fix;
  }
}
template <class T>
void InputVVVT(
    ll zs, ll ys, ll xs, vvvt<T> &v,
    T fix = T()) { // input vector<vector<vector<T>>> (T != struct) + fix
  v.resize(zs);
  rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}

/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/

namespace NyaGadget {}

namespace NyaGadget {
/***** 素因数分解ライブラリ *****/
/**
@note
計算量O(√n)でnを素因数分解する。
ans[i]がnだったとき、素因数分解して得られた積のなかにn個の素数iが含まれていることを表す。
例えば n=12 のとき ans[2]=2、ans[3]=1 となるので 12=2×2×3 と分かる。
**/
void PrimeFactorization(long long n, std::map<long long, long long> &ans) {
  for (auto i = 2LL; i * i <= n; i++) {
    while (n % i == 0)
      ans[i]++, n /= i;
  }
  if (n != 1)
    ans[n]++;
}

long long PrimeFactorization(long long n, long long x) {
  long long ans = 0;
  while (n % x == 0) {
    ans++;
    n /= x;
  }
  return ans;
}
} // namespace NyaGadget

void PrimeTable(long long n, std::vector<bool> &res) {
  res.resize(n + 1, true);
  res[0] = res[1] = false;
  for (auto i = 2LL; i * i <= n; i++) {
    if (!res[i])
      continue;
    for (auto j = 2LL * i; j <= n; j += i)
      res[j] = false;
  }
}

/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/

using namespace NyaGadget;
// using mll = NT_ModLL< 1000000007 >;
// using mll = ModLL< 998244353 >;

int main(void) {
  ll N;
  cin >> N;
  vt<ll> A(N);
  each(i, e, A) cin >> e;

  vt<ll> doublecount(Pow10(6) + 10);
  each(i, e, A) {
    if (e != 1)
      doublecount[e]++;
  }
  bool notpc = false;
  each(i, e, doublecount) if (1 < e) notpc = true;

  if (!notpc) {
    vt<ll> count(Pow10(6) + 10);
    vt<bool> avalue(Pow10(6) + 10, false);
    each(i, e, A) avalue[e] = true;
    rep(i, 2, Pow10(6) + 1) {
      ll j = i;
      while (j <= Pow10(6)) {
        if (avalue[j])
          count[i]++;
        j += i;
      }
    }
    each(i, e, count) {
      if (1 < e)
        break;
      if (i == Size(count) - 1)
        output("pairwise coprime");
    }
  }

  ll test = A[0];
  each(i, e, A) test = gcd(test, e);
  if (test == 1)
    output("setwise coprime");
  else
    output("not coprime");

  return 0;
}


Error: -11

Fixed submission:

#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;

#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost;
using ml = multiprecision::cpp_int;
using md = multiprecision::cpp_dec_float_100;
#endif

/***** type *****/
using ll = long long;
using ld = long double;
using pll = pair<long long, long long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define coutld cout << fixed << setprecision(10) // cout double
#define output(x)                                                              \\
  do {                                                                         \\
    cout << x << endl;                                                         \\
    exit(0);                                                                   \\
  } while (0)
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define fori(i, ...)                                                           \\
  if (ll i = -1)                                                               \\
    for (__VA_ARGS__)                                                          \\
      if (i++, 1)
#define each(i, e, c) fori(i, auto &&e : c) // for each
/***** const value *****/
#define llong_max 9223372036854775807 // 9 * 10^18
#define ldbl_max 1.79769e+308         // 1.7 * 10^308
#define pi 3.1415926535897932         // 3.14 ...
/***** lambda *****/
auto Ceil = [] // if (a % b != 0) return a / b + 1;
    (auto x) { return (ll)ceil(x); };
auto Count = [] // long long count value
    (auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = [] // char to number
    (auto c) { return (ll)c - (ll)'0'; };
auto LtoC = [] // number to char
    (auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
    (auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
    (auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
    (auto n) { return (ll)pow(10, n); };
auto Size = [] // long long collection size
    (auto &c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
    (auto b, auto e) { return accumulate(b, e, 0LL); };

/***** operator *****/
template <class T, class S>
pair<T, S> operator+(pair<T, S> l, pair<T, S> r) { // pair<T, S> + pair<T, S>
  return {l.first + r.first, l.second + r.second};
}
template <class T, class S>
pair<T, S> operator-(pair<T, S> l, pair<T, S> r) { // pair<T, S> - pair<T, S>
  return {l.first - r.first, l.second - r.second};
}

/***** template *****/
template <class T>
void MakeVVT(ll ys, ll xs, vvt<T> &v,
             T fill = T()) { // vector<vector<T>> resize + fill
  v.resize(ys);
  rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T>
void MakeVVVT(ll zs, ll ys, ll xs, vvvt<T> &v,
              T fill = T()) { // vector<vector<vector<T>>> resize + fill
  v.resize(zs);
  rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T>
void InputVVT(ll ys, ll xs, vvt<T> &v,
              T fix = T()) { // input vector<vector<T>> (T != struct) + fix
  MakeVVT(ys, xs, v, fix);
  rep(y, 0, ys) rep(x, 0, xs) {
    cin >> v[y][x];
    v[y][x] += fix;
  }
}
template <class T>
void InputVVVT(
    ll zs, ll ys, ll xs, vvvt<T> &v,
    T fix = T()) { // input vector<vector<vector<T>>> (T != struct) + fix
  v.resize(zs);
  rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}

/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/

namespace NyaGadget {}

namespace NyaGadget {
/***** 素因数分解ライブラリ *****/
/**
@note
計算量O(√n)でnを素因数分解する。
ans[i]がnだったとき、素因数分解して得られた積のなかにn個の素数iが含まれていることを表す。
例えば n=12 のとき ans[2]=2、ans[3]=1 となるので 12=2×2×3 と分かる。
**/
void PrimeFactorization(long long n, std::map<long long, long long> &ans) {
  for (auto i = 2LL; i * i <= n; i++) {
    while (n % i == 0)
      ans[i]++, n /= i;
  }
  if (n != 1)
    ans[n]++;
}

long long PrimeFactorization(long long n, long long x) {
  long long ans = 0;
  while (n % x == 0) {
    ans++;
    n /= x;
  }
  return ans;
}
} // namespace NyaGadget

void PrimeTable(long long n, std::vector<bool> &res) {
  res.resize(n + 1, true);
  res[0] = res[1] = false;
  for (auto i = 2LL; i * i <= n; i++) {
    if (!res[i])
      continue;
    for (auto j = 2LL * i; j <= n; j += i)
      res[j] = false;
  }
}

/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/

using namespace NyaGadget;
// using mll = NT_ModLL< 1000000007 >;
// using mll = ModLL< 998244353 >;

int main(void) {
  ll N;
  cin >> N;
  vt<ll> A(N);
  each(i, e, A) cin >> e;

  vt<ll> count(Pow10(6) + 10);
  vt<bool> avalue;
  each(i, e, A) avalue[e] = true;
  rep(i, 2, Pow10(6) + 1) {
    ll j = i;
    while (j <= Pow10(6)) {
      if (avalue[j])
        count[i]++;
      j += i;
    }
  }
  each(i, e, count) {
    if (1 < e)
      break;
    if (i == Size(count) - 1)
      output("pairwise coprime");
  }

  ll test = A[0];
  each(i, e, A) test = gcd(test, e);
  if (test == 1)
    output("setwise coprime");
  else
    output("not coprime");

  return 0;
}