// Program by Akash Tripathi (@proakash256)
#include <stdio.h>
#include <stdlib.h>
int diagonalDifference(int arr_rows, int arr_columns,
int** arr)
{
int sum1= 0 , sum2 = 0;
for(int i = 0; i < arr_rows; i = i + 1)
{
for(int j = 0; j < arr_columns; j = j + 1)
{
if(i == j)
sum1 = sum1 + arr[i][j];
if(j == (arr_rows - 1 - i))
sum2 = sum2 + arr[i][j];
}
}
return abs((sum1 - sum2));
}
int main()
{
int n;
scanf("%d" , &n);
int** arr = malloc(n * sizeof(int*));
for (int i = 0; i < n; i++) {
*(arr + i) = malloc(n * (sizeof(int)));
for (int j = 0; j < n; j++) {
scanf("%d" , &(*(*(arr + i) + j)));
}
}
int result = diagonalDifference(n, n, arr);
printf("%d\n", result);
return 0;
}
Comments
Post a Comment