Pagini recente » Cod sursa (job #566642) | Cod sursa (job #232857) | Monitorul de evaluare | Cod sursa (job #436235) | Cod sursa (job #149960)
Cod sursa(job #149960)
#include<fstream.h>
int main(void)
{ int mat[1000][16],pat[1000][16];
long N,M,i,j,suma=0,sumab=0,sumafa=0,sumafb=0;
ifstream in("flip.in");
in>>N>>M;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
in>>mat[i][j];
mat[i][j]=pat[i][j];
in.close();
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
{ if(j==M)
{for(j=1;j<=M;j++)
{suma=suma+mat[i][j];
mat[i][j]=mat[i][j]*-1;
sumab=sumab+mat[i][j];}
if(sumab<suma)
for(j=1;j<=M;j++)
mat[i][j]=mat[i][j]*-1;
suma=0;sumab=0;
}
}
suma=0;sumab=0;
for(j=1;j<=M;j++)
for(i=1;i<=N;i++)
{ if(i==N)
{for(i=1;i<=N;i++)
{suma=suma+mat[i][j];
mat[i][j]=mat[i][j]*-1;
sumab=sumab+mat[i][j];}
if(sumab<suma)
for(i=1;i<=N;i++)
mat[i][j]=mat[i][j]*-1;
suma=0;sumab=0;
}
}
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
sumafa=sumafa+mat[i][j];
suma=0;sumab=0;
for(j=1;j<=M;j++)
for(i=1;i<=N;i++)
{ if(i==N)
{for(i=1;i<=N;i++)
{suma=suma+pat[i][j];
pat[i][j]=pat[i][j]*-1;
sumab=sumab+pat[i][j];}
if(sumab<suma)
for(i=1;i<=N;i++)
pat[i][j]=pat[i][j]*-1;
suma=0;sumab=0;
}
}
suma=0;sumab=0;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
{ if(j==M)
{for(j=1;j<=M;j++)
{suma=suma+pat[i][j];
pat[i][j]=pat[i][j]*-1;
sumab=sumab+pat[i][j];}
if(sumab<suma)
for(j=1;j<=M;j++)
pat[i][j]=pat[i][j]*-1;
suma=0;sumab=0;
}
}
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
sumafb=sumafb+pat[i][j];
ofstream out("flip.out");
if(sumafa>sumafb)out<<sumafa;
else out<<sumafb;
out.close();
return 0;
}