n的约数 n = p1^a1*p2^a2*... (ACM学习笔记)

pi = i ; ai = vis[ i ] ;

void euler_phi(int n) {
    memset(vis, 0, sizeof(vis));
    printf("n:%d\n", n);
    for (int i = 2; i <= n; i++) {
            while (n % i == 0) {
                vis[i]++;
                n /= i;
            }
    }
}