Pagini recente » Cod sursa (job #2904535) | Cod sursa (job #2535515) | Istoria paginii runda/just_4_me | Istoria paginii runda/einigeswanker/clasament | Cod sursa (job #2853627)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m;
int a[20][20];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
fin>>a[i][j];
}
}
int sum=0;
for(int i=1;i<=m;i++){
int sum1=0,sum2=0;
for(int j=1;j<=n;j++){
sum1+=(a[j][i]);
sum2+=(-1)*(a[j][i]);
}
if(sum2>sum1){
for(int j=1;j<=n;j++)a[j][i]=(-1)*(a[j][i]);
}
}
for(int i=1;i<=n;i++){
int sum1=0,sum2=0;
for(int j=1;j<=m;j++){
sum1+=(a[i][j]);
sum2+=(-1)*(a[i][j]);
}
if(sum2>sum1){
for(int j=1;j<=m;j++)a[i][j]=(-1)*a[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)sum+=a[i][j];
}
fout<<sum;
}