<p>Given an integer array <code>nums</code>, return <em>the sum of divisors of the integers in that array that have exactly four divisors</em>. If there is no such integer in the array, return <code>0</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [21,4,7]
<strong>Output:</strong> 32
<strong>Explanation:</strong> 
21 has 4 divisors: 1, 3, 7, 21
4 has 3 divisors: 1, 2, 4
7 has 2 divisors: 1, 7
The answer is the sum of divisors of 21 only.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [21,21]
<strong>Output:</strong> 64
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,4,5]
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
</ul>


class Solution {

public:
    int sumFourDivisors(vector<int>& nums) {
    int n =1e5;
    vector<int>prime(n,1);
    for (int i=2;i<n;i++)
    { 
        if (prime [i]==0)
        continue;
        for (int j=2;j*i<n;j++)
        {
            prime[j*i]=0;
        }
    }
    unordered_map<int,bool>p;
    for (int i=0;i<n;i++)
    {
        if(prime [i]==1)
        p[i]=1;
    }
     int ans=0;
     n=nums.size();
     for (int i=0;i<n;i++)
       {
         for(int j=2;j<=sqrt(nums[i]);j++)
         {
            if(nums[i]%j==0)
            {
                int p1=j;
                int p2=nums[i]/j;
                if (p1!=p2 &&  p.count(p1) && p.count(p2))
                {
                    ans+=1+nums[i]+p1+p2;
                    break;
                }
                if (p.count(p1) && 1ll*p1*p1*p1==nums[i])
                {
                    ans+=1+nums[i]+p1+p1*p1;break;
                }
                 if (p.count(p2) && 1ll*p2*p2*p2==nums[i])
                {
                    ans+=1+nums[i]+p2+p2*p2;break;
                }
            }
         }
       }
        return ans;
    }
};
35300