hdoj 5630 Rikka with Chess【思维】
2016-03-06 19:14
232 查看
Rikka with Chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 503 Accepted Submission(s): 420
Problem DescriptionYuta 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.
Input
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).
Output
For each testcase, print a single number which represents the answer.
Sample Input
3 1 2 2 2 3 3
Sample Output
1 2 2
Source
BestCoder Round #73 (div.2)
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { int t; scanf("%d", &t); while(t--) { int n, m; scanf("%d%d", &n,&m); printf("%d\n", n/2+m/2); } return 0; }
相关文章推荐
- POJ 3187 Backward Digit Sums【杨辉三角】【全排列】
- Sudoku Killer
- 项目:漫漫H5游戏
- HTML网页之计算器代码
- Sudoku Killer
- CSS多种方法实现分隔线
- Linux基础命令及系统设定查看
- error C2099: 初始值设定项不是常量
- 编译环境
- play framerowk 1.2.7 多种打包(预编译)方式
- hdoj 1027 Ignatius and the Princess II 【全排列】【STL】
- Java-猜拳游戏
- Python 字符串方法详解
- 机械传动控制第二周学习随笔
- StringBuffer和StringBuilder存在的作用是什么
- 入侵检测基础知识
- MySQL数据库的基本操作及存储引擎
- C++ list的基本操作和使用
- js基础的总结
- 控制反转与依赖注入