CF323B Tournament-graph

In this problem you have to build tournament graph, consisting of $ n $ vertices, such, that for any oriented pair of vertices $ (v,u) $ $ (v≠u) $ there exists a path from vertex $ v $ to vertex $ u $ consisting of no more then two edges. A directed graph without self-loops is a tournament, if there is exactly one edge between any two distinct vertices (in one out of two possible directions).

N/A

N/A