forked from amankayat/HackerRank-Solution-Algorithm-
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdiagonal_difference.cpp
More file actions
49 lines (44 loc) · 768 Bytes
/
diagonal_difference.cpp
File metadata and controls
49 lines (44 loc) · 768 Bytes
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
#include<iostream>
#include<stdio.h>
#include <cstdlib>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using std::string;
int diagonal_diff(int a[50][50],int n){
int sum1=0;
int sum2=0;
int diff =0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j){
sum1+=a[i][j];
}
if ((i + j) == (n - 1)){
sum2 += a[i][j];
}
}
}
diff = abs(sum1-sum2);
return diff;
}
int main(){
int rc;
int ar[50][50];
cin>>rc;
for(int i=0;i<rc;i++){
for(int j=0;j<rc;j++){
cin>>ar[i][j];
}
}
cout<<"our input array is: \n";
for(int i=0;i<rc;i++){
for(int j=0;j<rc;j++){
cout<<ar[i][j]<<" ";
}
cout<<"\n";
}
int result = diagonal_diff(ar,rc);
cout<<"difference is : "<<result;
}