Pagini recente » Cod sursa (job #2422411) | Cod sursa (job #710483) | Cod sursa (job #1652013) | Cod sursa (job #364205) | Cod sursa (job #1448024)
#include <iostream>
#include <fstream>
using namespace std;
double sum_collumn(double a[16][16], int m, int j){
double suma = 0;
for (int i = 0; i < m; i++)
suma = suma + a[j][i];
return suma;
};
double sum_row(double a[16][16], int n, int j){
double suma = 0;
for (int i = 0; i < n; i++)
suma = suma + a[i][j];
return suma;
};
double reverse_sum_collumn(double a[16][16], int m, int j){
double suma = 0;
for (int i = 0; i < m; i++)
suma = suma + a[j][i]*(-1);
return suma;
};
double reverse_sum_row(double a[16][16], int n, int j){
double suma = 0;
for (int i = 0; i < n; i++)
suma = suma + a[i][j] * (-1);
return suma;
};
void main(){
int n, m;
double a[16][16];
ifstream ifile("flip.in");
ofstream ofile("flip.out");
ifile >> n >> m;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
ifile >> a[i][j];
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++)
cout << a[i][j] << " ";
cout << endl;
}
int gata = 1;
int aux = 0;
while (gata){
gata = 0;
for (int i = 0; i < m; i++){
if (sum_row(a, n, i) < reverse_sum_row(a, n, i)){
for (int q = 0; q < n; q++) a[q][i] = a[q][i] * (-1);
gata = 1;
}
}
for (int i = 0; i < n; i++){
if (sum_collumn(a, m, i) < reverse_sum_collumn(a, m, i)){
for (int q = 0; q < m; q++) a[i][q] *= (-1);
gata = 1;
}
}
}
double suma = 0;
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++)
suma += a[i][j];
}
ofile << suma;
//cout << n << endl << m << endl;
//outf << atoi(a) + atoi(b);
//cout.flush();
//intr.close();
//outf.close();
//cout << endl;
//system("pause");
}