【HDU 5100 Chessboard 】

Chessboard

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

首先，若n < k，则棋盘连一个1×k的矩形都放不下，输出0。
我们只需要考虑n≥k的情况。将棋盘类似于黑白染色，按(i+j)模k划分等价类，给每个格子标一个号。
标号之后，会注意到每条从左下到右上的斜线数字都是相同的，那么对于s×s的格子，其内部数字有且恰好有2s−1种，所以当s<=k/2的时候，内部数字有floor(k/2)∗2−1 < k种࿰