Pagini recente » Cod sursa (job #3128750) | Cod sursa (job #2953219) | Cod sursa (job #281487) | Cod sursa (job #2831815) | Cod sursa (job #96956)
Cod sursa(job #96956)
#include<iostream.h>
#include<math.h>
#include<fstream.h>
unsigned n,m;
long a[100][20];
void adun() {
unsigned sn,sp,i,j,k;
for( i=1;i<=n;i++){
sn=0;sp=0;
for( j=1;j<=m;j++)
if(a[i][j]>=0) sp+=a[i][j];
else sn+=abs(a[i][j]);
if(sn>sp) for( k=1;k<=m;k++) a[i][k]=-a[i][k];
}
for( j=1;j<=m;j++){
sn=0;sp=0;
for(i=1;i<=n;i++)
if(a[i][j]>=0) sp+=a[i][j];
else sn+=abs(a[i][j]);
if(sn>sp) for(k=1;k<=n;k++) a[k][j]=-a[k][j];
}
}
int main() {
ifstream f1("flip.in");
ofstream f2("flip.out");
f1>>n>>m;
for(unsigned i=1;i<=n;i++)
for(unsigned j=1;j<=m;j++)
f1>>a[i][j];
long s=0;
if(n>=1 && m<=16) {
adun();
for(unsigned i=1;i<=n;i++)
for(unsigned j=1;j<=m;j++)
s+=a[i][j];
f2<<s;
}
f1.close();
f2.close();
return 0;
}