HDU杭电5630 ( Rikka with Chess )
来源:互联网 发布:nba2k15mc霍华德的数据 编辑:程序博客网 时间:2024/06/06 00:22
http://acm.hdu.edu.cn/showproblem.php?pid=5630
Rikka with Chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 516 Accepted Submission(s): 430
Problem Description
Yuta gives Rikka a chess board of size n×m .
As we all know, on a chess board, every cell is either black or white and every two cells that share a side have different colors.
Rikka can choose any rectangle formed by board squares and perform an inversion, every white cell becomes black, and vice versa.
Rikka wants to turn all cells into the same color, please tell Rikka the minimal number of inversions she need to achieve her goal.
As we all know, on a chess board, every cell is either black or white and every two cells that share a side have different colors.
Rikka can choose any rectangle formed by board squares and perform an inversion, every white cell becomes black, and vice versa.
Rikka wants to turn all cells into the same color, please tell Rikka the minimal number of inversions she need to achieve her goal.
Input
The first line contains a number T(T≤10) ——The number of the testcases.
Each testcase contains two numbersn,m(n≤109,m≤109) .
Each testcase contains two numbers
Output
For each testcase, print a single number which represents the answer.
Sample Input
31 22 23 3
Sample Output
122
题意:棋盘上是黑白交替的棋子,对某行或者某列处理,问最少多少次能把棋盘上的元素变成一种颜色
举个例子吧:
4*4的棋盘,你先对第二行第四行处理,然后对第二列第四列处理,你会发现解决了,就是这个规律,自己可以试试,这里不方面画图
#include <cstdio>#include <cstring>#include <algorithm>#define max(a,b) (a>b?a:b)#define min(a,b) (a<b?a:b)int main(){ int T; int n,m; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); if(n<m) { int temp=n; n=m;m=temp; } if(m==1) { printf("%d\n",n/2); continue; } printf("%d\n",n/2+m/2); } return 0;}
1 0
- HDU杭电5630 ( Rikka with Chess )
- 杭电5630 Rikka with Chess
- HDU 5630 Rikka with Chess
- HDU 5630 Rikka with Chess
- HDU 5630 Rikka with Chess
- HDU 5630 Rikka with Chess
- HDU 5630 Rikka with Chess
- hdu 5630 Rikka with Chess
- HDU 5630:Rikka with Chess【规律】
- Hdu 5630 Rikka with Chess【水】
- HDU 5630 Rikka with Chess(翻棋子)
- HDU 5630 Rikka with Chess(构造)
- HDOJ 5630 Rikka with Chess
- HDOJ 5630-Rikka with Chess
- HDOJ 5630 Rikka with Chess
- hdoj 5630 Rikka with Chess
- hdoj 5630-Rikka with Chess
- hdu 5630 Rikka with Chess【思维+递推】
- 67. Add Binary
- 仿微信点击回复,输入框定位到列表的底部
- 第二周项目-就拿胖子说事
- iOS7.0 iphone5边界黑框的问题
- 有关HealthKit的那些事
- HDU杭电5630 ( Rikka with Chess )
- Grunt学习——检查代码完整性
- 206. Reverse Linked List
- DocumentHelper和SAXReader解析XML字符串
- C# chart 属性
- MySQL数据库复制概念及数据库架构不断扩展方案
- JS nodeType返回类型
- 第二周项目2-就拿胖子说事
- 搜索引擎入门