Game Outcome

A - Game Outcome

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Sherlock Holmes and Dr. Watson played some game on a checkered board n × n in size. During the game they put numbers on the board's squares by some tricky rules we don't know. However, the game is now over and each square of the board contains exactly one number. To understand who has won, they need to count the number of winning squares. To determine if the particular square is winning you should do the following. Calculate the sum of all numbers on the squares that share this column (including the given square) and separately calculate the sum of all numbers on the squares that share this row (including the given square). A square is considered winningif the sum of the column numbers is strictly greater than the sum of the row numbers.

For instance, lets game was ended like is shown in the picture. Then the purple cell is winning, because the sum of its column numbers equals 8 + 3 + 6 + 7 = 24, sum of its row numbers equals 9 + 5 + 3 + 2 = 19, and 24 > 19.

Input

<p< p="">

The first line contains an integer n (1 ≤ n ≤ 30). Each of the following n lines contain n space-separated integers. The j-th number on the i-th line represents the number on the square that belongs to the j-th column and the i-th row on the board. All number on the board are integers from 1 to 100.

Output

<p< p="">

Print the single number — the number of the winning squares.

Sample Input

Input

1
1

Output

0

Input

2
1 2
3 4

Output

2

Input

4
5 7 8 4
9 5 3 2
1 6 6 4
9 5 7 3

Output

6

Hint

<p< p="">

In the first example two upper squares are winning.

In the third example three left squares in the both middle rows are winning:

5 7 8 4
9 5 3 2
1 6 6 4
9 5 7 3

解题报告：

以网格中每个数字为基准， 统计列和大于行和的个数。

Code：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>

using namespace std;

const int MAXN = 35;
int check[MAXN][MAXN];
int c[MAXN], r[MAXN];

int main()
{
    memset(check, 0, sizeof check);
    memset(c, 0, sizeof c);
    memset(r, 0, sizeof r);

    int n;
    cin >> n;
    int cnt = 0;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            cin >> check[i][j];
            r[i] += check[i][j];
        }
    }

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            c[i] += check[j][i];
        }
    }

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(c[j] > r[i])
                cnt++;
        }
    }

    cout << cnt << endl;
    return 0;
}