Pagini recente » Cod sursa (job #1492986) | Cod sursa (job #394249) | Cod sursa (job #165942) | Cod sursa (job #964809) | Cod sursa (job #2177998)
#include <iostream>
#include <fstream>
using namespace std;
int a[17][17],m,n;
void citire()
{
ifstream f ("flip.in");
f>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
f>>a[i][j];
}
void solve()
{
int spl=0,snc=0,snl=0,spc=0;
int s=0;
for(int i=1; i<=max(n,m); i++)
{
for(int j=1; j<=max(n,m); j++)
{
spl+=a[i][j];
snl-=a[i][j];
spc+=a[j][i];
snc-=a[j][i];
}
if(spl<snl)
a[i][0]=-1;
else
a[i][0]=1;
if(snc>spc)
a[0][i]=-1;
else
a[0][i]=1;
spl=snc=snl=spc=0;
}
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
s+=a[0][j]*a[i][0]*a[i][j];
ofstream g("flip.out");
g<<s;
}
int main()
{
citire();
solve();
return 0;
}