HDU 5468(Puzzled Elena-mobius+树形dp)

#include
#include
#include
#include
#include
#include 
#include
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair
#define MAXN (100000+10)
#define N (100000)
typedef long long ll;

int n,cnt[MAXN];
int v[MAXN]; 

int mu[MAXN]={0};
bool b[MAXN];
vector factor[MAXN];
void make_mobius(int n)  
{  
    memset(b,1,sizeof(b));
    mu[1]=1;  

    Fork(i,2,n) {
        if (b[i]) {
            for(int j=i;j<=N;j+=i) {
                if (i^j) b[j]=0;

                int k=j/i;

                if (k%i) mu[j]=-mu[k];
                else mu[j]=0;


            }
        }
        if (mu[i])  
        {
            for(int j=i;j<=N;j+=i) {
                factor[j].pb(i);        
            }

        }
    }

}  

int edge[MAXN*2],Pre[MAXN],Next[MAXN*2],siz=1;
void addedge(int u,int v){
    edge[++siz]=v;
    Next[siz]=Pre[u];
    Pre[u]=siz;
}
void addedge2(int u,int v){addedge(u,v),addedge(v,u);}

int sz[MAXN],ans[MAXN];
vector temp[MAXN]; 
void dfs(int x,int fa)
{
    int m=factor[v[x]].size(); 
    Rep(i,m) {
        int d=factor[v[x]][i];
        temp[x].pb(cnt[d]),cnt[d]++;
    }
    sz[x]=1;
    Forp(x)
    {
        int v=edge[p];
        if (v==fa) continue; 
        dfs(v,x);
        sz[x]+=sz[v];
    }

    ans[x]=sz[x];
    Rep(i,m) {
        int d=factor[v[x]][i];
        ans[x]+=mu[d]*(cnt[d]-temp[x][i]);

    }

}

int main()
{
//  freopen("hdu5468.in","r",stdin);

    make_mobius(N);

    int kcase=0;
    while(cin>>n) {
        For(i,n) temp[i].clear();
        MEM(Pre) siz=1;
        MEM(cnt)
        For(i,n-1) {
            int u,v;
            scanf("%d%d",&u,&v);
            addedge2(u,v);
        } 

        For(i,n) scanf("%d",&v[i]);

        dfs(1,0);

        printf("Case #%d:",++kcase);

        For(i,n) {
            printf(" %d",ans[i]);
        }

        putchar('\n');
    }   




    return 0;
}