Cod sursa(job #2318891)

Utilizator VladP02Popescu Vlad VladP02 Data 13 ianuarie 2019 17:46:08
Problema Jocul Flip Scor 20
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.32 kb
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int i,j,m,n,a[100][100],yay;
void afisare()
{int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
            {cout<<setw(3)<<a[i][j];}
        cout<<endl;
    }
}
int verificare1(int w[100][100], int linie)
{int i,suma1=0,suma2=0;
    for(i=1;i<=m;i++) suma1=suma1+w[linie][i];
    for(i=1;i<=m;i++) {w[linie][i]=w[linie][i]*(-1); suma2=suma2+w[linie][i];}
    if(suma2>suma1) return 1;
    else return 0;
}
int verificare2(int w[100][100], int coloana)
{int i,suma1=0,suma2=0;
    for(i=1;i<=n;i++) suma1=suma1+w[i][coloana];
    for(i=1;i<=n;i++) {w[i][coloana]=w[i][coloana]*(-1); suma2=suma2+w[i][coloana];}
    if(suma2>suma1) return 1;
    else return 0;
}
void comutator(int w[100][100])
{int p=1,o=1;
    for(p=1;p<=n;p++) if(verificare1(a,p)) {for(i=1;i<=m;i++) w[p][i]=w[p][i]*(-1); comutator;}
    for(o=1;o<=m;o++) if(verificare2(a,o)) {for(i=1;i<=n;i++) w[i][o]=w[i][o]*(-1); comutator;}
}


int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
            f>>a[i][j];
    }
    comutator(a);
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
           yay=yay+a[i][j];
    if(yay<0) yay=yay*(-1);
    g<<yay;
    return 0;
}