Pagini recente » Cod sursa (job #2261583) | Cod sursa (job #2959603) | Cod sursa (job #1356050) | Cod sursa (job #1281476) | Cod sursa (job #2119912)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int l[20],c[20],a[20][20];
int n,m;
void citire(){
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
f>>a[i][j];
l[i]+=a[i][j];
c[j]+=a[i][j];
}
f.close();
}
void flip(int k,int i){
if(k==0){
l[i]=-l[i];
for(int j=1;j<=m;j++)
c[j]=c[j]-2*a[i][j];
}
else{
c[i]=-c[i];
for(int j=1;j<=n;j++)
l[j]=l[j]-2*a[j][i];
}
}
void solutie(){
int s=0;
for(int i=1;i<=n;i++){
if(l[i]<0)
flip(0,i);
}
for(int j=1;j<=m;j++){
if(c[j]<0)
flip(1,j);
s+=c[j];
}
g<<s;g.close();
}
int main(){
citire();cout<<"t";
solutie();
return 0;
}