CF461B Appleman and Tree

Appleman has a tree with $ n $ vertices. Some of the vertices (at least one) are colored black and other vertices are colored white. Consider a set consisting of $ k $ $ (0

N/A

N/A