[CNTTREE] Trees Again | CommonLounge

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

Mark completed

SPOJ RDNWK: Road Network

Prim's algorithm for Minimum Spanning Tree

About the author

KD

Keshav Dhandhania

View Discussion (7)