Pagini recente » Cod sursa (job #2180288) | Cod sursa (job #1886971) | Cod sursa (job #2963814) | Cod sursa (job #1994247) | Cod sursa (job #1006895)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long long lim;
int i,j,n,m,a[17][17],s[17],s1,s2,smax,k;
int modul(int a)
{
if (a<0) return -a;
return a;
}
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f>>a[i][j];
lim=1<<n;
for(i=1;i<lim;i++)
{
for(j=1;j<=n;j++)
if(i&(1<<(j-1))) s[j]=-1;
else s[j]=1;
s2=0;
for(k=1;k<=m;k++){s1=0;
for (j=1;j<=n;j++)
s1+=a[j][k]*s[j];
s2+=modul(s1);
}
if (s2>smax) smax=s2;
}
g<<smax;
return 0;
}