Pagini recente » Cod sursa (job #707044) | Cod sursa (job #3196585) | Cod sursa (job #1792147) | Cod sursa (job #263757) | Cod sursa (job #782968)
Cod sursa(job #782968)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long n,m,v[33],i,a[17][17],j,mi=-1,x,s=0,q=-1;
int main()
{f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
while(mi<0)
{for(i=1;i<=n;i++)
{v[i]=0;
for(j=1;j<=m;j++)
{v[i]=v[i]+a[i][j];}}
for(i=1;i<=m;i++)
{v[i+n]=0;
for(j=1;j<=n;j++)
{v[i+n]=v[i+n]+a[j][i];}}
mi=v[1];
x=1;
for(i=2;i<=m+n;i++)
{
if(v[i]<mi)
{mi=v[i];
x=i;}
}
if(mi<0)
{if(x<=n)
{
for(i=1;i<=m;i++)
a[x][i]=q*a[x][i];
}
else
{
for(i=1;i<=n;i++)
a[i][x-n]=q*a[i][x-n];
}
}
}
for(i=1;i<=n;i++)
s=s+v[i];
g<<s;
return 0;
}