h2. Restrictii

* $1 ≤ p ≤ 50$
* $2 ≤ n ≤ 500$
* $1 ≤ i, j ≤ n$
* $0 ≤ c ≤ 1000$
* $1 ≤ d{~1~}, d{~2~} ... d{~p~} ≤ n$
* se considera statia $1$ ca punct de plecare (discoteca)
* pe toate strazile se poate circula in ambele sensuri
* pentru datele de test exista intotdeauna solutie
* toate datele de intrare sunt numere naturale

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

h2. Exemplu
table(example). |_. team.in |_. team.out |

| 4
  5
  8
  1 2 6
  1 3 4
  3 4 8
  2 4 1
  3 5 7
  2 3 1
  1 5 6
  2 5 0
  5 2 4 4
| 6

| This is some
  text written on
  multiple lines.
| This is another
  text written on
  multiple lines.

|

h3. Explicatie
 
...
 

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