hdoj 5100 Chessboard

Chessboard

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 916    Accepted Submission(s): 388

Problem Description

Consider the problem of tiling an n×n chessboard by polyomino pieces that are k×1 in size; Every one of the k pieces of each polyomino tile must align exactly with one of the chessboard squares. Your task is to figure out the maximum number of chessboard squares tiled.

 

Input

There are multiple test cases in the input file.
First line contain the number of cases T ( T≤10000 ). 
In the next T lines contain T cases , Each case has two integers n and k. ( 1≤n,k≤100 )

 

Output

Print the maximum number of chessboard squares tiled.

 

Sample Input

  
  

   
   2
6 3
5 3
  
  

 

Sample Output

  
  

   
   36
24
  
  

 

题意：用k*1的小矩形覆盖n*n的正方形棋盘，求最多能覆盖多少

思路：如果n<k，答案为0；mod=n%k，如果mod<=k/2，结果为n*n-mod*mod；否则结果为n*n-(k-mod)*(k-mod)。

代码：

#include<stdio.h>
int main()
{
	int T;
	int n,k;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n,&k);
		if(n<k)
		{
			printf("0\n");
			continue;
		}
		int mod=n%k;
		if(mod<=k/2)
		printf("%d\n",n*n-mod*mod);
		else
		printf("%d\n",n*n-(k-mod)*(k-mod));
	}
	return 0;
}