Pagini recente » Cod sursa (job #1432096) | Cod sursa (job #2409603) | Cod sursa (job #994606) | Cod sursa (job #2341632) | Cod sursa (job #2976001)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f ("flip.in");
ofstream g ("flip.out");
long s=0,x,a[16][16];
int i,j,n,m;
f>>n;
f>>m;
if(n<=0 || m<=0)
g<<'\0';
for(i=0;i<n;i++){
for(j=0;j<m;j++){
f>>x;
a[i][j]=x;
}
}
for(i = 0; i < n; i++){
int s1 = 0;
int s2 = 0;
for(j = 0; j < m; j++){
s1+=a[i][j];
s2+=-a[i][j];
}
if(s2>s1)
for(j = 0; j < m; j++){
a[i][j]=-a[i][j];
}
}
for(j = 0; j < m; j++){
int s1 = 0;
int s2 = 0;
for(i = 0; i < n; i++){
s1+=a[i][j];
s2+=-a[i][j];
}
s+=max(s1,s2);
}
g<<s;
g.close();
f.close();
return 0;
}