[Solution] Fill The Grid CodeChef Solution

You have a grid with N$N$ rows and M$M$ columns. You have two types of tiles — one of dimensions 2×2$2\times 2$ and the other of dimensions 1×1$1\times 1$. You want to cover the grid using these two types of tiles in such a way that:

• Each cell of the grid is covered by exactly one tile; and
• The number of 1×1$1\times 1$ tiles used is minimized.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Find the minimum number of 1×1$1\times 1$ tiles you have to use to fill the grid.

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases.

Passes for Fair CodeChef Solution

Fill Candies CodeChef Solution

Buy Lamps CodeChef Solution

Make Palindrome 2 CodeChef Solution

Fill The Grid CodeChef Solution

Positive array CodeChef Solution

Strict Permutation CodeChef Solution

• Each test case consists of a single line containing two space-separated integers N,M$N,M$.

Output Format

For each test case, print on a new line the minimum number of 1×1$1\times 1$ tiles needed to fill the grid.

Constraints

• 1≤T≤104$1\le T\le {10}^4$
• 1≤N,M≤104$1\le N,M\le {10}^4$