Pagini recente » Cod sursa (job #2124519) | Cod sursa (job #2232711) | Cod sursa (job #2766706) | Cod sursa (job #350489) | Cod sursa (job #1161017)
#include <fstream>
#include <math.h>
using namespace std;
int a, A = 1, b = 1, n, m, k, K;
int main()
{
ifstream fin("flip.in");
fin >> n >> m;
int x[n][m];
for ( int i = 1; i <= n; i++ )
{
for ( int j = 1; j <= m; j++ )
{
fin >> x[i][j];
}
}
fin.close();
const int c = (int)pow(2,n) - 1;
const int d = (int)pow(2,m) - 1;
for ( int L = 0; L <= c; L++ )
{
for ( int l = 0; l <= d; l++ )
{
for ( int i = 1; i <= n; i++ )
{
for ( int j = 1; j <= m; j++ )
{
a = x[i][j];
if ( L / A % 2 == 1 )
{
a = -a;
}
if ( l / b % 2 == 1 )
{
a = -a;
}
K += a;
b *= 2;
}
A *= 2;
b = 1;
}
A = 1;
if ( K > k )
{
k = K;
}
K = 0;
}
}
ofstream fout("flip.out");
fout << k;
fout.close();
return 0;
}