CF1499F.Diameter Cuts

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given an integer $k$ and an undirected tree, consisting of $n$ vertices.

The length of a simple path (a path in which each vertex appears at most once) between some pair of vertices is the number of edges in this path. A diameter of a tree is the maximum length of a simple path between all pairs of vertices of this tree.

You are about to remove a set of edges from the tree. The tree splits into multiple smaller trees when the edges are removed. The set of edges is valid if all the resulting trees have diameter less than or equal to $k$ .

Two sets of edges are different if there is an edge such that it appears in only one of the sets.

Count the number of valid sets of edges modulo $998\,244\,353$ .

输入格式

The first line contains two integers $n$ and $k$ ( $2 \le n \le 5000$ , $0 \le k \le n - 1$ ) — the number of vertices of the tree and the maximum allowed diameter, respectively.

Each of the next $n-1$ lines contains a description of an edge: two integers $v$ and $u$ ( $1 \le v, u \le n$ , $v \neq u$ ).

The given edges form a tree.

输出格式

Print a single integer — the number of valid sets of edges modulo $998\,244\,353$ .

输入输出样例

输入#1
```
4 3
1 2
1 3
1 4
```
输出#1
```
8
```
输入#2
```
2 0
1 2
```
输出#2
```
1
```
输入#3
```
6 2
1 6
2 4
2 6
3 6
5 6
```
输出#3
```
25
```
输入#4
```
6 3
1 2
1 5
2 3
3 4
5 6
```
输出#4
```
29
```

说明/提示

In the first example the diameter of the given tree is already less than or equal to $k$ . Thus, you can choose any set of edges to remove and the resulting trees will have diameter less than or equal to $k$ . There are $2^3$ sets, including the empty one.

In the second example you have to remove the only edge. Otherwise, the diameter will be $1$ , which is greater than $0$ .

Here are the trees for the third and the fourth examples:

首页