[Solution] Almost Ternary Matrix Codeforces Solution

B. Almost Ternary Matrix

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given two even integers n$n$ and m$m$. Your task is to find any binary matrix a$a$ with n$n$ rows and m$m$ columns where every cell (i,j)$(i,j)$ has exactly two neighbours with a different value than ai,j$a_{i,j}$.

Two cells in the matrix are considered neighbours if and only if they share a side. More formally, the neighbours of cell (x,y)$(x,y)$ are: (x−1,y)$(x-1,y)$, (x,y+1)$(x,y+1)$, (x+1,y)$(x+1,y)$ and (x,y−1)$(x,y-1)$.

It can be proven that under the given constraints, an answer always exists.

Input

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Each test contains multiple test cases. The first line of input contains a single integer t$t$ (1≤t≤100$1\le t\le 100$) — the number of test cases. The following lines contain the descriptions of the test cases.

The only line of each test case contains two even integers n$n$ and m$m$ (2≤n,m≤50$2\le n,m\le 50$) — the height and width of the binary matrix, respectively.

Output

The Third Three Number Problem Codeforces Solution

Almost Ternary Matrix Codeforces Solution

The Third Problem Codeforces Solution

Almost Triple Deletions CodeForces Solution

Three Days Grace Codeforces Solution

For each test case, print n$n$ lines, each of which contains m$m$ numbers, equal to 0$0$ or 1$1$ — any binary matrix which satisfies the constraints described in the statement.

It can be proven that under the given constraints, an answer always exists.