当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5100:Chessboard

题目描述
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.
输入解释
There are multiple test cases in the input file.
First line contain the number of cases T ($T \leq 10000$).
In the next T lines contain T cases , Each case has two integers n and k. ($1 \leq n, k \leq 100$)
输出解释
Print the maximum number of chessboard squares tiled.
输入样例
2
6 3
5 3
输出样例
36
24
来自杭电HDUOJ的附加信息
Recommend heyang

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 BestCoder Round #17

源链接: HDU-5100

最后修改于 2020-10-25T23:19:48+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)