## GUPTA MECHANICAL

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

# [Solution] Grass Field Codeforces Solution | Solution CodeForces

A. Grass Field
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

There is a field of size $2×2$. Each cell of this field can either contain grass or be empty. The value ${a}_{i,j}$ is $1$ if the cell $\left(i,j\right)$ contains grass, or $0$ otherwise.

In one move, you can choose one row and one column and cut all the grass in this row and this column. In other words, you choose the row $x$ and the column $y$, then you cut the grass in all cells ${a}_{x,i}$ and all cells ${a}_{i,y}$ for all $i$ from $1$ to $2$. After you cut the grass from a cell, it becomes empty (i. e. its value is replaced by $0$).

Your task is to find the minimum number of moves required to cut the grass in all non-empty cells of the field (i. e. make all ${a}_{i,j}$ zeros).

Solution Click Below:-  👉
👇👇👇👇👇

You have to answer $t$ independent test cases.

Input

The first line of the input contains one integer $t$ ($1\le t\le 16$) — the number of test cases. Then $t$ test cases follow.

Grass Field Codeforces Solution

Permutation Codeforces Solution

Schedule Management Codeforces Solution

Permutation Restoration Codeforces Solution

Text Editor Codeforces Solution

Points Codeforces Solution

The test case consists of two lines, each of these lines contains two integers. The $j$-th integer in the $i$-th row is ${a}_{i,j}$. If ${a}_{i,j}=0$ then the cell $\left(i,j\right)$ is empty, and if ${a}_{i,j}=1$ the cell $\left(i,j\right)$ contains grass.

Output

For each test case, print one integer — the minimum number of moves required to cut the grass in all non-empty cells of the field (i. e. make all ${a}_{i,j}$ zeros) in the corresponding test case.