Pagini recente » Cod sursa (job #1199794) | Cod sursa (job #3192850) | Cod sursa (job #1869783) | Cod sursa (job #1300000) | Cod sursa (job #975244)
Cod sursa(job #975244)
#include <fstream>
using namespace std;
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,a[20][20],i,j,smax=0,sum=0,linie=0,k;
f>>n>>m;
for( i = 1; i <= n; i++)
for( j = 1; j <= m; j++)
f >> a[i][j];
for( i = 0; i < (1 << m); i++)
{
sum = 0;
for( j = 1; j <= n; j++)
{
linie=0;
for ( k = 1; k <= m; k++)
{
if (i & (1 << k))
linie -= a[j][k];
else
linie += a[j][k];
}
if (linie < 0)
sum -= linie;
else
sum += linie;
}
smax = (smax < sum) ? sum : smax;
}
g<<smax;
f.close();
g.close();
return 0;
}