P4S/magico11.cpp at master · gagallo7/P4S · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <iostream>

using namespace std;

int m [1000][1000];
int v [1000], h [1000];

int sumRes ( int sum, int n )
{
    int acc;
    int max = n*n;
    for ( int i = 0; i < n; i++ )
    {
        for ( int j = 0; j < n /*&& v[i] < sum && h[i] < sum*/ && m[i][j] <= max; j++ )
        {
            //acc += m[i][j];
            v[i] += m[i][j];
            v[i] ^= m[j][i];
        }
        /*
        if ( acc != sum )
        {
            return 0;
        }

        acc = 0;
*/
        /*
        for ( int j = 0; j < n && acc < sum && m[i][j] <= max; j++ )
        {
            acc += m[j][i];
        }
        if ( acc != sum )
        {
            return 0;
        }
        */
        if ( !v[i] )
        {
            return 0;
        }
    }


    return sum;
}

int main ()
{
    int n;

    cin >> n;

    for ( int i = 0; i < n; i++ )
    {
        v[i] = 0;
        h[i] = 0;
        for ( int j = 0; j < n; j++ )
        {
            cin >> m [i][j];
        }
    }

    int sum = 0;
    int max = n*n;

    for ( int i = 0; i < n; i++ )
    {
        if ( m[i][i] > max )
        {
            cout << 0;
            return 0;
        }
        sum += m[i][i];
    }

    /*
       for ( int i = 0; i < n; i++ )
       {
       acc += m[i][n-1-i];
       }
       */

    cout << sumRes ( sum, n );

    cout << endl;

    return 0;
}