D. GCD Counting（dp直径+连续gcd）

https://codeforces.com/problemset/problem/1101/D

---

思路：一段gcd维护序列的公共质因子即可。2e5里面质因子个数就十几个。对于当前根节点，判和子树中哪个质因子相同就可以达到gcd>1。然后转移。

O(n*8*8)。筛后处理147ms结束

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
vector<LL>g[maxn];
LL c[maxn][20],dp[maxn][20],ans=0;///dp维护链长
LL primes[maxn],v[maxn],num[maxn];
void getprimes(LL n){
     LL cnt=0;
     for(LL i=2;i<=n;i++){
         if(v[i]==0) {v[i]=i;primes[++cnt]=i;}
         for(LL j=1;j<=cnt&&primes[j]*i<=n;j++){
            v[primes[j]*i]=primes[j];
            if(i%primes[j]==0) {
                break;
            }
         }
     }
}
void dfs(LL u,LL fa){
     for(LL j=1;j<=num[u];j++) dp[u][j]=0;
     for(LL i=0;i<g[u].size();i++){
         LL v=g[u][i];
         if(v==fa) continue;
         dfs(v,u);
         for(LL j=1;j<=num[u];j++){
            for(LL k=1;k<=num[v];k++){
                if(c[u][j]==c[v][k]){
                    ans=max(ans,dp[u][j]+dp[v][k]+1);
                    dp[u][j]=max(dp[u][j],dp[v][k]+1);
                }
            }
         }
     }
}
int main(void){
    getprimes(maxn-10);
    LL n;n=read();
    for(LL i=1;i<=n;i++) a[i]=read();
    LL p=0;
    for(LL i=1;i<=n;i++){
        if(a[i]==1) p++;
    }
    if(p==n){cout<<"0"<<"\n";return 0;}
    for(LL i=1;i<n;i++){
        LL u,v;u=read();v=read();
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(LL i=1;i<=n;i++){
        LL temp=a[i];
        LL tot=0;
        while(temp>1){
            LL divor=v[temp];
            c[i][++tot]=divor;
            while(temp>1&& ( temp%divor==0) ){
                temp/=divor;
            }
        }
        num[i]=tot;
    }

    dfs(1,0);
    cout<<ans+1<<"\n";
   	return 0;
}