1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 2005
#define nm 4005
using namespace std;
const double pi=acos(-1);
const ll inf=998244353;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct edge{int t;edge*next;}e[nm],*h[NM],*o=e;
void add(int x,int y){o->t=y;o->next=h[x];h[x]=o++;}
int n,_x,_y,d[NM][NM];
ll p[NM],ans[NM];
void dfs(int x,int f,int t){
d[_x][t]++;
link(x)if(j->t!=f)dfs(j->t,x,t+1);
}
int main(){
n=read();inc(i,2,n){_x=read();_y=read();add(_x,_y);add(_y,_x);}
p[0]=1;inc(i,1,n)p[i]=p[i-1]*2%inf;
ans[1]=n-1;
inc(i,1,n)link(i)if(i<j->t){
mem(d[i]);
dfs(_x=i,j->t,0);
inc(k,1,n)d[_x][k]+=d[_x][k-1];
mem(d[j->t]);
dfs(_x=j->t,i,0);
inc(k,1,n)d[_x][k]+=d[_x][k-1];
inc(k,1,n/2){
ans[k<<1|1]+=p[d[i][k]]*p[d[j->t][k]]%inf;
ans[k<<1|1]-=p[d[i][k-1]]*p[d[j->t][k-1]]%inf;
ans[k<<1|1]-=(p[d[i][k]]-p[d[i][k-1]])*p[d[j->t][k-1]]%inf;
ans[k<<1|1]-=p[d[i][k-1]]*(p[d[j->t][k]]-p[d[j->t][k-1]])%inf;
ans[k<<1|1]%=inf;
}
}
inc(i,1,n){
link(i){
mem(d[j->t]);
dfs(_x=j->t,i,1);
inc(k,1,n)d[_x][k]+=d[_x][k-1];
}
mem(d[i]);
dfs(_x=i,i,0);
inc(k,1,n)d[_x][k]+=d[_x][k-1];
inc(k,1,n/2){
ans[k<<1]+=p[d[i][k]]-p[d[i][k-1]],ans[k<<1]%=inf;
link(i){
ans[k<<1]-=p[d[i][k-1]-d[j->t][k-1]]*(p[d[j->t][k]]-p[d[j->t][k-1]])%inf;
ans[k<<1]%=inf;
}
}
}
inc(i,1,n-1)printf("%lld\n",(ans[i]+inf)%inf);
return 0;
}
|
