-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathiepuri.cpp
59 lines (54 loc) · 1.05 KB
/
iepuri.cpp
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
# include <fstream>
# include <vector>
# include <cstring>
# define MOD 30011
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
vector <int> v[105];
int i,j,n,m,K,x,y,VV,R;
int in[105], suma[105], a[105][105];
void DFS (int k)
{
int i,j;
if (v[k].size()==0)
{
for (i=1; i<=K; ++i)
a[k][i]=1;
}
else
{
for (i=0; i<v[k].size(); ++i)
DFS (v[k][i]);
memset(suma, 0, sizeof(suma));
for (i=K-1; i>=1; --i)
{
int S=1;
for (j=0; j<v[k].size(); ++j)
{
suma[j]+=a[v[k][j]][i+1];
if (suma[j]>=MOD) suma[j]%=MOD;
S=S*suma[j];
if (S>=MOD) S%=MOD;
}
a[k][i]=S;
}
}
}
int main ()
{
f>>n>>K;
for (i=1; i<n; ++i)
{
f>>x>>y;
v[x].push_back(y);
++in[y];
}
for (i=1; i<=n; ++i)
if (! in[i]) R=i;
DFS (R);
for (i=1; i<=K; ++i)
VV+=a[R][i];
g<<VV%MOD<<"\n";
return 0;
}