Codeforces 1459 B. Move and Turn（有意思的数学题）

A robot is standing at the origin of the infinite two-dimensional plane. Each second the robot moves exactly 1 meter in one of the four cardinal directions: north, south, west, and east. For the first step the robot can choose any of the four directions, but then at the end of every second it has to turn 90 degrees left or right with respect to the direction it just moved in. For example, if the robot has just moved north or south, the next step it takes has to be either west or east, and vice versa.

The robot makes exactly 𝑛 steps from its starting position according to the rules above. How many different points can the robot arrive to at the end? The final orientation of the robot can be ignored.

Input
The only line contains a single integer 𝑛 (1≤𝑛≤1000) — the number of steps the robot makes.

Output
Print a single integer — the number of different possible locations after exactly 𝑛 steps.

Examples
inputCopy
1
outputCopy
4
inputCopy
2
outputCopy
4
inputCopy
3
outputCopy
12
Note
In the first sample case, the robot will end up 1 meter north, south, west, or east depending on its initial direction.

In the second sample case, the robot will always end up 2‾√ meters north-west, north-east, south-west, or south-east.

题意：
走n步，上一步是左右，下一步就必须得是上下，反之亦然。求最终点可能的方案数。

思路：
比赛的时候是打表过的，但是这是可以用数学方法推出来的。

• 假设$n=2k$，那么水平和垂直方向都移动了$k$步，水平坐标可能的值就是$k,k-2,k-4...-k$，一共有$k+1$个，竖直方向同理。所以最终方案数就是水平坐标方案数乘以垂直坐标方案数为$(n/2+1)\ast (n/2+1)$
• 假设$n=2k+1$，和上面的分析方法一样，有两种可能：要么水平方向移动了$k$步且竖直方向移动了$k+1$步，要么水平方向移动了$k+1$步且竖直方向移动了$k$步；两种可能的方案数都是$(k+1)\ast (k+2)$，所以最终结果就是$2\ast (k+1)\ast (k+2)$，也就是$2\ast (n/2+1)\ast (n/2+2)$。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;

int main() {
    int n;scanf("%d",&n);
    if(!(n & 1)) {
        printf("%d\n",(n / 2 + 1) * (n / 2 + 1));
    } else {
        printf("%d\n",2 * (n / 2 + 1) * (n / 2 + 2));
    }
    return 0;
}