Pagini recente » Cod sursa (job #1470781) | Cod sursa (job #2779755) | Cod sursa (job #1660154) | Cod sursa (job #1658004) | Cod sursa (job #888394)
Cod sursa(job #888394)
#include <iostream>
#include <fstream>
using namespace std;
int s=0,a[20][20],sum;
int m=0,n=0,i,j;
int main()
{
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];
s+=a[i][j];
}
for(i=1; i<=n; i++)
{
sum=s;
for(j=1; j<=m; j++)
sum-=2*a[i][j];
if(sum>s)
{
s=sum;
for(j=1; j<=m; j++)
a[i][j]=-a[i][j];
}
}
for(i=1; i<=m; i++)
{
sum=s;
for(j=1; j<=n; j++)
sum-=2*a[i][j];
if(sum>s)
{
s=sum;
for(j=1; j<=n; j++)
a[i][j]=-a[i][j];
}
}
g<<s;
f.close();
g.close();
return 0;
}