A. Rikka with Chess

A. Rikka with Chess
Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: Java class name:
Submit Status PID: 5761
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.

一个n×m的黑白相间的棋盘，每次可以选择一个矩形把其中的所有格子反色。问把所有格子变成一种颜色时的最少操作次数。
Input
The first line contains a number T(T <= 10) ——The number of the testcases.

Each testcase contains two numbers $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>
using namespace std;
int main()
{
	int t,n,m;
	cin>>t;
	while(t--) {
		cin>>n>>m;
		cout<<n/2+m/2<<endl;
	}
	return 0;
}