<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 {
    vector<int> parent;
public:
    int find(int x){
        if(parent[x]==-1) return x;
        return parent[x]=find(parent[x]);
    }
    void unio(int x,int y){
        int xd=find(x);
        int yd=find(y);
        if(xd!=yd){
            parent[xd]=yd;
        }
    }
    int largestComponentSize(vector<int>& A) {
        parent.resize(1000000+1,-1);
        for(auto a:A){
            int n=a;
            int count=0;
            while(n%2==0){
                n>>=1;
                count++;
            }
            if(count){
                unio(a,2);
            }
            for(int i=3;i<=sqrt(n);i++){
                int c=0;
                while(n%i==0){
                    n=n/i;
                    c++;
                }
                if(c){
                    unio(a,i);
                }
            }
            if(n>2){
                unio(a,n);
            }
        }
        unordered_map<int,int> mp;
        for(auto a:A){
            mp[find(a)]++;
        }
        int ans=1;
        for(auto m:mp){
            ans=max(ans,m.second);
        }
        return ans;
    }
};
273658