HDOJ 5100 Chessboard 构造
来源:互联网 发布:淘宝司法拍卖有佣金吗 编辑:程序博客网 时间:2024/06/06 01:31
MATRIX67大神: http://www.matrix67.com/blog/archives/5900
Chessboard
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 538 Accepted Submission(s): 241
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 )
First line contain the number of cases T (
In the next T lines contain T cases , Each case has two integers n and k. (
Output
Print the maximum number of chessboard squares tiled.
Sample Input
26 35 3
Sample Output
3624
Source
BestCoder Round #17
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;int main(){int T_T;int n,k;scanf("%d",&T_T);while(T_T--){scanf("%d%d",&n,&k);if(k>n){puts("0");continue;}int r=n%k;if(r>k/2) r=k-r;printf("%d\n",n*n-r*r);}return 0;}
1 1
- HDOJ 5100 Chessboard 构造
- hdoj 5100 Chessboard 【思维】
- HDOJ 5100 Chessboard【规律】
- hdoj 5100 Chessboard
- hdoj 5100 Chessboard (思维规律)
- HDOJ 题目5100 Chessboard(数学乱搞)
- hdoj--5100--Chessboard(数学推理)
- hdoj Chessboard 5100 (数学几何规律)
- HDOJ 5100 Chessboard (骨牌覆盖问题)
- hdu 5100 Chessboard(数学)
- HDU 5100 Chessboard
- HDU 5100 Chessboard 数学题
- HDU 5100Chessboard(暴力)
- HDU 5100 Chessboard
- 【HDU 5100 Chessboard 】
- hdu 5100 Chessboard
- Chessboard
- Chessboard
- LeetCode: Binary Tree Postorder Traversal
- hdu2151(概率dp)
- Strut2错误处理<init>
- VIM使用技巧及快捷操作
- 从零开始学习Gradle之一---初识Gradle
- HDOJ 5100 Chessboard 构造
- ibm stor 学习
- Unity3D学习之(多态和索引器)
- ubuntu 12.04安装配置samba
- 人活着系列之开会(最短路_floyd)
- 编辑器之神Vim
- [Cocos2d-x开发问题-6] 定时器问题
- 20141204-进化:我们在互联网上奋斗的故事-试读版读后随笔
- JSP详细篇——JDBC操作数据库(二)