Submission #48686545

---

Source Code Expand

// LUOGU_RID: 140389377
#include <bits/stdc++.h>
using namespace std; 
const int P = 1000000007; 

inline int poww(int a, int b) {
    int r = 1; 
    for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) r = 1ll * r * a % P; 
    return r; 
}

int n, sz[200005], f[200005]; 
vector<int> G[200005]; 

void dfs(int x, int fa) {
    sz[x] = 1; 
    for (int y : G[x]) if (y != fa) dfs(y, x), sz[x] += sz[y]; 
    f[1] = 1ll * f[1] * sz[x] % P; 
}
void dfs2(int x, int fa) {
    for (int y : G[x]) if (y != fa) {
        f[y] = 1ll * f[x] * poww(sz[y], P - 2) % P * (n - sz[y]) % P; 
        dfs2(y, x); 
    }
}

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n; 
    for (int i = 1, u, v; i < n; ++i) 
        cin >> u >> v, 
        G[u].emplace_back(v), 
        G[v].emplace_back(u);
    f[1] = 1; dfs(1, 0); dfs2(1, 0); 
    int ans = 1; 
    for (int i = 2; i <= n; ++i) ans = 1ll * ans * i % P; 
    for (int i = 1; i <= n; ++i) cout << 1ll * ans * poww(f[i], P - 2) % P << "\n"; 
    return 0; 
}

Submission Info

Judge Result