Problem p02728 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define repr(i, n) for (lint i = n - 1; i >= 0; i--)
#define repi(i, ini, n) for (lint i = ini; i < n; i++)
#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)
#define repb(i, start, end) for (lint i = start; i <= end; i++)
#define repbr(i, start, end) for (lint i = end; i >= start; i--)

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rg(v, n) v.begin(), v.begin() + n
#define rrg(v, n) v.rbegin(), v.rbegin() + n

#define ret return 0;

namespace {

using lint = long long;
using ulint = unsigned long long;
using ld = long double;
struct xy {
  lint x, y;
  xy() : x(0), y(0) {}
  xy(lint _x, lint _y) : x(_x), y(_y) {}
  xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }
  bool operator<(xy p) const {
    if (y == p.y)
      return x < p.x;
    return y < p.y;
  }
};
struct xyd {
  ld x, y;
  xyd() : x(0), y(0) {}
  xyd(long double _x, long double _y) : x(_x), y(_y) {}
};
using vec = vector<lint>;
using vecd = vector<ld>;
using vecs = vector<string>;
using vecp = vector<xy>;
template <class T> using vect = vector<T>;
class vec2 : public vector<vector<lint>> {
public:
  vec2() {}
  vec2(lint n) : vector(n) {}
  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}
  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}
};

template <class T> using priq = priority_queue<T>;
template <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;

const ulint mod = 1000000007;
const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
const lint inf = 1100100100100100100LL;
const ld eps = 0.0000001;
const lint alpn = 'z' - 'a' + 1;

template <class It> constexpr auto acc(It begin, It end) {
  return accumulate(begin, end, typename It::value_type(0));
}

template <class T> constexpr auto msum(T arg0) { return arg0; }

template <class T, class... Types> constexpr auto msum(T arg0, Types... args) {
  static_assert(sizeof...(args) > 0, "arg err");

  return arg0 + msum(args...);
}

template <class It> constexpr typename It::value_type mmax(It begin, It end) {
  return *max_element(begin, end);
}

template <class It> constexpr typename It::value_type mmin(It begin, It end) {
  return *min_element(begin, end);
}

template <class T> constexpr auto mmax(T arg) { return arg; }

template <class T, class... Types> constexpr auto mmax(T arg0, Types... args) {
  using promote_t = decltype(msum(arg0, args...));

  return max(static_cast<promote_t>(arg0),
             static_cast<promote_t>(mmax(args...)));
}

template <class T> constexpr auto mmin(T arg) { return arg; }

template <class T, class... Types> constexpr auto mmin(T arg0, Types... args) {
  using promote_t = decltype(msum(arg0, args...));

  return min(static_cast<promote_t>(arg0),
             static_cast<promote_t>(mmin(args...)));
}

constexpr auto clamp(lint val, lint left, lint right) {
  return mmax(mmin(val, right), left);
}

constexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }

lint gcd(lint a, lint b) {
  while (1) {
    if (a < b)
      swap(a, b);
    if (!b)
      break;
    a %= b;
  }
  return a;
}

lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }

lint powInt(lint a, lint b) {
  if (b == 0) {
    return 1;
  }
  if (b == 1) {
    return a;
  }
  lint tmp = powInt(a, b / 2);
  return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
}

template <class T> T sgn(T val) {
  if (val == T(0))
    return T(0);
  if (val < 0)
    return T(-1);
  if (val > 0)
    return T(1);
}

template <class T> constexpr auto modK_belowN(T k, T MOD, T n) {
  return (n + MOD - k - 1) / MOD;
}

template <class It, class T> bool exist(It begin, It end, const T &val) {
  return find(begin, end, val) != end;
}

template <class It, class Pr> bool exist_if(It begin, It end, Pr pred) {
  return find_if(begin, end, pred) != end;
}

template <class T> bool between(T val, T l, T r) {
  return (val >= l) && (val <= r);
}

template <class It> auto carr(It begin, It end) {
  vec c;
  c.push_back(1);
  auto before = *begin;
  for (auto it = begin + 1; it != end; it++) {
    if (before != *it) {
      c.push_back(0);
      before = *it;
    }
    c.back()++;
  }
  return c;
}

template <class T> struct nval {
  lint n;
  T val;
  nval() : n(0){};
  nval(lint _n, T _val) : n(_n), val(_val){};
};

template <class It> auto carr2(It begin, It end) {
  using T = nval<remove_reference_t<decltype(*begin)>>;

  vect<T> c;
  c.push_back(T(1, *begin));
  auto before = *begin;
  for (auto it = begin + 1; it != end; it++) {
    if (before != *it) {
      c.push_back(T(0, *it));
      before = *it;
    }
    c.back().n++;
  }
  return c;
}

template <class It, class... T> void sort2(It begin, It end, T... p) {
  using val_t = remove_reference_t<decltype(*begin)>;

  sort(begin, end, [p...](val_t a, val_t b) {
    bool neq[] = {(a.*p != b.*p)...};
    bool sg[] = {(a.*p < b.*p)...};

    rep(i, sizeof...(p)) {
      if (neq[i]) {
        return sg[i];
      }
    }
    return false;
  });
}

template <size_t _K, size_t _N, class... Types, size_t... indices>
auto constexpr __ModKtuple_Impl(index_sequence<indices...>,
                                tuple<Types...> args) {
  return make_tuple(get<indices * _N + _K>(args)...);
}

template <size_t K, size_t N, class... Types>
auto constexpr ModKtuple(Types... args) {
  return __ModKtuple_Impl<K, N>(
      make_index_sequence<modK_belowN(K, N, sizeof...(args))>{},
      forward_as_tuple(args...));
}

template <class It, class... T, class... Tsg, size_t... indices>
void __sort3_Impl(It begin, It end, tuple<T...> p, tuple<Tsg...> sgf,
                  index_sequence<indices...>) {
  using val_t = remove_reference_t<decltype(*begin)>;

  sort(begin, end, [p, sgf](val_t a, val_t b) {
    bool neq[] = {(a.*(get<indices>(p)) != b.*(get<indices>(p)))...};
    bool sg[] = {((a.*(get<indices>(p)) < b.*(get<indices>(p))) !=
                  (get<indices>(sgf)))...};

    rep(i, sizeof...(indices)) {
      if (neq[i]) {
        return sg[i];
      }
    }
    return false;
  });
}

template <class It, class... T> void sort3(It begin, It end, T... p) {
  using val_t = remove_reference_t<decltype(*begin)>;

  auto p_forward = ModKtuple<0, 2>(p...);
  auto sgf_forward = ModKtuple<1, 2>(p...);

  constexpr auto p_sz = tuple_size<decltype(p_forward)>::value;
  constexpr auto sgf_sz = tuple_size<decltype(sgf_forward)>::value;

  static_assert(p_sz == sgf_sz, "arg err");

  __sort3_Impl(begin, end, p_forward, sgf_forward, make_index_sequence<p_sz>{});
}

char caesar(char s, lint key) {
  if (between(s, 'A', 'Z')) {
    return (s - 'A' + key) % alpn + 'A';
  }
  if (between(s, 'a', 'z')) {
    return (s - 'a' + key) % alpn + 'a';
  }
  return s;
}

string caesar(string s, lint key) {
  rep(i, s.length()) s[i] = caesar(s[i], key);
  return s;
}

template <class It, class It2> auto spacel(It i, It2 end) {
  if (i + 1 == end) {
    return '\\n';
  } else {
    return ' ';
  }
}

template <class It> bool next_comb(lint n, It begin, It end) {
  auto rend = make_reverse_iterator(begin);
  auto rbegin = make_reverse_iterator(end);

  auto rit = rbegin;
  for (; rit != rend; rit++) {
    if ((rit == rbegin && (*rit) + 1 != n) ||
        (rit != rbegin && (*rit) + 1 != *(rit - 1))) {
      goto found;
    }
  }
  return false;
found:;
  (*rit)++;

  for (auto it = rit.base(); it != end; it++) {
    (*it) = (*(it - 1)) + 1;
  }
  return true;
}

ostream &setp(ostream &ost) {
  cout << setprecision(60) << fixed;
  return ost;
}

#ifdef _LOCAL
auto &dbg = cout;
#else
struct dummy_cout {
  template <class T> dummy_cout &operator<<(T &&op) { return *this; }

  using endl_t = basic_ostream<char, char_traits<char>>;

  dummy_cout &operator<<(endl_t &(*)(endl_t &)) { return *this; }
};

dummy_cout dbg;
#endif
}; // namespace

struct mint {
  lint n;
  mint() { n = 0; }
  mint(lint a) {
    if (a != -1)
      n = a % mod;
    else
      n = a;
  }
  mint &operator+=(mint a) {
    n += a.n;
    n %= mod;
    return *this;
  }
  mint &operator-=(mint a) {
    n += mod;
    n -= a.n;
    n %= mod;
    return *this;
  }
  mint &operator*=(mint a) {
    n *= a.n;
    n %= mod;
    return *this;
  }
  mint &operator%=(mint a) {
    n %= a.n;
    return *this;
  }
  mint &operator++() {
    n++;
    n %= mod;
    return *this;
  }
  mint &operator--() {
    n += mod;
    n--;
    n %= mod;
    return *this;
  }
};

mint operator+(mint a, mint b) {
  a += b;
  return a;
}
mint operator-(mint a, mint b) {
  a -= b;
  return a;
}
mint operator*(mint a, mint b) {
  a *= b;
  return a;
}

vector<mint> invtbl;
vector<mint> finvtbl;
vector<mint> facttbl;

mint factMod(lint n) {
  if (n == 0) {
    return 1;
  }
  mint ans = 1;
  while (n > 1) {
    ans *= n;
    n--;
  }
  return ans;
}
mint powMod(mint x, lint y) {
  if (x.n <= 1) {
    return x;
  }
  if (y == 0) {
    return 1;
  } else if (y == 1) {
    return x;
  } else if (y % 2 == 0) {
    mint tmp = powMod(x, y / 2);
    return tmp * tmp;
  } else {
    mint tmp = powMod(x, y / 2);
    return tmp * tmp * x;
  }
}
mint modinv(mint n) { return powMod(n, mod - 2); }

void preCalcInv(lint up) {
  invtbl.resize(up + 1);
  invtbl[1] = 1;
  repb(a, 2, up) { invtbl[a] = invtbl[a] = mod - invtbl[mod % a] * (mod / a); }
}

mint operator/(mint a, mint b) {
  if (b.n < invtbl.size()) {
    a *= invtbl[b.n];
  } else {
    a *= modinv(b);
  }
  return a;
}
mint &operator/=(mint &a, mint b) {
  a = a / b;
  return a;
}

void preCalcFactInv(lint up) {
  finvtbl.resize(up + 1);
  finvtbl[0] = 1;
  finvtbl[up] = modinv(factMod(up));
  repbr(a, 1, up - 1) { finvtbl[a] = finvtbl[a + 1] * (a + 1); }
}
void preCalcFact(lint up) {
  facttbl.resize(up + 1);
  facttbl[0] = 1;
  repb(a, 1, up) { facttbl[a] = facttbl[a - 1] * a; }
}
void preCalc(lint up) {
  invtbl.resize(up + 1);
  finvtbl.resize(up + 1);
  facttbl.resize(up + 1);
  invtbl[1] = 1;
  facttbl[0] = facttbl[1] = 1;
  finvtbl[0] = finvtbl[1] = 1;
  repb(a, 2, up) {
    facttbl[a] = facttbl[a - 1] * a;
    invtbl[a] = invtbl[a] = mod - invtbl[mod % a] * (mod / a);
    finvtbl[a] = finvtbl[a - 1] * invtbl[a];
  }
}

mint factModInv(lint a) {
  if (a < finvtbl.size()) {
    return finvtbl[a];
  } else {
    return modinv(factMod(a));
  }
}
mint nCrMod(lint n, lint r) {
  if (n < r || n < 0 || r < 0) {
    return 0;
  }
  r = mmin(r, n - r);
  mint a = 1;
  if (n < finvtbl.size() && n < facttbl.size()) {
    a *= facttbl[n];
    a *= finvtbl[r];
    a *= finvtbl[n - r];
    return a;
  } else {
    repb(i, n - r + 1, n) { a *= i; }
    a *= factModInv(r);
    return a;
  }
}
mint nHrMod(lint n, lint r) { return nCrMod(n + r - 1, r); }

vec tr[200010];

struct E {
  lint nn;
  mint ptn;
  auto operator+=(E e) {
    nn += e.nn;
    ptn *= e.ptn;
    ptn *= nCrMod(nn, e.nn);
  }
  auto operator-=(E e) {
    ptn /= nCrMod(nn, e.nn);
    ptn /= e.ptn;
    nn -= e.nn;
  }
};

E dp[200010];

E f(lint v, lint rt) {
  E res = {0, 1};

  rep(i, tr[v].size()) {
    if (tr[v][i] == rt)
      continue;

    E resc = f(tr[v][i], v);
    res += resc;
  }

  res.nn++;
  dp[v] = res;

  return res;
}

void g(lint v, lint rt) {
  rep(i, tr[v].size()) {
    if (tr[v][i] == rt)
      continue;

    auto r = dp[v];
    r.nn--;
    r -= dp[tr[v][i]];
    r.nn++;
    dp[tr[v][i]].nn--;
    dp[tr[v][i]] += r;
    dp[tr[v][i]].nn++;
    g(tr[v][i], v);
  }
}

int main() {
  lint n;
  cin >> n;

  preCalc(n + 10);

  rep(i, n - 1) {
    lint a, b;
    cin >> a >> b;
    a--;
    b--;
    tr[a].push_back(b);
    tr[b].push_back(a);
  }

  f(0, -1);
  g(0, -1);

  rep(i, n) { cout << dp[i].ptn.n << endl; }

  return 0;
}


Error: TLE

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define repr(i, n) for (lint i = n - 1; i >= 0; i--)
#define repi(i, ini, n) for (lint i = ini; i < n; i++)
#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)
#define repb(i, start, end) for (lint i = start; i <= end; i++)
#define repbr(i, start, end) for (lint i = end; i >= start; i--)

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rg(v, n) v.begin(), v.begin() + n
#define rrg(v, n) v.rbegin(), v.rbegin() + n

#define ret return 0;

namespace {

using lint = long long;
using ulint = unsigned long long;
using ld = long double;
struct xy {
  lint x, y;
  xy() : x(0), y(0) {}
  xy(lint _x, lint _y) : x(_x), y(_y) {}
  xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }
  bool operator<(xy p) const {
    if (y == p.y)
      return x < p.x;
    return y < p.y;
  }
};
struct xyd {
  ld x, y;
  xyd() : x(0), y(0) {}
  xyd(long double _x, long double _y) : x(_x), y(_y) {}
};
using vec = vector<lint>;
using vecd = vector<ld>;
using vecs = vector<string>;
using vecp = vector<xy>;
template <class T> using vect = vector<T>;
class vec2 : public vector<vector<lint>> {
public:
  vec2() {}
  vec2(lint n) : vector(n) {}
  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}
  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}
};

template <class T> using priq = priority_queue<T>;
template <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;

const ulint mod = 1000000007;
const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
const lint inf = 1100100100100100100LL;
const ld eps = 0.0000001;
const lint alpn = 'z' - 'a' + 1;

template <class It> constexpr auto acc(It begin, It end) {
  return accumulate(begin, end, typename It::value_type(0));
}

template <class T> constexpr auto msum(T arg0) { return arg0; }

template <class T, class... Types> constexpr auto msum(T arg0, Types... args) {
  static_assert(sizeof...(args) > 0, "arg err");

  return arg0 + msum(args...);
}

template <class It> constexpr typename It::value_type mmax(It begin, It end) {
  return *max_element(begin, end);
}

template <class It> constexpr typename It::value_type mmin(It begin, It end) {
  return *min_element(begin, end);
}

template <class T> constexpr auto mmax(T arg) { return arg; }

template <class T, class... Types> constexpr auto mmax(T arg0, Types... args) {
  using promote_t = decltype(msum(arg0, args...));

  return max(static_cast<promote_t>(arg0),
             static_cast<promote_t>(mmax(args...)));
}

template <class T> constexpr auto mmin(T arg) { return arg; }

template <class T, class... Types> constexpr auto mmin(T arg0, Types... args) {
  using promote_t = decltype(msum(arg0, args...));

  return min(static_cast<promote_t>(arg0),
             static_cast<promote_t>(mmin(args...)));
}

constexpr auto clamp(lint val, lint left, lint right) {
  return mmax(mmin(val, right), left);
}

constexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }

lint gcd(lint a, lint b) {
  while (1) {
    if (a < b)
      swap(a, b);
    if (!b)
      break;
    a %= b;
  }
  return a;
}

lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }

lint powInt(lint a, lint b) {
  if (b == 0) {
    return 1;
  }
  if (b == 1) {
    return a;
  }
  lint tmp = powInt(a, b / 2);
  return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
}

template <class T> T sgn(T val) {
  if (val == T(0))
    return T(0);
  if (val < 0)
    return T(-1);
  if (val > 0)
    return T(1);
}

template <class T> constexpr auto modK_belowN(T k, T MOD, T n) {
  return (n + MOD - k - 1) / MOD;
}

template <class It, class T> bool exist(It begin, It end, const T &val) {
  return find(begin, end, val) != end;
}

template <class It, class Pr> bool exist_if(It begin, It end, Pr pred) {
  return find_if(begin, end, pred) != end;
}

template <class T> bool between(T val, T l, T r) {
  return (val >= l) && (val <= r);
}

template <class It> auto carr(It begin, It end) {
  vec c;
  c.push_back(1);
  auto before = *begin;
  for (auto it = begin + 1; it != end; it++) {
    if (before != *it) {
      c.push_back(0);
      before = *it;
    }
    c.back()++;
  }
  return c;
}

template <class T> struct nval {
  lint n;
  T val;
  nval() : n(0){};
  nval(lint _n, T _val) : n(_n), val(_val){};
};

template <class It> auto carr2(It begin, It end) {
  using T = nval<remove_reference_t<decltype(*begin)>>;

  vect<T> c;
  c.push_back(T(1, *begin));
  auto before = *begin;
  for (auto it = begin + 1; it != end; it++) {
    if (before != *it) {
      c.push_back(T(0, *it));
      before = *it;
    }
    c.back().n++;
  }
  return c;
}

template <class It, class... T> void sort2(It begin, It end, T... p) {
  using val_t = remove_reference_t<decltype(*begin)>;

  sort(begin, end, [p...](val_t a, val_t b) {
    bool neq[] = {(a.*p != b.*p)...};
    bool sg[] = {(a.*p < b.*p)...};

    rep(i, sizeof...(p)) {
      if (neq[i]) {
        return sg[i];
      }
    }
    return false;
  });
}

template <size_t _K, size_t _N, class... Types, size_t... indices>
auto constexpr __ModKtuple_Impl(index_sequence<indices...>,
                                tuple<Types...> args) {
  return make_tuple(get<indices * _N + _K>(args)...);
}

template <size_t K, size_t N, class... Types>
auto constexpr ModKtuple(Types... args) {
  return __ModKtuple_Impl<K, N>(
      make_index_sequence<modK_belowN(K, N, sizeof...(args))>{},
      forward_as_tuple(args...));
}

template <class It, class... T, class... Tsg, size_t... indices>
void __sort3_Impl(It begin, It end, tuple<T...> p, tuple<Tsg...> sgf,
                  index_sequence<indices...>) {
  using val_t = remove_reference_t<decltype(*begin)>;

  sort(begin, end, [p, sgf](val_t a, val_t b) {
    bool neq[] = {(a.*(get<indices>(p)) != b.*(get<indices>(p)))...};
    bool sg[] = {((a.*(get<indices>(p)) < b.*(get<indices>(p))) !=
                  (get<indices>(sgf)))...};

    rep(i, sizeof...(indices)) {
      if (neq[i]) {
        return sg[i];
      }
    }
    return false;
  });
}

template <class It, class... T> void sort3(It begin, It end, T... p) {
  using val_t = remove_reference_t<decltype(*begin)>;

  auto p_forward = ModKtuple<0, 2>(p...);
  auto sgf_forward = ModKtuple<1, 2>(p...);

  constexpr auto p_sz = tuple_size<decltype(p_forward)>::value;
  constexpr auto sgf_sz = tuple_size<decltype(sgf_forward)>::value;

  static_assert(p_sz == sgf_sz, "arg err");

  __sort3_Impl(begin, end, p_forward, sgf_forward, make_index_sequence<p_sz>{});
}

char caesar(char s, lint key) {
  if (between(s, 'A', 'Z')) {
    return (s - 'A' + key) % alpn + 'A';
  }
  if (between(s, 'a', 'z')) {
    return (s - 'a' + key) % alpn + 'a';
  }
  return s;
}

string caesar(string s, lint key) {
  rep(i, s.length()) s[i] = caesar(s[i], key);
  return s;
}

template <class It, class It2> auto spacel(It i, It2 end) {
  if (i + 1 == end) {
    return '\\n';
  } else {
    return ' ';
  }
}

template <class It> bool next_comb(lint n, It begin, It end) {
  auto rend = make_reverse_iterator(begin);
  auto rbegin = make_reverse_iterator(end);

  auto rit = rbegin;
  for (; rit != rend; rit++) {
    if ((rit == rbegin && (*rit) + 1 != n) ||
        (rit != rbegin && (*rit) + 1 != *(rit - 1))) {
      goto found;
    }
  }
  return false;
found:;
  (*rit)++;

  for (auto it = rit.base(); it != end; it++) {
    (*it) = (*(it - 1)) + 1;
  }
  return true;
}

ostream &setp(ostream &ost) {
  cout << setprecision(60) << fixed;
  return ost;
}

#ifdef _LOCAL
auto &dbg = cout;
#else
struct dummy_cout {
  template <class T> dummy_cout &operator<<(T &&op) { return *this; }

  using endl_t = basic_ostream<char, char_traits<char>>;

  dummy_cout &operator<<(endl_t &(*)(endl_t &)) { return *this; }
};

dummy_cout dbg;
#endif
}; // namespace

struct mint {
  lint n;
  mint() { n = 0; }
  mint(lint a) {
    if (a != -1)
      n = a % mod;
    else
      n = a;
  }
  mint &operator+=(mint a) {
    n += a.n;
    n %= mod;
    return *this;
  }
  mint &operator-=(mint a) {
    n += mod;
    n -= a.n;
    n %= mod;
    return *this;
  }
  mint &operator*=(mint a) {
    n *= a.n;
    n %= mod;
    return *this;
  }
  mint &operator%=(mint a) {
    n %= a.n;
    return *this;
  }
  mint &operator++() {
    n++;
    n %= mod;
    return *this;
  }
  mint &operator--() {
    n += mod;
    n--;
    n %= mod;
    return *this;
  }
};

mint operator+(mint a, mint b) {
  a += b;
  return a;
}
mint operator-(mint a, mint b) {
  a -= b;
  return a;
}
mint operator*(mint a, mint b) {
  a *= b;
  return a;
}

vector<mint> invtbl;
vector<mint> finvtbl;
vector<mint> facttbl;

mint factMod(lint n) {
  if (n == 0) {
    return 1;
  }
  mint ans = 1;
  while (n > 1) {
    ans *= n;
    n--;
  }
  return ans;
}
mint powMod(mint x, lint y) {
  if (x.n <= 1) {
    return x;
  }
  if (y == 0) {
    return 1;
  } else if (y == 1) {
    return x;
  } else if (y % 2 == 0) {
    mint tmp = powMod(x, y / 2);
    return tmp * tmp;
  } else {
    mint tmp = powMod(x, y / 2);
    return tmp * tmp * x;
  }
}
mint modinv(mint n) { return powMod(n, mod - 2); }

void preCalcInv(lint up) {
  invtbl.resize(up + 1);
  invtbl[1] = 1;
  repb(a, 2, up) { invtbl[a] = invtbl[a] = mod - invtbl[mod % a] * (mod / a); }
}

mint operator/(mint a, mint b) {
  if (b.n < invtbl.size()) {
    a *= invtbl[b.n];
  } else {
    a *= modinv(b);
  }
  return a;
}
mint &operator/=(mint &a, mint b) {
  a = a / b;
  return a;
}

void preCalcFactInv(lint up) {
  finvtbl.resize(up + 1);
  finvtbl[0] = 1;
  finvtbl[up] = modinv(factMod(up));
  repbr(a, 1, up - 1) { finvtbl[a] = finvtbl[a + 1] * (a + 1); }
}
void preCalcFact(lint up) {
  facttbl.resize(up + 1);
  facttbl[0] = 1;
  repb(a, 1, up) { facttbl[a] = facttbl[a - 1] * a; }
}
void preCalc(lint up) {
  invtbl.resize(up + 1);
  finvtbl.resize(up + 1);
  facttbl.resize(up + 1);
  invtbl[1] = 1;
  facttbl[0] = facttbl[1] = 1;
  finvtbl[0] = finvtbl[1] = 1;
  repb(a, 2, up) {
    facttbl[a] = facttbl[a - 1] * a;
    invtbl[a] = invtbl[a] = mod - invtbl[mod % a] * (mod / a);
    finvtbl[a] = finvtbl[a - 1] * invtbl[a];
  }
}

mint factModInv(lint a) {
  if (a < finvtbl.size()) {
    return finvtbl[a];
  } else {
    return modinv(factMod(a));
  }
}
mint nCrMod(lint n, lint r) {
  if (n < r || n < 0 || r < 0) {
    return 0;
  }
  r = mmin(r, n - r);
  mint a = 1;
  if (n < finvtbl.size() && n < facttbl.size()) {
    a *= facttbl[n];
    a *= finvtbl[r];
    a *= finvtbl[n - r];
    return a;
  } else {
    repb(i, n - r + 1, n) { a *= i; }
    a *= factModInv(r);
    return a;
  }
}
mint nHrMod(lint n, lint r) { return nCrMod(n + r - 1, r); }

struct E {
  lint to;
  lint r;
  lint nn;
  mint ptn;
};

vect<vect<E>> tr;

lint nn(lint from, lint ii) {
  if (tr[from][ii].nn != -1)
    return tr[from][ii].nn;

  lint ans = 1;
  rep(i, tr[from].size()) {
    if (i == ii)
      continue;

    ans += nn(tr[from][i].to, tr[from][i].r);
  }

  tr[from][ii].nn = ans;
  return ans;
}

mint ptn(lint from, lint ii) {
  if (ii != -1 && tr[from][ii].ptn.n != -1)
    return tr[from][ii].ptn;

  vec nns;
  lint s = 0;
  mint ans = 1;
  rep(i, tr[from].size()) {
    if (i == ii)
      continue;

    s += nn(tr[from][i].to, tr[from][i].r);
    nns.push_back(nn(tr[from][i].to, tr[from][i].r));
    ans *= ptn(tr[from][i].to, tr[from][i].r);
  }

  rep(i, nns.size()) {
    ans *= nCrMod(s, nns[i]);
    s -= nns[i];
  }

  if (ii != -1)
    tr[from][ii].ptn = ans;
  return ans;
}

int main() {
  lint n;
  cin >> n;

  preCalc(n + 10);

  tr.resize(n);

  rep(i, n - 1) {
    lint a, b;
    cin >> a >> b;
    a--;
    b--;
    lint as = tr[a].size();
    lint bs = tr[b].size();
    tr[a].push_back({b, bs, -1, -1});
    tr[b].push_back({a, as, -1, -1});
  }

  rep(i, n) { cout << ptn(i, -1).n << endl; }

  return 0;
}