Problem p02574 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
const double eps = 1e-8;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T, typename U> T pow_(T a, U b) {
  return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.F << " " << p.S;
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  rep(i, sz(vec)) {
    if (i)
      os << " ";
    os << vec[i];
  }
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
  for (auto si : s)
    os << si << " ";
  return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
  rep(j, sz(v)) is >> v[j];
  return is;
}
template <class T, class T2> inline void add(T &a, T2 b) {
  (a += (b % mod + mod)) %= mod;
}
template <class T> void operator+=(vector<T> &v, vector<T> v2) {
  rep(i, sz(v2)) v.eb(v2[i]);
}

void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12);
  int T;
  T = 1;
  while (T--)
    solve();
}

random_device rnd;
mt19937 mt(rnd());
uniform_int_distribution<> rand100(1, 10);
#define rm rand100(mt)

// https://atcoder.jp/contests/abc177/submissions/16361208
void solve() {
  int n;
  // n = rm;
  cin >> n;
  vector<int> a;
  int z = 0;
  rep(i, n) {
    int a_;
    // a_ = rm;
    cin >> a_;
    if (a_ == 1)
      ++z;
    else
      a.eb(a_);
  }
  // cerr << n << "  " << a << endl;

  if (z == n) {
    cout << "pairwise coprime" << endl;
    return;
  }

  int m = sz(a);
  int stc = a[0];
  rep(i, m) stc = gcd(stc, a[i]);
  if (z == 0 && stc != 1) {
    cout << "not coprime" << endl;
    return;
  }

  map<int, int> mp;

  rep(i, m) {
    int a_ = a[i];
    for (int j = 2; j * j <= a[i]; ++j) {
      int cnt = 0;
      while (a_ % j == 0) {
        ++cnt;
        a_ /= j;
      }
      if (cnt) {
        if (mp.count(j)) {
          cout << "setwise coprime" << endl;
          return;
        }
        mp[j] = cnt;
      }
    }
    if (a_ != 1) {
      if (mp.count(a_)) {
        cout << "setwise coprime" << endl;
        return;
      }
      mp[a_] = 1;
    }
  }

  cout << "pairwise coprime" << endl;
}

/*
 5
 5 2 7 9 1
 */


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
const double eps = 1e-8;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T, typename U> T pow_(T a, U b) {
  return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.F << " " << p.S;
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  rep(i, sz(vec)) {
    if (i)
      os << " ";
    os << vec[i];
  }
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
  for (auto si : s)
    os << si << " ";
  return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
  rep(j, sz(v)) is >> v[j];
  return is;
}
template <class T, class T2> inline void add(T &a, T2 b) {
  (a += (b % mod + mod)) %= mod;
}
template <class T> void operator+=(vector<T> &v, vector<T> v2) {
  rep(i, sz(v2)) v.eb(v2[i]);
}

void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12);
  int T;
  T = 1;
  while (T--)
    solve();
}

void solve() {
  int n;
  cin >> n;
  vector<int> a;
  int z = 0;
  rep(i, n) {
    int a_;
    cin >> a_;
    if (a_ == 1)
      ++z;
    else
      a.eb(a_);
  }

  if (z == n) {
    cout << "pairwise coprime" << endl;
    return;
  }

  int m = sz(a);
  int stc = a[0];
  rep(i, m) stc = gcd(stc, a[i]);
  if (z == 0 && stc != 1) {
    cout << "not coprime" << endl;
    return;
  }

  map<int, int> mp;
  ll sum = 0;

  cerr << m << endl;
  rep(i, m) {
    int a_ = a[i];
    // cerr << "a_ " << a_ << endl;
    for (int j = 2; j * j <= a[i]; ++j) {
      int cnt = 0;
      while (a_ % j == 0) {
        ++cnt;
        ++sum;
        a_ /= j;
      }
      chmax(mp[j], cnt);
    }
    // cerr << a_ << " " << sum << endl;
    if (a_ != 1) {
      chmax(mp[a_], 1); // debuged
      ++sum;
    }
    // cerr << "a_ sum " << a_ << " " << sum << endl;
  }

  ll sum2 = 0;
  for (auto e : mp)
    sum2 += e.S;
  // cerr << sum << " " << sum2 << endl;

  if (sum == sum2)
    cout << "pairwise coprime" << endl;
  else
    cout << "setwise coprime" << endl;
}