Cod sursa(job #1741744)
| Utilizator | Data | 14 august 2016 22:45:53 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 1.08 kb |
using namespace std;
#include<fstream>
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{
int n,m,a[20][20],ok=0,min=0,s1,s2,lmin,colmin,lc,i,j;
f>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
f>>a[i][j];
while (!ok)
{
ok=1;
min=0;
for(i=1; i<=n; i++)
{
s1=0; s2=0;
for(j=1; j<=m; j++)
{
s1+=a[i][j];
s2+=a[j][i];
}
if(s1<min)
{
min=s1;
lmin=i;
ok=0;
lc=1;
}
if(s2<min)
{
min=s2;
colmin=i;
ok=0;
lc=2;
}
}
if(!ok)
{
if(lc==1)
for(i=1; i<=m; i++) a[lmin][i]*=(-1);
else
for(i=1; i<=n; i++) a[i][colmin]*=(-1);
}
}
s1=0;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
s1+=a[i][j];
g<<s1;
return 0;
}
