Uncategorized : Trees

This list is used to train students. Do not use it without supervision.

• Kefa and Park

• Collision

• Erase Leaves
• It is a tree : Subtask 1

• Tree Cutting

• Three Paths on a Tree

• Maximize the Root
• The Omnipotent Monster Killer
• Iris and Game on the Tree

• Count Connected Induced Subgraphs
• Tree node consensus maximum value
• Downward Paths with Only Last Vertex Black
• Paths with Terminal Black Vertices
• Prologue to Count Paths

• Deterministic Heap (Easy Version)

• Vlad and Trouble at MIT
• Paths with at most 2 Black Vertices
• Spanning Subgraphs with Fixed Degree
• Prologue to Swap on Trees
• Sum of Degree Sum of Spanning Subgraphs
• Sum of Degree Sum of Spanning Subgraphs (Hard)
• Induced Subgraphs with Fixed Degree
• Induced Subgraphs with Compressed Degree
• Prologue to Leaf Color

• A Growing Tree

• Count Paths
• Leaf Color

• Distinct Colors
• Confuzzle
• It is a tree : Subtask 2

• Happy Life in University