Codeforces 990G. GCD Counting

题目连接：http://codeforces.com/contest/990/problem/G

题目描述：

G. GCD Counting

time limit per test

4.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a tree consisting of $n$ vertices. A number is written on each vertex; the number on vertex $i$ is equal to $a_i$.

Let's denote the function $g(x,y)$ as the greatest common divisor of the numbers written on the vertices belonging to the simple path from vertex $x$ to vertex $y$ (including these two vertices).

For every integer from $1$ to $2\cdot {10}^5$ you have to count the number of pairs $(x,y)$ $(1\le x\le y\le n)$ such that $g(x,y)$ is equal to this number.

Input

The first line contains one integer $n$ — the number of vertices $(1\le n\le 2\cdot {10}^5)$.

The second line contains $n$ integers $a_1$, $a_2$, ..., $a_n$ $(1\le a_i\le 2\cdot {10}^5)$ — the numbers written on vertices.

Then $n-1$ lines follow, each containing two integers $x$ and $y$ $(1\le x,y\le n,x\ne y)$ denoting an edge connecting vertex $x$ with vertex $y$. It is guaranteed that these edges form a tree.

Output

For every integer $i$ from $1$ to $2\cdot {10}^5$ do the following: if there is no pair $(x,y)$ such that $x\le y$ and $g(x,y)=i$, don't output anything. Otherwise output two integers: $i$ and the number of aforementioned pairs. You have to consider the values of $i$ in ascending order.

See the examples for better understanding.

Examples

input

Copy

3
1 2 3
1 2
2 3

output

Copy

1 4
2 1
3 1

input

Copy

6
1 2 4 8 16 32
1 6
6 3
3 4
4 2
6 5

output

Copy

1 6
2 5
4 6
8 1
16 2
32 1

input

Copy

4
9 16 144 6
1 3
2 3
4 3

output

Copy

1 1
2 1
3 1
6 2
9 2
16 2
144 1

题解：由于2e5内gcd不会有太多种，所以直接暴力回溯。

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
int val[maxn];
ll cnt[maxn];
vector<int>g[maxn];
map<int, ll> c[maxn];

void dfs(int u, int p = 0)
{
    c[u][val[u]] ++;
    for(int v : g[u]) {
        if(v != p) {
            dfs(v, u);
            for(auto itu : c[u]) {
                for(auto itv : c[v]) {
                    cnt[__gcd(itu.first, itv.first)] += itu.second * itv.second; //先统计个数
                }
            }
            for(auto itv : c[v]) {
                c[u][__gcd(val[u], itv.first)] += itv.second; //在进行更新.
            }
            c[v].clear(); //must clear, or it will be MLE
        }
    }
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    for(int i = 1;i <= n;i ++) {
        cin >> val[i];
        cnt[val[i]] ++;
    }
    for(int i = 1;i < n;i ++) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    dfs(1);
    for(int i = 1;i < maxn;i ++) {
        if(cnt[i]) cout << i << ' ' << cnt[i] << '\n';
    }

    return 0;
}