<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:
     class DSU{
        vector<int>parent,size;

        
        public:
DSU(int n){
           parent.resize(n+1);
            size.resize(n+1,0);
           for(int i=1;i<=n;i++){
                parent[i]=i;
                size[i]=1;
           }
          
        }

        int findp(int m){
            if(parent[m]==m)
               return m;

               return parent[m]=findp(parent[m]);
        }

        void Union(int u,int v){
            if(findp(u)==findp(v))
            return ;

          int ulp=findp(u);
          int vlp=findp(v);


            if(size[ulp]<size[vlp]){
                parent[ulp]=vlp;
                size[vlp]+=size[ulp];
            }
            else{
                parent[vlp]=ulp;
                size[ulp]+=size[vlp];
            }
        }

        int lc(){
            int ans=1;
   for(auto i:size){
    ans=max(ans,i);
   }
             
         return ans;

        }

     };
    int largestComponentSize(vector<int>& nums) {
        unordered_map<int,vector<int>>m;
         int n=nums.size();
         int maxi=-1;
        for(int i=0;i<n;i++){
            int x=nums[i];
            maxi=max(maxi,x);
            for(int j=2;j*j<=x;j++){
            if(x%j==0){
                m[j].push_back(x);
                if(x/j!=j)
                 m[x/j].push_back(x);
            }
            }
            m[x].push_back(x);
            }

DSU d(maxi);
            for(auto u:m){
                vector<int>i=u.second;
               
                for(int j=0;j<i.size()-1;j++){
                    if(d.findp(i[j])!=d.findp(i[j+1]))
                         d.Union(i[j],i[j+1]);
                }
            }

int ans=d.lc();



      return ans;  
    }
};
177548