HDU5100(找规律)

Chessboard

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


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 ( T10000 ). 
In the next T lines contain T cases , Each case has two integers n and k. ( 1n,k100 )
 

Output
Print the maximum number of chessboard squares tiled.
 

Sample Input
    
    
    
    
2 6 3 5 3
 

Sample Output
    
    
    
    
36 24
 

Source
BestCoder Round #17

题意:用k*1的板子覆盖n*n的方格,板子不能相互覆盖,问最大能覆盖方格的格子数

思路:http://www.matrix67.com/blog/archives/5900,这里是详解

你可能感兴趣的:(ACM,HDU,BestCoder)