<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 {
public:
int find(int a,vector<int> &p){
    if(a == p[a])return a;
    return p[a] = find(p[a],p);
}
void unon(int a,int b,vector<int> &s,vector<int> &p){
    int x = find(a,p),y = find(b,p);
    if(x != y){
        if(s[y]<s[x])swap(x,y);
        p[x] = y;
        s[y] += s[x];
    }
}
    int largestComponentSize(vector<int>& nums) {
        int n = 1e5+1,i;
        vector<int> s(n),p(n);
        for(i = 0; i < n; i++){
            s[i] = 1, p[i] = i;
        }
        for(auto &j: nums){
            for(i = 2; i <= sqrt(j); i++){
                if(j%i==0){
                    unon(i,j,s,p);
                    unon(j/i,j,s,p);
                }
            }
        }
        n = 0;
        unordered_map<int,int> mp;
        for(auto &i: nums){
            mp[find(i,p)]++;
            n = max(n,mp[find(i,p)]);
        }
        return n;
    }
};
136358