CF1042F Leaf Sets

Description

You are given an undirected tree, consisting of $ n $ vertices. The vertex is called a leaf if it has exactly one vertex adjacent to it. The distance between some pair of vertices is the number of edges in the shortest path between them. Let's call some set of leaves beautiful if the maximum distance between any pair of leaves in it is less or equal to $ k $ . You want to split all leaves into non-intersecting beautiful sets. What is the minimal number of sets in such a split?

Input Format

N/A

Output Format

N/A

Explanation/Hint

Here is the graph for the first example: ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF1042F/5a707ac956bf7a0b2ca96d67d4d3ef782292e2c3.png)