hdoj--5100--Chessboard(数学推理)
2016-03-05 16:46
281 查看
Total Submission(s): 910 Accepted Submission(s): 384
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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)
[align=left]Output[/align]
Print the maximum number of chessboard squares tiled.
[align=left]Sample Input[/align]
2
6 3
5 3
[align=left]Sample Output[/align]
36
24
[align=left]Source[/align]
BestCoder Round #17
我去你妹的数学题,真坑
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): 910 Accepted Submission(s): 384
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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)
[align=left]Output[/align]
Print the maximum number of chessboard squares tiled.
[align=left]Sample Input[/align]
2
6 3
5 3
[align=left]Sample Output[/align]
36
24
[align=left]Source[/align]
BestCoder Round #17
我去你妹的数学题,真坑
http://www.matrix67.com/blog/archives/5900
#include<cstdio> #include<cstring> int main() { int t; scanf("%d",&t); while(t--) { int n,k; scanf("%d%d",&n,&k); if(k>n) printf("0\n"); else { int num=n%k; if(num>k/2) num-=k; printf("%d\n",n*n-num*num); } } return 0; }
相关文章推荐
- hdoj--5100--Chessboard(数学推理)
- 有没有必要阅读源码
- 一起talk C栗子吧(第二十回:C语言实例--括号匹配)
- 读书笔记----哲学家们都干了什么
- 整理六百篇web前端知识混总
- gdb笔记
- Spring tool suite 快速创建Spring MVC 项目
- 基础母函数模版
- iOS开发之字符串搜索包含
- android中SQLlite数据库中对应的SQL数据库的查询 query ,delete,insert
- 前端学习总结(八)NodeJS——前端工程师通向后端的里程碑
- 前端学习总结(七)Angular.js——以数据交互为核心的前端框架
- [国嵌攻略][104][Linux内核模块设计]
- JS面向对象组件(四) -- 面向对象的继承
- PHP - __clone 对象克隆
- 图片3D旋转
- 前端学习总结(六)Bootstrap
- error on line 3 at column 8: Encoding error
- HTTP 请求方式: GET和POST的比较
- 第一章:Android开发基础