light1010 - Knights in Chessboard【找规律】

最新推荐文章于 2020-11-20 17:35:41 发布

原创最新推荐文章于 2020-11-20 17:35:41 发布 · 741 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#light1010 - Knights

数学专栏收录该内容

111 篇文章

订阅专栏

本文探讨了在给定尺寸的棋盘上放置骑士的问题，目标是找出最多能放置多少个骑士使得它们不会互相攻击。文章提供了算法实现，并通过样例输入输出展示了如何计算不同大小棋盘上的最大骑士数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1010 - Knights in Chessboard

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

Given an m x n chessboard where you want to place chess knights. You have to find the number of maximum knights that can be placed in the chessboard such that no two knights attack each other.

Those who are not familiar with chess knights, note that a chess knight can attack 8 positions in the board as shown in the picture below.

Input

Input starts with an integer T (≤ 41000), denoting the number of test cases.

Each case contains two integers m, n (1 ≤ m, n ≤ 200). Here m and n corresponds to the number of rows and the number of columns of the board respectively.

Output

For each case, print the case number and maximum number of knights that can be placed in the board considering the above restrictions.

Sample Input

Output for Sample Input

8 8

3 7

4 10

Case 1: 32

Case 2: 11

Case 3: 20

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
	int n,m,t,k=1;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&m);
		printf("Case %d: ",k++);
		if(min(n,m)==1){
			printf("%d\n",max(n,m));
		}
		else if(min(n,m)==2){
			printf("%d\n",max(n,m)/4*4+2*min(max(n,m)%4,2));
		}
		else {
			printf("%d\n",(n*m+1)/2);
		}
	}
	return 0;
}