A. Rikka with Chess
来源:互联网 发布:东京奥运会吉祥物 知乎 编辑:程序博客网 时间:2024/04/29 20:38
A. Rikka with Chess
Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: Java class name:
Submit Status PID: 5761
Yuta gives Rikka a chess board of size $n \times 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.
一个n×m的黑白相间的棋盘,每次可以选择一个矩形把其中的所有格子反色。问把所有格子变成一种颜色时的最少操作次数。
Input
The first line contains a number T(T <= 10) ——The number of the testcases.
Each testcase contains two numbers $n,m(n <= 10^9, m <= 10^9)$.
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
Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: Java class name:
Submit Status PID: 5761
Yuta gives Rikka a chess board of size $n \times 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.
一个n×m的黑白相间的棋盘,每次可以选择一个矩形把其中的所有格子反色。问把所有格子变成一种颜色时的最少操作次数。
Input
The first line contains a number T(T <= 10) ——The number of the testcases.
Each testcase contains two numbers $n,m(n <= 10^9, m <= 10^9)$.
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
属于规律题
#include <iostream>using namespace std;int main(){int t,n,m;cin>>t;while(t--) {cin>>n>>m;cout<<n/2+m/2<<endl;}return 0;}
0 0
- A. Rikka with Chess
- 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
- HDU 5630 Rikka with Chess
- hdoj 5630 Rikka with Chess
- hdu 5630 Rikka with Chess
- hdoj 5630-Rikka with Chess
- HDOJ 5630Rikka with Chess(游戏)
- 【HDU5630】Rikka with Chess(模拟)
- hdoj 5630 Rikka with Chess 【水题】
- hdoj Rikka with Chess 5630 (数学规律)
- 【找规律】HDOJ Rikka with Chess 5630
- 12C ORA-错误汇总5 ORA-04930 to ORA-07499
- 【TOJ1132】Square Root,二次同余方程
- Python的简单爬虫原理及实现
- 插入类排序----直接插入排序
- 从OLE到COM,再到ActiveX,再到.NET
- A. Rikka with Chess
- 12C ORA-错误汇总6 ORA-07500 to ORA-09859
- apache2.4 PHP5.6.18在win7下的安装易错部分
- 走的地方越多,会发现这个国家,这片土地值得你爱
- OC强化考试编程题答案
- dmesg
- 12C ORA-错误汇总7 ORA-09870 to ORA-12100
- 编程输出Fibonacci数列的前40项
- pthread_create函数