Cod sursa(job #2094780)
Utilizator | Data | 26 decembrie 2017 15:47:33 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int n,a[10001][10001],i,j,s1,s2;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)
s1=s1+a[i][j];
if(n-i+1==j)
s2=s2+a[i][j];
}
}
cout<<abs(s1-s2);
return 0;
}