GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

Monday 4 July 2022

[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 and m. Your task is to find any binary matrix a with n rows and m columns where every cell (i,j) has exactly two neighbours with a different value than ai,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) are: (x1,y)(x,y+1)(x+1,y) and (x,y1).

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 (1t100) — 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 and m (2n,m50) — the height and width of the binary matrix, respectively.

Output

For each test case, print n lines, each of which contains m numbers, equal to 0 or 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.

No comments:

Post a Comment