Class - 31 : Task - 2

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mx=1e8+123;
bitset<mx> is_prime;
vector<ll>v;
void prime_gen(ll n)
{
    is_prime[2]=1;
    for(ll i=3;i<=n;i+=2)
    {
         is_prime[i]=1;
    }
    for(ll i=3;i*i<=n;i+=2)
    {
        if(is_prime[i]==1)
        {
            for(ll j=i*i;j<=n;j+=2*i)
            {
                is_prime[j]=0;
            }
        }
    }
    v.push_back(2);
    for(int i=3;i<=n;i+=2)
    {
        if(is_prime[i]==1) v.push_back(i);
    }
}
ll SOD(ll n)
{
    ll ans=1;
    for(auto u:v)
    {
        if(1ll*u*u>n) break;
        if(n%u==0)
        {
            ll p=1;
            while(n%u==0)
            {
                p*=u;
                n/=u;
            }
            p*=u;
            ll res=(p-1)/(u-1);
            ans*=res;
        }
    }
    if(n>1) ans*=(1+n);
    return ans;
}
int main()
{
    prime_gen(1e8);
    int t;
    cin>>t;
    while(t--)
    {
        ll n;
        cin>>n;
       ll ans=SOD(n);
        cout<<ans-n<<endl;
    }
}