CommonLounge
Categories
About
Get Started
NaN.
[CNTTREE] Trees Again
From
Competitive Programming: From Beginner to Expert
course
Given a tree, you need to count how many subtrees with diameter <= K exist.
Problem CNTTREE
http://spoj.com/problems/CNTTREE/
Category:
Competitive Programming
7 Comments
Mark completed
Previous
SPOJ RDNWK: Road Network
Next
Prim's algorithm for Minimum Spanning Tree
About the author
KD
Keshav Dhandhania
View Discussion (7)
Part of course:
Competitive Programming: From Beginner to Expert
SPOJ RDNWK: Road Network
Previous item
[CNTTREE] Trees Again
Prim's algorithm for Minimum Spanning Tree
Next item
Show admin stats