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

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// using namespace __gnu_pbds;
#define fastio()                                                               \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define fill(a, val) memset(a, val, sizeof(a))
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl "\\n"
#define int long long
#define printclock                                                             \\
  cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\\n";
const ll MOD = 1000 * 1000 * 1000 + 7;
const ll INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const ll MOD2 = 998244353;
const ll N = 1000 * 100 + 10;
const ll N2 = 70;
const ld PI = 3.141592653589793;
// template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
ll gcd(ll a, ll b) {
  if (!b)
    return a;
  return gcd(b, a % b);
}
ll power(ll x, ll y, ll p = LLONG_MAX) {
  ll res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1)
      res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
void solve() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
vector<pair<ll, ll>> p;
void prime(ll n) {

  ll count = 0;

  // count the number of times 2 divides

  while (!(n % 2)) {

    n >>= 1; // equivalent to n=n/2;

    count++;
  }

  // if 2 divides it

  if (count) {
    auto pop = mp(2, count);
    p.pb(pop);
  }

  // check for all the possible numbers that can

  // divide it

  for (ll i = 3; i <= sqrt(n); i += 2) {

    count = 0;

    while (n % i == 0) {

      count++;

      n = n / i;
    }

    if (count) {
      auto pop = mp(i, count);
      p.pb(pop);
    }
  }

  // if n at the end is a prime number.

  if (n > 2) {
    auto pop = mp(n, 1);
    p.pb(pop);
  }
}
signed main() {
  fastio();
  // cout<<fixed<<setprecision(20);
  // CHECK for LONG LONG and LONG DOUBLE
  //*comment for all except cc/cf
  ll n;
  cin >> n;
  prime(n);
  sort(p.begin(), p.end());
  ll ans = 0;
  if (n == 1) {
    cout << ans << endl;
  } else {
    ll ans = 0;
    for (ll i = 0; i < p.size(); i++) {
      ll k = p[i].ff;
      if (n == 1) {
        break;
      }
      while (n % k == 0) {
        n /= k;
        ans++;
        k *= p[i].ff;
      }
    }
    cout << ans << endl;
  }
  // printclock;
  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// using namespace __gnu_pbds;
#define fastio()                                                               \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define fill(a, val) memset(a, val, sizeof(a))
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl "\\n"
#define int long long
#define printclock                                                             \\
  cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\\n";
const ll MOD = 1000 * 1000 * 1000 + 7;
const ll INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const ll MOD2 = 998244353;
const ll N = 1000 * 100 + 10;
const ll N2 = 70;
const ld PI = 3.141592653589793;
// template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
ll gcd(ll a, ll b) {
  if (!b)
    return a;
  return gcd(b, a % b);
}
ll power(ll x, ll y, ll p = LLONG_MAX) {
  ll res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1)
      res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
void solve() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
vector<pair<ll, ll>> p;
void prime(ll n) {

  ll count = 0;

  // count the number of times 2 divides

  while (!(n % 2)) {

    n >>= 1; // equivalent to n=n/2;

    count++;
  }

  // if 2 divides it

  if (count) {
    auto pop = mp(2, count);
    p.pb(pop);
  }

  // check for all the possible numbers that can

  // divide it

  for (ll i = 3; i <= sqrt(n); i += 2) {

    count = 0;

    while (n % i == 0) {

      count++;

      n = n / i;
    }

    if (count) {
      auto pop = mp(i, count);
      p.pb(pop);
    }
  }

  // if n at the end is a prime number.

  if (n > 2) {
    auto pop = mp(n, 1);
    p.pb(pop);
  }
}
signed main() {
  fastio();
  // cout<<fixed<<setprecision(20);
  // CHECK for LONG LONG and LONG DOUBLE
  //*comment for all except cc/cf
  ll n;
  cin >> n;
  prime(n);
  sort(p.begin(), p.end());
  ll ans = p.size();
  for (ll i = 0; i < p.size(); i++) {
    n /= p[i].ff;
  }
  for (ll i = 0; i < p.size(); i++) {
    if (n == 1) {
      break;
    }
    ll k = p[i].ff * p[i].ff;
    while (k <= n) {
      // cout<<k<<endl;
      if (n % k == 0) {
        n /= k;
        k *= p[i].ff;
        ans++;
      }
      if (n == 1) {
        goto strt;
      }
    }
  }
strt:
  cout << ans << endl;
  // printclock;
  return 0;
}