HDU5100 Chessboard【组合数学】
来源:互联网 发布:4核8g服务器mysql配置 编辑:程序博客网 时间:2024/06/05 02:09
Chessboard
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1222 Accepted Submission(s): 526Problem 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.
InputThere 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 )
OutputFirst line contain the number of cases T (
In the next T lines contain T cases , Each case has two integers n and k. (
Print the maximum number of chessboard squares tiled.
Sample Input26 35 3
3624
BestCoder Round #17
问题链接:HDU5100 Chessboard
问题简述:(略)
问题分析:这是一个组合数学问题,计算原理参见参考链接。
程序说明:(略)
题记:(略)参考链接:Matrix67: The Aha Moments
AC的C++语言程序如下:
/* HDU5100 Chessboard */#include <iostream>using namespace std;int getnum(int n, int k){ if(n < k) return 0; int m = n % k; if(m <= k / 2) return n * n - m * m; else return n * n - (k - m) *(k - m);}int main(){ std::ios::sync_with_stdio(false); int t, n, k; cin >> t; while(t--) { cin >> n >> k; cout << getnum(n, k) << endl; } return 0;}
阅读全文
0 0
- HDU5100 Chessboard【组合数学】
- HDU5100-Chessboard
- hdu5100---Chessboard
- HDU5100 Chessboard
- HDU5100 Chessboard(数学题)
- HDU5100
- 暴力,组合数学(ZOJ 3779,Chessboard and Flowers)
- hdu 5100 Chessboard(数学)
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- 组合数学
- Android_设置动画效果的两种方式
- opencv总结2
- iOS程序猿之Framework 的创建与使用
- java 语法基础 前缀++,和后缀++
- HashCode的作用原理和实例解析
- HDU5100 Chessboard【组合数学】
- mysql 查询表,视图,触发器,函数,存储过程
- A very hard mathematic problem HDU
- IAP15W4K58S4 端口配置
- 库柏裕华SDK获取视频
- 更好
- Gradle2.0用户指南翻译——第一章. 介绍
- 语音增强-自适应回声消除
- idea配置maven