Pagini recente » Cod sursa (job #1135505) | Cod sursa (job #139215) | Cod sursa (job #2666701) | Cod sursa (job #3179310) | Cod sursa (job #307376)
Cod sursa(job #307376)
//flip
#include<fstream>
int n,a[16][16], i, j, k=1, max=0, s=0, m, q;
{
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>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
max+=a[i][j];
while(k<=n){ s=0;
for(i=1;i<=n;i++)
a[k][i]*=-1;
for(j=1;j<=n;j++)
for(q=1;q<=n;j++)
s=s+a[j][q];
if(max>s)
max=s;
else if(max<=s)
for(i=1;i<=n;i++)
a[k][i]*=-1;
k++;
}
k=1;
while(k<=m){ s=0;
for(i=1;i<=n;i++)
a[i][k]*=-1;
for(j=1;j<=n;j++)
for(q=1;q<=n;j++)
s=s+a[j][k];
if(max>s)
max=s;
else if (max<=s)
for(i=1;i<=n;i++)
a[i][k]*=-1;
k++;
}
out<<s;
return 0;
}