== include(page="template/taskheader" task_id="ktree") ==

   Se da un arbore neorientat cu costuri. Sa se taie M muchii astfel incat componenta conexa care il contine pe nodul 1 sa aiba exact K noduri.
 

Poveste si cerinta...

h2. Date de intrare

 duuuuh arborele in ktree.in ....

...

h2. Date de iesire

 costul minim

...

h2. Restrictii

* ceva  legat de N

* $... ≤ ... ≤ ...$

h2. Exemplu

 
|_. ktree.in |_. ktree.out |
| 2 1 1
 1 2 3
| 3 ( wow ce exemplu tare  )

table(example). |_. ktree.in |_. ktree.out |
| This is some
  text written on
  multiple lines.
| This is another
  text written on
  multiple lines.

|
h3. Explicatie

like duuh e singura muchie :))

 
...

== include(page="template/taskfooter" task_id="ktree") ==