HDOJ 5630-Rikka with Chess
2016-02-21 13:33
411 查看
Rikka with Chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 111 Accepted Submission(s): 96
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
The first line contains a number
T(T≤10)
——The number of the testcases.
Each testcase contains two numbers n,m(n≤109,m≤109).
[align=left]Output[/align]
For each testcase, print a single number which represents the answer.
[align=left]Sample Input[/align]
3 1 2 2 2 3 3
[align=left]Sample Output[/align]
1 2 2
[align=left]Source[/align]
BestCoder Round #73 (div.2)
解题思路:
题目很好理解,就是有一个n*n的棋盘其中黑白方块相同颜色的是不会相邻的,每次我们都可以制定一个任意大小的矩形,将其中的颜色反转,问最小通过多少步可以将整个棋盘反转成同一种颜色。
很好理解先将2.4.6.8...........行反转,再将2.4.6.8..........反转就是最小步骤。
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int main() { int t,a,b; scanf("%d",&t); while(t--) { scanf("%d%d",&a,&b); int wc,wcnm; wc=a/2; wcnm=b/2; printf("%d\n",wc+wcnm); } return 0; }
相关文章推荐
- 【慕课笔记】第二章 认识JAVA中的字符串 第5节 认识JAVA中stringBuilder类
- HighCharts_数据值重叠问题
- Ubuntu安装wine时停止在"正在设定ttf-mscorefonts-installer"解决方法
- Android面试整理(2016)
- 进程上下文
- 分布式缓存系统_Memcached
- 深入理解Linux内核 第二章知识点总结
- hive原生和复合类型的数据载入和使用
- LeetCode-95. Unique Binary Search Trees II
- window.onload和DOMReady
- C#删除WebBrowser控件的Session
- git的安装配置及使用
- C#删除WebBrowser控件的Session
- Machine Learning - Solving the Problem of Overfitting: Regularization
- raid及mdadm命令之一(含shell显示字体颜色等)
- Android SDK部分主要API功能简介
- Metasploit渗透测试实验报告
- Activity浅析
- 安卓基础(十五)
- Spring.Net学习笔记(0)-错误汇总