Pagini recente » Cod sursa (job #2546736) | Cod sursa (job #884587) | Cod sursa (job #2792347) | Cod sursa (job #370358) | Cod sursa (job #1642561)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in") ;
ofstream g("flip.out") ;
int n , m , a[20][20] , i , j , mi = 1000000 , s , l , k ;
int main()
{ f >> n >> m ;
for ( i = 1 ; i <= n ; i ++ )
for ( j = 1 ; j <= m ; j ++ )
f >> a[i][j] ;
mi = 1000000 ;
for ( i = 1 ; i <= n ; i ++ )
{
s = 0 ;
for( j = 1 ; j <= m ; j ++ )
s = s + a[i][j] ;
if ( s < mi )
{
mi = s ;
l = i ;
}
}
for ( j = 1 ; j <= m ; j ++ )
{
s = 0 ;
for ( i = 1 ; i <= n ; i ++ )
s = s + a[i][j] ;
if ( s < mi )
{
mi = s ;
k = j ;
}
}
for ( i = l ; i <= l ; i ++ )
for ( j = 1 ; j <= m ; j ++ )
a[i][j] = - a[i][j] ;
for ( j = k ; j <= k ; j ++ )
for ( i = 1 ; i <= n ; i ++ )
a[i][j] = - a[i][j] ;
s = 0 ;
for ( i = 1 ; i <= n ; i ++ )
for ( j = 1 ; j <= m ; j ++ )
s = s + a[i][j] ;
g << s ;
return 0;
}