Pagini recente » Cod sursa (job #1472251) | Cod sursa (job #2210061) | Cod sursa (job #1672585) | Istoria paginii runda/pt_round13/clasament | Cod sursa (job #2547713)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int suma(int a[][17],int n,int m, int v[])
{
int sum=0,i,j,s;
for(j=1;j<=m;j++)
{
s=0;
for(i=1;i<=n;i++)
{
s=s+(a[i][j]*v[i]);
}
sum+=abs(s);
}
return sum;
}
int main()
{
int n,m,max=0;
fin>>n>>m;
int i,j;
int a[17][17];
for (i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
fin>>a[i][j];
}
}
int v[n+1];
int aux[n+1];
int k=1;
v[k]=-3;
while(k>0)
{
if (k<=n)
{
if (v[k]<0)
{
v[k]=v[k]+2;
if (k==m)
{
int cop=suma(a,n,m,v);
if (max < cop)
{
max=cop;
}
}
else
{
k++;
v[k]=-3;
}
}
else
{
k--;
}
}
}
fout<<max;
return 0;
}