Задача 18.

* There are $n$ teams in a competition. Each team played with each other team once and there were no ties in the competition. Show that the teams can be numbered $1,...,n$ in such a way that $(i+1)$-th team beats $i$-th, for any $i=1,...,n-1$.