tyvj1109| N-Order Magic Square

Description
In a square consisting of several neatly arranged numbers, the sum of the numbers of any row, line, and diagonal in the graph is equal, and a chart of this nature is called the magic square.
It has been determined that the N-Order magic Square (n>=3) can construct the magic square.
our problem is, when constructing the magic square, the sum of the number of arbitrary rows is cumulative and how much.
Input Format
a number n means n-order magic square n<=10000
output Format
a number, a number of arbitrary rows, and an accumulation of
Test Sample 1
input
3

Output
the

Notes
Combinatorial Math Examples

Analysis: Set of formulas.

#include <iostream>usingnamespace  std; int Main () {    longlong n,ans=0;     >> N;    Ans= (1+n*n) *n/2;     <<

tyvj1109| N-Order Magic Square