Problem 2

CodeChefOpen on judge ↗

You are given a tree consising of N vertices. What is the minimum number of vertices that should be removed that all the remaining parts of the initial tree will contain less than K vertices? ###Input: The first line contains one integer K. The second line contains one integer N. The third line contains N-1 space-separated intgers ai for 2 <= i <= N which means that vertices i and ai are con

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI