Codeforces Round #369 (Div. 2) B. Chris and Magic Square

原创 2016年08月29日 22:42:39
B. Chris and Magic Square
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
input
3
4 0 2
3 5 7
8 1 6
output
9
input
4
1 1 1 1
1 1 0 1
1 1 1 1
1 1 1 1
output
1
input
4
1 1 1 1
1 1 0 1
1 1 2 1
1 1 1 1
output
-1
Note

In the first sample case, we can fill in 9 into the empty cell to make the resulting grid a magic square. Indeed, 

The sum of numbers in each row is:

4 + 9 + 2 = 3 + 5 + 7 = 8 + 1 + 6 = 15.

The sum of numbers in each column is:

4 + 3 + 8 = 9 + 5 + 1 = 2 + 7 + 6 = 15.

The sum of numbers in the two diagonals is:

4 + 5 + 6 = 2 + 5 + 8 = 15.

In the third sample case, it is impossible to fill a number in the empty square such that the resulting grid is a magic square.

题目很简单,一些数据要用long long 还有一些蜜汁特判

//
//  main.cpp
//  B. Chris and Magic Square
//
//  Created by 张嘉韬 on 16/8/29.
//  Copyright © 2016年 张嘉韬. All rights reserved.
//

#include <iostream>
#include <cstdio>
using namespace std;
typedef unsigned long long ll;
const int maxn=500+10;
int n;
ll sum,map[maxn][maxn];
int check()
{
    for(int i=1;i<=n;i++)
    {
        ll temp=0;
        for(int j=1;j<=n;j++) temp+=map[i][j];
        if(temp!=sum) return 0;
    }
    for(int j=1;j<=n;j++)
    {
        ll temp=0;
        for(int i=1;i<=n;i++) temp+=map[i][j];
        if(temp!=sum) return 0;
    }
    ll temp=0;
    for(int i=1;i<=n;i++)
    {
        temp+=map[i][i];
    }
    if(temp!=sum) return 0;
    temp=0;
    for(int i=1;i<=n;i++)
    {
        temp+=map[i][n-i+1];
    }
    if(temp!=sum) return 0;
    return 1;
}
int main(int argc, const char * argv[]) {
    //freopen("/Users/zhangjiatao/Documents/暑期训练/input.txt","r",stdin);
    int x=0,y=0;
    scanf("%d",&n);
    if(n==1) {scanf("%d",&x);printf("1\n"); return 0;}
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            int temp;
            scanf("%d",&temp);
            if(temp==0){ x=i; y=j;}
            map[i][j]=temp;
        }
    }
    int  row=0;
    ll ans=0;
    sum=0;
    for(int i=1;i<=n;i++) if(i!=x) {row=i; break;}
    for(int i=1;i<=n;i++) sum+=map[row][i];
    for(int i=1;i<=n;i++) ans+=map[x][i];
    ans=sum-ans;
    map[x][y]=ans;
    if(check()&&ans>0) cout<<ans<<endl;//printf("%lld\n",ans);
    else printf("-1\n");
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

Codeforces Round #369 (Div. 2) B. Chris and Magic Square

B. Chris and Magic Square time limit per test 2 seconds memory limit per test 256 megaby...

Codeforces Round #369 (Div. 2) B. Chris and Magic Square【数学,模拟】

题意:输入一个n*n的矩阵,有一个位置为0,问你能否在0处填上一个正整数,使得该矩阵的每一行,每一列,主对角,副对角线上的和都相等,即构成一个幻方。 由于要构成一个幻方,所以只用根据行的和求出要填的数...

【Codeforces Round #369 (Div. 2)】Codeforces 711B Chris and Magic Square

模拟
  • sdfzyhx
  • sdfzyhx
  • 2016年08月30日 13:54
  • 156

codeforces#369Div2(711B)Chris and Magic Square

codeforces#369Div2BChris and Magic Square

codeforces 711B. Chris and Magic Square【模拟】

B. Chris and Magic Square time limit per test 2 seconds memory limit per test 256 megaby...
  • Bcwan_
  • Bcwan_
  • 2016年08月29日 23:32
  • 604

Chris and Magic Square CodeForces - 711B

ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n × n magic grid o...

Codeforces 711B- Chris and Magic Square

B. Chris and Magic Square time limit per test 2 seconds memory limit per test 256 megaby...
  • LDUtyk
  • LDUtyk
  • 2016年08月31日 18:44
  • 434

CodeForces 711B Chris and Magic Square(找规律)

题目: B. Chris and Magic Square time limit per test 2 seconds memory limit per test 256 megabyte...

【codeforces711B】Chris and Magic Square

B. Chris and Magic Square time limit per test 2 seconds memory limit per test 256 megaby...

Codeforces Problem 711B Chris and Magic Square(constructive algorithms)

Codeforces Problem 711B Chris and Magic Square(constructive algorithms)
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces Round #369 (Div. 2) B. Chris and Magic Square
举报原因:
原因补充:

(最多只允许输入30个字)