Problem p02642 (C++)

Buggy submission (status: Time Limit Exceeded):
/*
    Author:zeke

    pass System Test!
    GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s)                                                                \
  ll(s);                                                                       \
  cin >> (s);
#define Scin(s)                                                                \
  ll(s);                                                                       \
  cin >> (s);
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;
// cout << "Case #" << index << " :IMPOSSIBLE";
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  ll n;
  cin >> n;
  vector<bool> dp(1e6 + 100, false);
  V vec(n);
  map<ll, ll> mp;
  map<ll, ll> mp2;
  rep(i, n) {
    cin >> vec[i];
    mp[vec[i]]++;
  }
  sort(all(vec));
  rep(i, n) {
    ll index = 2;
    mp2[vec[i]]++;
    while (vec[i] * index <= 1e6 + 10) {
      dp[vec[i] * index] = true;
      index++;
    }
  }
  ll res = 0;
  rep(i, n) {
    if (dp[vec[i]] || mp[vec[i]] >= 2) {
      //    cout<<vec[i]<<endl;
      res++;
    }
  }
  cout << n - res << endl;
}


Fixed submission:
/*
    Author:zeke

    pass System Test!
    GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s)                                                                \
  ll(s);                                                                       \
  cin >> (s);
#define Scin(s)                                                                \
  ll(s);                                                                       \
  cin >> (s);
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;
// cout << "Case #" << index << " :IMPOSSIBLE";
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  ll n;
  cin >> n;
  vector<bool> dp(1e6 + 100, false);
  V vec(n);
  map<ll, ll> mp;
  map<ll, ll> mp2;
  rep(i, n) {
    cin >> vec[i];
    mp[vec[i]]++;
  }
  sort(all(vec));
  rep(i, n) {
    ll index = 2;
    if (mp2[vec[i]] == 1 || dp[vec[i]]) {
      continue;
    }
    mp2[vec[i]]++;
    while (vec[i] * index <= 1e6 + 10) {
      dp[vec[i] * index] = true;
      index++;
    }
  }
  ll res = 0;
  rep(i, n) {
    if (dp[vec[i]] || mp[vec[i]] >= 2) {
      //    cout<<vec[i]<<endl;
      res++;
    }
  }
  cout << n - res << endl;
}