Pagini recente » Cod sursa (job #2944777) | Cod sursa (job #2507483) | Cod sursa (job #2943229) | Cod sursa (job #2096770) | Cod sursa (job #1456609)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
int a[999][17],min,N,M,i,j,s,s1,s2,c,l;
f>>N>>M;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
{
f>>a[i][j];
if(a[i][j]>0)
s=a[i][j];
}
min=s;
for(i=1;i<=N;i++)
{
s1=0;
for(j=1;j<=M;j++)
s1=s1+a[i][j];
if(s1<min)
{
min=s1;l=i;
}
}
min=s;
for(j=1;j<=M;j++)
{
s2=0;
for(i=1;i<=N;i++)
s2=s2+a[i][j];
if(s2<min)
{
min=s2;c=j;
}
}
s=0;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
{
if(i==l)
a[l][j]=a[l][j]*(-1);
if(j==c)
a[i][c]=a[i][c]*(-1);
s=s+a[i][j];
}
g<<s;
f.close();
g.close();
return 0;
}