Pagini recente » Cod sursa (job #2901052) | Cod sursa (job #933661) | Cod sursa (job #1018121) | Cod sursa (job #1669159) | Cod sursa (job #233348)
Cod sursa(job #233348)
#include <fstream.h>
void main()
{
int n, m, i, j, max=0, aux1, aux2, a[17][17];
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
{ aux1=0;
aux2=0;
for(j=1;j<=m;j++)
aux1=aux1+a[i][j];
for(j=1;j<=m;j++)
aux2=aux2-a[i][j];
if(aux2>aux1)
for(j=1;j<=m;j++)
a[i][j]=a[i][j]*(-1);
}
for(i=1;i<=m;i++)
{ aux1=0;
aux2=0;
for(j=1;j<=n;j++)
aux1=aux1+a[j][i];
for(j=1;j<=n;j++)
aux2=aux2-a[j][i];
if(aux2>aux1)
{ for(j=1;j<=n;j++)
a[j][i]=a[j][i]*(-1);
aux1=aux2;
}
max=max+aux1;
}
g<<max;
f.close();
g.close();
}