Pagini recente » Cod sursa (job #1468088) | Cod sursa (job #892204) | Cod sursa (job #1092520) | Cod sursa (job #944689) | Cod sursa (job #2913762)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int main(){
int n, m;
long long k=0;
fin>>n>>m;
int a[n][m];
int mut[n];
for (int i=0; i<n; i++){
for (int j=0; j<m; j++){
int x;
fin>>x;
a[i][j]=x;
}
}
for (int i=0; i<n; i++){
long long cur=0;
for (int j=0; j<m; j++){
cur+=a[i][j];
}
if (cur<0){
k-=cur;
mut[i]=0;
}
else{
k+=cur;
mut[i]=1;
}
}
for (int i=0; i<m; i++){
long long cur=0;
for (int j=0; j<n; j++){
if (mut[j]==0){
cur-=a[j][i];}
else{
cur+=a[j][i];
}
//cout<<cur<<"gsg"<<endl;
}
if (cur<0){
k-=cur;
k-=cur;
}
}
fout<<k;
}