Hdu 5630 Rikka with Chess【水】

Rikka with Chess

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 5630

Description

Yuta gives Rikka a chess board of size  . 

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   ――The number of the testcases. 

Each testcase contains two numbers  . 

 

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 
     
     

 

题意：

给出n*m 的棋盘（类似于国际象棋的棋盘），上下左右相邻的格子颜色不同（黑和白），有一个人可以一次操作任意规格矩形内的格子，使得其颜色变成另一种颜色，问这个人想把棋盘操作成只有一种颜色，最少需要操作几次

题解：

根据图形的特殊性，每次只操作一行或者一列才可能最优，不难发现，每次操作的话，最少需要n/2次 行的操作，就能使得所有相同颜色的在同一列，然后对m/2列进行操作，既能使得所有的格子颜色相同。

#include<stdio.h>
#include<string.h>
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,m;
		scanf("%d%d",&n,&m);
		printf("%d\n",n/2+m/2);
	}
	return 0;
}