【HDU】-5100-Chessboard（思维）

Chessboard

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

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
  
  
  
  


  
  

注意一点：1*k的骨牌不是1*k的长方形。

不能重叠，每次用1*k的骨牌。

#include<cstdio> 
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define CLR(a,b) memset(a,b,sizeof(a))
int a[1010][1010];
int row[1010],rad[1010],cul[1010],cad[1010];
int main()
{
	int u,n,k;
	scanf("%d",&u);
	while(u--)
	{
		int ans;
		scanf("%d%d",&n,&k);
		if(n<k)
			ans=0;
		else
		{
			int minn=min(n%k,k-n%k);
			ans=n*n-minn*minn;
		}
		printf("%d\n",ans);
	}
	return 0;
}