hdu5630(规律)

Rikka with Chess

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 535    Accepted Submission(s): 444

Problem Description

Yuta gives Rikka a chess board of size  n×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≤10)  ——The number of the testcases.

Each testcase contains two numbers  n,m(n≤109,m≤109) .

 

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的黑白相间的棋盘，现在可以选择棋盘中任意的矩形将其颜色反转。问最少需要多少步才能使整个棋盘的颜色相同？

解题思路：通过1x1,2x2,3x3，4x4的棋盘情况可以发现每行的黑白情况交替出现，当经过n/2次变换后（每隔一行反转一次，所以需要n/2次）所有行都相同。

因此此时只需在变换m/2次就可以将所有格子变成一种颜色。

ac代码：

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