BestCoder Round #73 (div.2) Rikka with Chess 1001

Rikka with Chess

 

 Accepts: 393

 

 Submissions: 548

 Time Limit: 2000/1000 MS (Java/Others)

 

 Memory Limit: 65536/65536 K (Java/Others)

Problem Description

Yuta gives Rikka a chess board of size $n\times m$.

As we all know, on a chess board, every cell is either black or white and every two cells that share a side have different colors.

Rikka can choose any rectangle formed by board squares and perform an inversion, every white cell becomes black, and vice versa.

Rikka wants to turn all cells into the same color, please tell Rikka the minimal number of inversions she need to achieve her goal.

Input

The first line contains a number $T(T\le 10)$ ——The number of the testcases.

Each testcase contains two numbers n,m(n \leq 10^9, m \leq 10^9)n,m(n≤10​9​​,m≤10​9​​).

Output

For each testcase, print a single number which represents the answer.

Sample Input

3
1 2
2 2
3 3

Sample Output

1
2
2

把偶数行翻转，把偶数列翻转，即可全部颜色相同。

#include<iostream>
#include<math.h>
using namespace std;

int main()
{
	int T;
	int n,m;
	int num;
	cin>>T;
	while(T--)
	{
		cin>>n>>m;
		num=n/2+m/2;
		cout<<num<<endl;
	}
}