[CNTTREE] Trees Again | Commonlounge

NaN.

Keshav DhandhaniaCompetitive Programming

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.

Problem CNTTREE

http://spoj.com/problems/CNTTREE/

Mark as completed

SPOJ RDNWK: Road Network

Prim's algorithm for Minimum Spanning Tree

Copied

Part of courses:

Competitive Programming: From Beginner to Expert

About the author:

KD

Keshav Dhandhania

Loading…

Have a question? Ask here…