Cod sursa(job #2500819)

Utilizator lutusilviu ionut lutu Data 28 noiembrie 2019 18:59:57
Problema Jocul Flip Scor 40
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.32 kb
#include<iostream>
#include<fstream>
#include<cstring>
#include<math.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int v[35];
void permuta(int a[][16],int v[],int n,int m)
{
    for(int i=1;i<=n;i++)
    {
        if(v[i]==1)
        {
            for(int j=1;j<=m;j++)
            a[i][j]*=-1;
        }
    }
    for(int i=1;i<=m;i++)
    {
        if(v[i+n]==1)
        {
            for(int j=1;j<=n;j++)
            a[j][i]*=-1;
        }
    }
}
int suma(int a[][16],int n,int m)
{
    int s=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        s+=a[i][j];
    }
    return s;
}
void copiaza(int a[][16],int b[][16],int n,int m)
{
    for(int i=1;i<=n;i++)
    for(int j=1;j<=m;j++)
    a[i][j]=b[i][j];
}
int main()
{
    int n,m,max=0,s,q=1,i,j,b[16][16],a[16][16];
    f>>n>>m;
    for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
    {
        f>>a[i][j];
        b[i][j]=a[i][j];
    }

    while(q)
    {
        s=suma(a,n,m);
        if(s>max)
        max=s;
        q=0;
        copiaza(a,b,n,m);
    for(i=n+m;i>=1;i--)
    {
        if(v[i]==0)
        {
           v[i]=1;
           q=1;
           break;
        }
        else
        {
            v[i]=0;
        }
    }
    permuta(a,v,n,m);
    }
    g<<max;
}