Pagini recente » Cod sursa (job #2728333) | Cod sursa (job #2696757) | Cod sursa (job #1052065) | Cod sursa (job #1589555) | Cod sursa (job #888324)
Cod sursa(job #888324)
#include <iostream>
#include <fstream>
using namespace std;
long long s,a[20][20],sum1,sum2;
int m,n,i,j;
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
f>>a[i][j];
for(i=1; i<=n; i++)
{
sum1=0;
sum2=0;
for(j=1; j<=m; j++)
{
sum1+=a[i][j];
sum2-=a[i][j];
}
if(sum2>sum1)
for(j=1; j=m; j++)
a[i][j]=-a[i][j];
}
for(i=1; i<=m; i++)
{
sum1=0;
sum2=0;
for(j=1; j<=n; j++)
{
sum1+=a[i][j];
sum2-=a[i][j];
}
if(sum2>sum1)
for(j=1; j=n; j++)
a[i][j]=-a[i][j];
}
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
s+=a[i][j];
g<<s;
f.close();
g.close();
return 0;
}