Pagini recente » Cod sursa (job #364923) | Cod sursa (job #1068726) | Cod sursa (job #924001) | Rating Popa Alexandru (PAlexandru) | Cod sursa (job #1201000)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n, m, sum = 0;
int a[17][17];
int x[17];
void Sum();
void det(int k);
int main()
{
f >> n >> m;
for ( int i = 1; i <= n; i++ )
for ( int j = 1; j <= m; j++)
f >> a[i][j];
det(1);
g << sum;
f.close();
g.close();
return 0;
}
void Sum()
{
int s = 0, s1 = 0;
for ( int i = 1; i <= m; i++ )
{
s = 0;
for ( int j = 1; j <= n; j++)
s += (a[j][i] * x[j]);
if( s < 0 )
s = s *(-1);
s1 += s;
}
if( sum < s1)
sum = s1;
}
void det(int k)
{
if( k == n+1 )
Sum();
else
for( int i = -1; i <= 1 ; i += 2 )
{
x[k] = i;
det(k + 1);
}
}