B. Chris and Magic Square

题目连接：

http://www.codeforces.com/contest/711/problem/B

Description

ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n × n magic grid on the entrance which is filled with integers. Chris noticed that exactly one of the cells in the grid is empty, and to enter Udayland, they need to fill a positive integer into the empty cell.

Chris tried filling in random numbers but it didn't work. ZS the Coder realizes that they need to fill in a positive integer such that the numbers in the grid form a magic square. This means that he has to fill in a positive integer so that the sum of the numbers in each row of the grid (), each column of the grid (), and the two long diagonals of the grid (the main diagonal — and the secondary diagonal — ) are equal.

Chris doesn't know what number to fill in. Can you help Chris find the correct positive integer to fill in or determine that it is impossible?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 500) — the number of rows and columns of the magic grid.

n lines follow, each of them contains n integers. The j-th number in the i-th of them denotes ai, j (1 ≤ ai, j ≤ 109 or ai, j = 0), the number in the i-th row and j-th column of the magic grid. If the corresponding cell is empty, ai, j will be equal to 0. Otherwise, ai, j is positive.

It is guaranteed that there is exactly one pair of integers i, j (1 ≤ i, j ≤ n) such that ai, j = 0.

Output

Output a single integer, the positive integer x (1 ≤ x ≤ 1018) that should be filled in the empty cell so that the whole grid becomes a magic square. If such positive integer x does not exist, output  - 1 instead.

If there are multiple solutions, you may print any of them.

Sample Input

3

4 0 2

3 5 7

8 1 6

Sample Output

9

Hint

题意

给你一个\(n*n\)的矩阵，这个矩形是魔法矩阵的话，要求每一行，每一列，对角线的数的和都相同。

现在给你一个矩阵，里面恰好有一个空没有填数，问你是否能够使得这个矩阵成为魔法矩阵。

如果可以，输出应该填的数的大小。

题解：

先算出一行没有空的值的和，然后再去填这个数，然后再 去check每一行，每一列就好了。

代码

#include<bits/stdc++.h>

using namespace std;

const int maxn = 510;

long long a[maxn][maxn];

int main()

{

    int n,x,y;

    scanf("%d",&n);

    for(int i=1;i<=n;i++)

        for(int j=1;j<=n;j++)

        {

            scanf("%lld",&a[i][j]);

            if(a[i][j]==0)x=i,y=j;

        }

    if(n==1)

    {

        printf("1");

        return 0;

    }

    int ax=1;

    while(ax==x)ax++;

    long long sum = 0;

    for(int i=1;i<=n;i++)

        sum+=a[ax][i];

    long long tmp=0;

    for(int i=1;i<=n;i++)

        tmp+=a[x][i];

    a[x][y]=sum-tmp;

    if(a[x][y]<=0)

    {

        printf("-1\n");

        return 0;

    }

    for(int i=1;i<=n;i++)

    {

        tmp=0;

        for(int j=1;j<=n;j++)

            tmp+=a[i][j];

        if(tmp!=sum)

        {

            printf("-1\n");

            return 0;

        }

    }

    for(int j=1;j<=n;j++)

    {

        tmp=0;

        for(int i=1;i<=n;i++)

            tmp+=a[i][j];

        if(tmp!=sum)

        {

            printf("-1\n");

            return 0;

        }

    }

    tmp = 0;

    for(int i=1;i<=n;i++)

        tmp+=a[i][i];

    if(tmp!=sum)

    {

        printf("-1\n");

        return 0;

    }

    tmp=0;

    for(int i=1;i<=n;i++)

        tmp+=a[i][n-i+1];

    if(tmp!=sum)

    {

        printf("-1\n");

        return 0;

    }

    printf("%lld\n",a[x][y]);

}