Puzzled Elena

Puzzled Elena

.
.
题意：给定一棵树，1为根节点，问每个节点的子树有多少个与他互质的数。
.
.
解法：DFS序加容斥原理（莫比乌斯），DFS时用一个全局数组记录，count[i] 表示到当前结点能被i整除的有多少个数，由于可以保证每个数的因数不会超过6个，所以是n*2^6的，然后就是容斥原理了，对于奇偶的不同组合进行不同的操作，第一次遍历到当前结点把容斥的值减掉，然后遍历完它的子树再把容斥的值加上就好了，这就相当于作差求出子树的 count[] 。注意题目有个坑，一个节点的子树包含自己，所以如果是1的话要加一。
.
.

#include <map>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>

const int maxn = 150000;
const int maxm = 3000000;
bool flag[maxn] = {0};
int prime[maxn] = {0}, n, m, _x, _y, mu[maxn] = {0}, count[maxn];
int tar[maxm], next[maxm], last[maxn], tot, val[maxn];
int ans[maxn];
std::map<int, int> f[maxn];

void init() {
    memset(flag, 0, sizeof(flag));
    memset(mu, 0, sizeof(mu));
    mu[1] = 1;
    for (int i = 2; i < maxn; i++) {
        if (!flag[i]) {
            prime[++prime[0]] = i;
            mu[i] = -1;
        }
        for (int j = 1; j <= prime[0] && i*prime[j] < maxn; j++) {
            flag[i*prime[j]] = true;
            if (i%prime[j] == 0) {
                mu[i*prime[j]] = 0;
                break;
            } else {
                mu[i*prime[j]] = -mu[i];
            }
        }
    }
}

void insert(int x, int y) {
    tot++;
    tar[tot] = y;
    next[tot] = last[x];
    last[x] = tot;
}

void dfs(int x, int pre) {
    f[x].clear();
    int temp = val[x];
    int a[15] = {0};
    for (int i = 1; i <= prime[0] && prime[i]*prime[i] <= temp; i++) if (temp%prime[i] == 0) {
        a[++a[0]] = prime[i];   
        while (temp%prime[i] == 0) temp /= prime[i];
    }
    if (temp > 1) a[++a[0]] = temp;

    for (int i = 0; i <= (1 << a[0])-1; i++) {
        int t = 1;
        for (int j = 1; j <= a[0]; j++) if ((i >> (j-1)) & 1) t = t*a[j];
        count[t]++;
        ans[x] = ans[x]-mu[t]*count[t];
    }
    int k = last[x];
    while (k != 0) {
        if (tar[k] == pre) {
            k = next[k];
            continue;
        }
        dfs(tar[k], x);
        k = next[k];
    }
    for (int i = 0; i <= (1 << a[0])-1; i++) {
        int t = 1;
        for (int j = 1; j <= a[0]; j++) if ((i >> (j-1)) & 1) t = t*a[j];
        ans[x] = ans[x]+mu[t]*count[t];
    }
    if (val[x] == 1) ans[x] = ans[x]+1;
}

int main() {
    init();
    int cases = 0;
    while (scanf("%d", &n) != EOF) {
        memset(last, 0, sizeof(last));
        memset(ans, 0, sizeof(ans));
        memset(count, 0, sizeof(count));
        tot = 0;
        for (int i = 1; i < n; i++) {
            scanf("%d %d", &_x, &_y);
            insert(_x, _y);
            insert(_y, _x);
        }
        for (int i = 1; i <= n; i++) scanf("%d", &val[i]);
        dfs(1, 0);
        printf("Case #%d:", ++cases);
        for (int i = 1; i <= n; i++) {
            printf(" %d", ans[i]);
        }
        printf("\n");
    }

}