hackerrank-solutions/diagonal difference.cpp at master · humblelad/hackerrank-solutions · 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


#include <bits/stdc++.h>


using namespace std;
int n;
// Complete the diagonalDifference function below.
int diagonalDifference(vector<vector<int>> arr) {
unsigned int one=0;unsigned int two=0;
    for(int x=0;x<n;x++)
    {
        for(int y=x;y<=x;y++)
        {
            one+=arr[x][y];

        }
    }  int s;
    for(int r=0;r<n;r++)
    {
        s=n-(r+1);

            two+=arr[r][s];


    }

    int tell=one-two;

    return tell;


}

int main()
{
    ofstream fout(getenv("OUTPUT_PATH"));


    cin >> n;
    cin.ignore(numeric_limits<streamsize>::max(), '\n');

    vector<vector<int>> arr(n);
    for (int i = 0; i < n; i++) {
        arr[i].resize(n);

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

        cin.ignore(numeric_limits<streamsize>::max(), '\n');
    }

    int result = diagonalDifference(arr);

    fout << abs(result) << "\n";

    fout.close();

    return 0;
}