思维 hdu 5100 (chessboard)
来源:互联网 发布:深圳万度网络科技开发 编辑:程序博客网 时间:2024/05/17 05:16
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*n的矩阵,问用k*1的矩形覆盖,最多能覆盖多少小矩形。
题解:规律是:分成三种情况,n<k,肯定不能覆盖。n>k时,设m=n%k,如果m<=k/2,不能覆盖的矩形为m*m,相反,不能覆盖为(k-m)*(k-m).详细题解
<span style="font-size:18px;">#include<cstdio>#include<cstring>using namespace std;void solve(int n,int k){int s=n*n;if (n<k)printf ("0\n");else{int a=n%k;if (a<=k/2)printf ("%d\n",s-a*a);else{printf ("%d\n",s-(k-a)*(k-a));}}}int main(){int t,n,k;scanf ("%d",&t);while (t--){scanf ("%d %d",&n,&k);solve(n,k);}return 0;} </span>
- 思维 hdu 5100 (chessboard)
- 【HDU】-5100-Chessboard(思维)
- hdoj 5100 Chessboard 【思维】
- HDU-6122 Color the chessboard(思维题)
- hdoj 5100 Chessboard (思维规律)
- HDU 6122 Color the chessboard【思维】
- hdu-6122 Color the chessboard 思维
- hdu 5100 Chessboard(数学)
- HDU 5100 Chessboard
- HDU 5100 Chessboard 数学题
- HDU 5100Chessboard(暴力)
- HDU 5100 Chessboard
- 【HDU 5100 Chessboard 】
- hdu 5100 Chessboard
- Chessboard HDU
- bestcoder#17 1001&&HDU 5100 Chessboard(数学)
- hdu 5100 Chessboard(Bestcoder Round #17)
- 【codeforces】-445A- DZY Loves Chessboard(思维)
- 算法讲解之Dynamic Programing —— 区间DP [变形:环形DP]
- bzoj3998: [TJOI2015]弦论
- 数据结构实验之栈一:进制转换
- lightoj 1010 - Knights in Chessboard (找规律思维)
- IE和谷歌浏览器主页被篡改的修复
- 思维 hdu 5100 (chessboard)
- 努力
- 2016年8月16号
- eclipse发布动态web项目之后,无法生成class文件问题
- Android 将View内容存为Bitmap
- NULL ‘\0’ “” 三者的区别
- ASP.NET页面揭秘之页面生命周期
- Wall Painting
- How to Use MMC/SDC——翻译