Boston numbers

Submission #6688380
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;


/*void c_p_c()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}*/

int32_t main()
{
    //c_p_c();
    vi primes;
    bitset<100000> b;
    b.set();
    int i, j, n, sum = 0, temp, sum1 = 0;
    for (i = 2; i < 100000; i++)
    {
        if (b[i])
        {
            primes.pb(i);
            b[i] = 0;
            for (j = i * i; j < 100000; j = j + i)
                b[i] = 0;
        }
    }
    cin >> n;
    temp = n;
    for (auto x : primes)
    {
        if (x * x < n)
        {
            if (n % x == 0)
            {
                int temp2 = x, l = 0;
                while (temp2 > 0)
                {
                    l = l + temp2 % 10;
                    temp2 = temp2 / 10;
                }
                while (n % x == 0)
                {
                    n = n / x;
                    sum = sum + l;
                }
            }
        }
        else
            break;
    }
    if (n != 1)
    {
        int l = 0;
        while (n > 0)
        {
            l = l + n % 10;
            n = n / 10;
        }
        sum = sum + l;
    }
    while (temp > 0)
    {
        sum1 += temp % 10;
        temp = temp / 10;
    }
    //cout << sum << endl;
    if (sum == sum1)
        cout << 1 << endl;
    else
        cout << 0 << endl;

}