A. Alex and a Rhombus CF div2 #569 A (找规律）

A. Alex and a Rhombus
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
While playing with geometric figures Alex has accidentally invented a concept of a nn-th order rhombus in a cell grid.

A 1-st order rhombus is just a square 1×1 (i.e just a cell).

A n-th order rhombus for all n≥2n≥2 one obtains from a n−1-th order rhombus adding all cells which have a common side with it to it (look at the picture to understand it better).

Input
The first and only input line contains integer nn (1≤n≤100) — order of a rhombus whose numbers of cells should be computed.

Output
Print exactly one integer — the number of cells in a nn-th order rhombus.

Examples
inputCopy
1
outputCopy
1
inputCopy
2
outputCopy
5
inputCopy
3
outputCopy
13
Note
Images of rhombus corresponding to the examples are given in the statement.

找规律 ： 发现每个数是N的平方加N减一的平方
当然也可以递推来做

#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);

    printf("%d\n",(n*n + (n - 1)* (n - 1)));
    return 0;
}