Pagini recente » Clasamentul arhivei ACM | Cod sursa (job #2348018) | Cod sursa (job #2252772) | Cod sursa (job #2701182) | Cod sursa (job #307137)
Cod sursa(job #307137)
#include <iostream.h>
#include <fstream.h>
int i,j,ma[100][100],ax[100][100],n,m,sum=0,sua=0, lin=1, col=1;
int ne(int nr)
{
nr*=-1;
return nr;
}
int flipl(int linie, int m)
{
for(i=1;i<=m;i++)
{ma[linie][i]=ax[linie][i];}
return 0;
}
int flipc(int coloana, int n)
{
for(i=1;i<=n;i++)
{ma[i][coloana]=ax[i][coloana];}
return 0;
}
void main()
{
ifstream in("flip.in");
ofstream out("flip.out");
in>>n;
in>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{in>>ma[i][j];
ax[i][j]=ne(ma[i][j]);}
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
{sum+=ma[i][j];
sua+=ax[i][j];}
if(sum<sua)
{
flipl(i,m);
}
sum=0;
sua=0;
}
for(i=1;i<=m;i++)
{for(j=1;j<=n;j++)
{sum+=ma[j][i];
sua+=ax[j][i];}
if(sum<sua)
{
flipc(i,n);
}
//out<<sum<<" "<<sua<<endl;
sum=0;
sua=0;
}
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
sum+=ma[i][j];}out<<sum;
}