Pagini recente » Cod sursa (job #1253484) | Cod sursa (job #1710485) | Cod sursa (job #1559176) | Cod sursa (job #1337677) | Cod sursa (job #306674)
Cod sursa(job #306674)
#include <fstream>
using namespace std;
int main()
{
int m,n,a[20][20],i,j,sum,max,lim,s1,l,v;
ifstream f("flip.in");
ofstream g("flip.out");
max=0;
f>>m>>n;
for (i=0;i<m;i++)
for (j=0;j<n;j++) {
f>>a[i][j];
max+=a[i][j];
}
lim=(1<<n)-1; // cate o cifra binara pt. fiecare coloana
for (l=1;l<lim;l++) // tate variantele de a stinge/aprinde coloanele matricei
{
v=l;
sum=0;
for (i=0;i<m;i++)
{
s1=0;
for (j=0;j<n;j++)
if ((v>>j)%2==0)
s1=s1+a[i][j];
else
s1=s1-a[i][j];
if (s1<0)
sum=sum-s1;
else
sum=sum+s1;
}
if (sum>max)
max=sum;
}
g<<max;
f.close();
g.close();
return 0;
}