Lesson 5

Problem. Construct a tournament in which for any three teams, there is a fourth team that defeated them.

As an answer, output one line, in which the number of vertices in the tournament comes first, followed by the adjacency matrix row by row with elements separated by a space. For example, for the cycle graph \(0 \to 2 \to 1 \to 0\) with three vertices, you should enter the following: \(\texttt{3 0 0 1 1 0 0 0 1 0}\).