<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>

#define ll int
class Solution {
    ll findpar(ll node,vector<ll>& par){
        if(node==par[node]){
            return node;
        }
        return par[node]=findpar(par[node],par);
    }
    void unio(ll u,ll v,vector<ll>& par){
        u=findpar(u,par);
        v=findpar(v,par);
        if(u==v){
            return;
        }
        par[u]=v;
    }
public:
    int largestComponentSize(vector<int>& nums) {
        vector<ll> par(1e5+1,0);
        for(ll i=1;i<=1e5;i++){
            par[i]=i;
        }
        set<ll> s;
        for(auto it:nums){
            s.insert(it);
        }
        vector<int> isprime(1e5+1,0);
        isprime[1]=1;
        for(int i=2;i<=1e5;i++){
            if(isprime[i]==0){
                for(int j=2*i;j<=1e5;j+=i){
                    isprime[j]=1;
                }
            }
        }
        for(int i=2;i<=1e5;i++){
            if(isprime[i]==0){
                for(int j=2*i;j<=1e5;j+=i){
                    if(s.find(j)!=s.end()){
                        unio(i,j,par);
                    }
                }
            }
        }
        map<ll,ll> m;
        ll ans=0;
        for(ll i=0;i<nums.size();i++){
            ll x=findpar(nums[i],par);
            m[x]++;
            ans=max(ans,m[x]);
        }
        return ans;


    }
};
156953