Pagini recente » Rezultatele filtrării | Cod sursa (job #1717251) | Cod sursa (job #209389) | Cod sursa (job #2036511) | Cod sursa (job #714116)
Cod sursa(job #714116)
#include<fstream>
using namespace std;
int main()
{int a[16][16], s1, s2, S=0, n, m, i, j;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n;
f>>m;
for(i=0; i<n; i++)
{s1=0;
s2=0;
for(j=0; j<m; j++)
{ f>>a[i][j];
s1+=a[i][j];
s2+=a[i][j]*(-1);}
if(s2>s1)
for(j=0; j<m; j++)
a[i][j]*=-1;
}
for(j=0; j<m; j++)
{s1=0;
s2=0;
for(i=0; i<n; i++)
{s1+=a[i][j];
s2+=a[i][j]*(-1);}
if(s2>s1)
{for(i=0; i<n; i++)
a[i][j]*=-1;
S=S+s2;}
else S=S+s1;
}
g<<S;
return 0;
}