going to eliminate a bunch of edges from the tree. The tree parts into different more modest trees when the edges are eliminated. The arrangement of edges is legitimate if all the subsequent trees have width not exactly or equivalent to k. Two arrangements of edges are unique in case there is an edge to such an extent that
Correct answer will be upvoted else downvoted. Computer science.
You are going to eliminate a bunch of edges from the tree. The tree parts into different more modest trees when the edges are eliminated. The arrangement of edges is legitimate if all the subsequent trees have width not exactly or equivalent to k.
Two arrangements of edges are unique in case there is an edge to such an extent that it shows up in just one of the sets.
Count the number of substantial arrangements of edges modulo 998244353.
Input
The primary line contains two integers n and k (2≤n≤5000, 0≤k≤n−1) — the number of vertices of the tree and the greatest permitted distance across, separately.
Each of the following n−1 lines contains a depiction of an edge: two integers v and u (1≤v,u≤n, v≠u).
The given edges structure a tree.
Output
Print a solitary integer — the number of legitimate arrangements of edges modulo 998244353.
Step by step
Solved in 4 steps with 1 images
