Diferente pentru problema/marathon intre reviziile #3 si #4

Nu exista diferente intre titluri.

Diferente intre continut:

The total distance is $6 + 21 = 27$.
In the \textbf{second sample case} there are no checkpoints, so William must run directly from $0$ to $3$. The shortest path is $0$ -> $2$ ->  $1$ -> $3$.
In the second sample case there are no checkpoints, so William must run directly from $0$ to $3$. The shortest path is $0$ -> $2$ -> $1$ -> $3$.
== include(page="template/taskfooter" task_id="marathon") ==

Nu exista diferente intre securitate.

Topicul de forum nu a fost schimbat.