Cod sursa(job #1193486)
Utilizator | Data | 31 mai 2014 21:20:57 | |
---|---|---|---|
Problema | Jocul Flip | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.52 kb |
#include <iostream>
#include <fstream>
short int N,M;
using namespace std;
int main()
{
long int i,j,n=0,s=0,k=0;
ifstream f("flip.in");
ofstream g("flip.out");
f>>N>>M;
long int T[N][M];
for (i=1;i<=N;i++)
{
for (j=1;j<=M;j++)
{
f>>T[i][j];
}
}
for (i=1;i<=N;i++)
{
for (j=1;j<=M;j++)
{
if (T[i][j]>=0)
{
n=n+T[i][j];
}
else
{
s=s+T[i][j]*-1;
}
}
if (s>n)
{
for (j=1;j<=M;j++)
{
T[i][j]*=-1;
}
}
n=0,s=0;
}
//Pass 1 end;
for (j=1;j<=M;j++)
{
for (i=1;i<=N;i++)
{
if (T[i][j]>=0)
{
n=n+T[i][j];
}
else
{
s=s+T[i][j]*-1;
}
}
if (s>n)
{
for (i=1;i<=N;i++)
{
T[i][j]*=-1;
}
}
n=0,s=0;
}
for (i=1;i<=N;i++)
{
for (j=1;j<=M;j++)
{
k=k+T[i][j];
}
}
g<<k;
f.close(),g.close();
return 0;
}