Pagini recente » Cod sursa (job #294372) | Cod sursa (job #1185277) | Cod sursa (job #1706503) | Cod sursa (job #1712156) | Cod sursa (job #1784499)
#include <iostream>
#include <fstream>
using namespace std;
ifstream intrare("flip.in");
ofstream iesire("flip.out");
int n, m, a[18][18], liniep[17], coloanap[17], linien[17], coloanan[17], suma;
void citire(int &n, int &m, int a[18][18])
{
intrare>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
intrare>>a[i][j];
if(a[i][j]>=0)
{
liniep[i]+=a[i][j];
coloanap[j]+=a[i][j];
}
else
{
linien[i]-=a[i][j];
coloanan[j]-=a[i][j];
}
}
}
int main()
{
citire(n,m,a);
for(int i=1; i<=n; i++)
{
if(max(max(liniep[i],linien[i]),max(coloanap[i],coloanan[i]))==linien[i])
{
int aux;
aux=liniep[i];
liniep[i]=linien[i];
linien[i]=aux;
for(int j=1; i<=n; i++)
{
if(a[i][j]>0)
{
coloanap[i]-=a[i][j];
coloanan[i]+=a[i][j];
a[i][j]=0-a[i][j];
}
else
{
coloanan[i]-=a[i][j];
coloanap[i]+=a[i][j];
a[i][j]=0-a[i][j];
}
}
}
if(max(max(liniep[i],linien[i]),max(coloanap[i],coloanan[i]))==coloanan[i])
{
int aux;
aux=coloanap[i];
coloanap[i]=coloanan[i];
coloanan[i]=aux;
for(int j=1; i<=n; i++)
{
if(a[j][i]>0)
{
liniep[j]-=a[j][i];
linien[j]+=a[j][i];
a[j][i]=0-a[j][i];
}
else
{
linien[j]-=a[j][i];
liniep[j]+=a[j][i];
a[j][i]=0-a[j][i];
}
}
}
}
return 0;
}