Time limit: 1.0 second
Memory limit: 64 MB
A brand new sapper robot is able to neutralize mines in a rectangular region having integer height and width (N and
M respectively). Before the robot begins its work it is placed near the top leftmost cell of the rectangle heading right. Then the robot starts moving and neutralizing mines making a clockwise spiral way (see picture). The spiral twists towards the
inside of the region, covering all the cells. The region is considered safe when all the cells are visited and checked by the robot.
Your task is to determine the number of the turns the robot has to make during its work.
Input
The input contains two integers in the following order:
N, M (1 ≤ N, M ≤ 231 ? 1).
Output
The output consists of a single integer value — the number of the turns.
Sample
Problem Source: 2002-2003 ACM Central Region of Russia Quarterfinal Programming Contest, Rybinsk, October 2002
解析：找规律。一定要注意n和m的大小关系，由于出发地点是固定的。
AC代码：
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, m;
while(~scanf("%lld%lld", &n, &m)){
long long ans;
if(n <= m) ans = 2 * (n - 1);
else ans = 2 * m - 1;
printf("%lld\n", ans);
}
return 0;
}
