<p>You are given an integer array of unique positive integers <code>nums</code>. Consider the following graph:</p>

<ul>
	<li>There are <code>nums.length</code> nodes, labeled <code>nums[0]</code> to <code>nums[nums.length - 1]</code>,</li>
	<li>There is an undirected edge between <code>nums[i]</code> and <code>nums[j]</code> if <code>nums[i]</code> and <code>nums[j]</code> share a common factor greater than <code>1</code>.</li>
</ul>

<p>Return <em>the size of the largest connected component in the graph</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/01/ex1.png" style="width: 500px; height: 97px;" />
<pre>
<strong>Input:</strong> nums = [4,6,15,35]
<strong>Output:</strong> 4
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/01/ex2.png" style="width: 500px; height: 85px;" />
<pre>
<strong>Input:</strong> nums = [20,50,9,63]
<strong>Output:</strong> 2
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/01/ex3.png" style="width: 500px; height: 260px;" />
<pre>
<strong>Input:</strong> nums = [2,3,6,7,4,12,21,39]
<strong>Output:</strong> 8
</pre>

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

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
	<li>All the values of <code>nums</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
    void init(vector<int> &par)
    {
        for(int i=0;i<=100001;i++)
            par.push_back(i);
    }
    
    int findPar(int u,vector<int> &par)
    {
        if(par[u] == u) return u;
        
        return par[u] = findPar(par[u],par);
    }
    
    void unn(int u,int v,vector<int> &par)
    {
        int x = findPar(u,par) , y = findPar(v,par);
        if(x != y) par[x] = y;
    }
public:
    int largestComponentSize(vector<int>& nums) {
        vector<int> par;
        init(par);
        
        for(auto &val : nums)
        {
            for(int k=2;k<=sqrt(val);k++)
            {
                if(val%k == 0)
                {
                    unn(val,k,par);
                    unn(val,val/k,par);
                }
            }
        }
        
        int cnt = 0;
        unordered_map<int,int> mp;
        
        for(auto &val : nums)
        {
            int x = findPar(val,par);
            mp[x]++;
            cnt = max(cnt,mp[x]);
        }
        
        return cnt;
    }
};
156953