Pagini recente » Borderou de evaluare (job #1567417) | Clasament ichcposdi | Cod sursa (job #2614308) | Cod sursa (job #1975378) | Cod sursa (job #2547654)
#include <iostream>
#include <fstream>
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;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
sum=sum+(a[i][j]*v[i]*v[n+j]);
}
}
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+m+1];
int aux[n+m+1];
int k=1;
int N=n+m;
v[k]=-3;
while(k>0)
{
if (k<=N)
{
if (v[k]<0)
{
v[k]=v[k]+2;
if (k==N)
{
int cop=suma(a,n,m,v);
if (max < cop)
{
max=cop;
}
}
else
{
k++;
v[k]=-3;
}
}
else
{
k--;
}
}
}
fout<<max;
return 0;
}