Pagini recente » Cod sursa (job #669586) | Cod sursa (job #946903) | Borderou de evaluare (job #1937112) | Cod sursa (job #1580284) | Cod sursa (job #1161047)
#include <fstream>
#include <math.h>
using namespace std;
int c = 1, d = 1, a, A = 1, b = 1, n, m, i, j, k, K;
int main()
{
ifstream fin("flip.in");
fin >> n >> m;
int x[n][m];
for ( i = 1; i <= n; i++ )
{
for ( j = 1; j <= m; j++ )
{
fin >> x[i][j];
}
}
fin.close();
for ( i = 0; i <= n; i++ )
{
c = 2 * c;
}
c--;
for ( i = 0; i <= m; i++ )
{
d = 2 * d;
}
d--;
//int c = pow(2,n) - 1;
//int d = pow(2,m) - 1;
for ( int L = 0; L <= c; L++ )
{
for ( int l = 0; l <= d; l++ )
{
for ( i = 1; i <= n; i++ )
{
for ( 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;
}