Commonlounge
Competitive Programming
AboutGo ProHow to Contribute
NaN.
Part of course: Competitive Programming: From Beginner to Expert
[CNTTREE] Trees Again

Given a tree, you need to count how many subtrees with diameter <= K exist.

Read more…(15 words)
Problem CNTTREE
http://spoj.com/problems/CNTTREE/
Mark as completed
Previous
SPOJ RDNWK: Road Network
Next
Prim's algorithm for Minimum Spanning Tree
Copied
Reply
Part of courses:
About the author:
KD
Keshav Dhandhania
Loading…
Have a question? Ask here…
Post
Popular Courses
Machine LearningDeep LearningNatural Language ProcessingBig DataData ScienceBioinformaticsAlgorithmsCryptography
New Courses
Web DevelopmentUX & UI DesignStartupsProduct ManagementCryptocurrenciesFinanceCollege Admissions
About Us
Our MissionHow to ContributeUpgrade to ProHelp and FAQCommonlounge MetaTeamPrivacy, Terms & Refunds
Get in touch
hello@commonlounge.comFacebookTwitter
Copyright 2016-18, Compose Labs Inc. All rights reserved.