Pagini recente » Istoria paginii runda/aicluj13.12 | Cod sursa (job #826764) | Cod sursa (job #2600693) | Istoria paginii runda/test_runda_razvan | Cod sursa (job #942314)
Cod sursa(job #942314)
#include<iostream>
#include<fstream>
#include<conio.h>
using namespace std;
long int n, a[17][17],i,j, s1, s2,m,Smax;
int main(){ifstream f("flip.in");
f>>n>>m;
Smax=0;
for (i=1; i<=n; i++)
{s1=0;
s2=0;
for(j=1; j<=m; j++)
{f>>a[i][j];
s1=s1+a[i][j];
s2=s2+a[i][j]*-1;
}
if(s1>s2)
Smax+=s1;
else
{Smax+=s2;
for(j=1; j<=m; j++)
a[i][j]=a[i][j]*-1;
}
}
for(i=1; i<=n; i++)
{for(j=1; j<=m; j++)
cout<<a[i][j]<<" ";
cout<<endl;}
f.close();
for (i=1; i<= m; i++)
{s1=s2=0;
for(j=1; j<= n; j++)
{
s1+=a[j][i];
s2+=a[j][i]*-1;
}
if(s2>s1)
{Smax=Smax-s1+s2;
for(j=1; j<=n; j++)
a[j][i]*=-1;
}
}
ofstream f1("flip.out");
f1<<Smax;;
f1.close();
}