Pagini recente » Cod sursa (job #656788) | Cod sursa (job #1590658) | Cod sursa (job #2573088) | Cod sursa (job #2753193) | Cod sursa (job #606535)
Cod sursa(job #606535)
#include <iostream.h>
#include <fstream.h>
#define N 17
ifstream f("flip.in");
ofstream g("flip.out");
int T[N][N];
long S_LIN[N],S_COL[N];
int main()
{
int n,m,i,j,lin,col,min_lin,min_col,s=0;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>T[i][j];
for(i=1;i<=n;i++)
{
S_LIN[i]=0;
for(j=1;j<=m;j++)
S_LIN[i]+=T[i][j];
if(i==1)
min_lin=S_LIN[i];
else
if(S_LIN[i]<min_lin)
min_lin=S_LIN[i], lin=i;
}
for(i=1;i<=m;i++)
{
S_COL[i]=0;
for(j=1;j<=n;j++)
S_COL[i]+=T[j][i];
if(i==1)
min_col=S_COL[i];
else
if(S_COL[i]<min_col)
min_col=S_COL[i], col=i;
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(i==lin)
T[i][j]=T[i][j]*(-1);
if(j==col)
T[i][j]=T[i][j]*(-1);
s+=T[i][j];
}
g<<s;
f.close();
g.close();
return 0;
}