[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$2\times 2$. Each cell of this field can either contain grass or be empty. The value ai,j$a_{i,j}$ is 1$1$ if the cell (i,j)$(i,j)$ contains grass, or 0$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$x$ and the column y$y$, then you cut the grass in all cells ax,i$a_{x,i}$ and all cells ai,y$a_{i,y}$ for all i$i$ from 1$1$ to 2$2$. After you cut the grass from a cell, it becomes empty (i. e. its value is replaced by 0$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 ai,j$a_{i,j}$ zeros).

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

You have to answer t$t$ independent test cases.

Input

The first line of the input contains one integer t$t$ (1≤t≤16$1\le t\le 16$) — the number of test cases. Then t$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$j$-th integer in the i$i$-th row is ai,j$a_{i,j}$. If ai,j=0$a_{i,j}=0$ then the cell (i,j)$(i,j)$ is empty, and if ai,j=1$a_{i,j}=1$ the cell (i,j)$(i,j)$ 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 ai,j$a_{i,j}$ zeros) in the corresponding test case.