Graph And Its Complement CodeForces - 990D （思维）

D. Graph And Its Complement

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Given three numbers $n,a,b$. You need to find an adjacency matrix of such an undirected graph that the number of components in it is equal to $a$, and the number of components in its complement is $b$. The matrix must be symmetric, and all digits on the main diagonal must be zeroes.

In an undirected graph loops (edges from a vertex to itself) are not allowed. It can be at most one edge between a pair of vertices.

The adjacency matrix of an undirected graph is a square matrix of size $n$ consisting only of "0" and "1", where $n$ is the number of vertices of the graph and the