Problem p02574 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pp pair<pair<ll, ll>, pair<ll, ll>>
#define pll pair<ll, ll>
#define ppll pair<ll, pll>
#define pdd pair<double, double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define fi first
#define sc second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
#define pq priority_queue<ll>
#define pqg priority_queue<ll, vector<ll>, greater<ll>>
#define LB(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define ERASE(v)                                                               \
  sort(v.begin(), v.end());                                                    \
  v.erase(unique(v.begin(), v.end()), v.end())
#define int ll
#define FOR(i, a, b) for (ll i = a; i <= b; i++)
// #define ll int
#define PN 1
using namespace std;
const ll MAXR = 1000000;
const ll INF = 1 << 29;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const int MAX_V = 500;
// const ll mod = 998244353;
const ll MAX = 2100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

map<ll, ll> res;

bool ok1 = true, ok2 = true;
void prime_factor(ll n) {
  map<ll, ll> res2;
  for (ll i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      res2[i]++;
      n /= i;
    }
  }
  if (n != 1)
    res2[n]++;

  for (auto i : res2) {
    if (res[i.fi] > 0) {
      ok1 = false;
    }
    res[i.fi] += i.sc;
  }
  return;
}

void solve() {
  ll n;
  ll a[1000010];
  cin >> n;
  rep(i, n) cin >> a[i];
  repr(i, n) {
    prime_factor(a[i]);
    // cout<<i<<endl;
    if (ok1 == false)
      break;
  }

  if (ok1 == true) {
    cout << "pairwise coprime" << endl;
    return;
  }

  for (auto i : res) {
    // cout<<i.fi<<" "<<i.sc<<endl;
    // if(i.sc < n) continue;
    ll cnt = 0;
    rep(j, n) {
      if (a[j] % i.fi == 0)
        cnt++;
    }
    if (cnt == n)
      ok2 = false;
    if (ok2 == false)
      break;
  }

  if (ok2) {
    cout << "setwise coprime" << endl;

    return;
  }

  cout << "not coprime" << endl;
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);

  ll t = 1;
  rep(i, t) { solve(); }

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pp pair<pair<ll, ll>, pair<ll, ll>>
#define pll pair<ll, ll>
#define ppll pair<ll, pll>
#define pdd pair<double, double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define fi first
#define sc second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
#define pq priority_queue<ll>
#define pqg priority_queue<ll, vector<ll>, greater<ll>>
#define LB(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define ERASE(v)                                                               \
  sort(v.begin(), v.end());                                                    \
  v.erase(unique(v.begin(), v.end()), v.end())
#define int ll
#define FOR(i, a, b) for (ll i = a; i <= b; i++)
// #define ll int
#define PN 1
using namespace std;
const ll MAXR = 1000000;
const ll INF = 1 << 29;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const int MAX_V = 500;
// const ll mod = 998244353;
const ll MAX = 2100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

map<ll, ll> res;

bool ok1 = true, ok2 = true;
void prime_factor(ll n) {
  map<ll, ll> res2;
  for (ll i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      res2[i]++;
      n /= i;
    }
  }
  if (n != 1)
    res2[n]++;

  for (auto i : res2) {
    if (res[i.fi] > 0) {
      ok1 = false;
    }
    res[i.fi] += i.sc;
  }
  return;
}

void solve() {
  ll n;
  ll a[1000010];
  cin >> n;
  rep(i, n) cin >> a[i];
  repr(i, n) {
    prime_factor(a[i]);
    // cout<<i<<endl;
    if (ok1 == false)
      break;
  }

  if (ok1 == true) {
    cout << "pairwise coprime" << endl;
    return;
  }

  for (auto i : res) {
    // cout<<i.fi<<" "<<i.sc<<endl;
    // if(i.sc < n) continue;
    ll cnt = 0;
    rep(j, n) {
      if (a[j] % i.fi == 0)
        cnt++;
      else
        break;
    }
    if (cnt == n)
      ok2 = false;
    if (ok2 == false)
      break;
  }

  if (ok2) {
    cout << "setwise coprime" << endl;

    return;
  }

  cout << "not coprime" << endl;
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);

  ll t = 1;
  rep(i, t) { solve(); }

  return 0;
}