Pagini recente » Cod sursa (job #1830740) | Cod sursa (job #1066972) | Cod sursa (job #3325136) | Cod sursa (job #1833770) | Cod sursa (job #1400932)
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
#define nmax 17
int flip[nmax][nmax],n,m;
long long smax;
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
{
long long sum=0;
for(int j=1;j<=m;j++)
{
in>>flip[i][j];sum+=flip[i][j];
}
if(sum<0)
for(int j=1;j<=m;j++)
flip[i][j]*=-1;
}
for(int j=1;j<=m;j++)
{
long long sum=0;
for(int i=1;i<=n;i++)
sum+=flip[i][j];
if(sum<0)
{for(int i=1;i<=n;i++)
flip[i][j]*=-1;
sum*=-1;}
smax+=sum;
}
/*for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
out<<flip[i][j]<<" ";
out<<'\n';}*/
out<<smax;
return 0;
}