Pagini recente » Cod sursa (job #2231373) | Cod sursa (job #438801) | Cod sursa (job #2323453) | Istoria paginii runda/oji-2005-ix | Cod sursa (job #1739120)
#include <iostream>
#include <fstream>
using namespace std;
int SumaElemente(int Matrice[][16], int n, int m);
void SumaLinieColoana(int Matrice[][16], int n, int m);
void InversareLinie(int Matrice[][16], int m,int i);
void InversareColoana(int Matrice[][16],int n,int j);
int main()
{
int N, M, i, j;
int a[16][16];
ifstream InFile;
InFile.open("flip.in");
InFile >> N;
InFile >> M;
for(i=0;i<N;i++){
for(j=0;j<M;j++){
InFile >> a[i][j];
}
}
InFile.close();
SumaLinieColoana(a,N,M);
for(i=0;i<N;i++){
for(j=0;j<M;j++){
cout << a[i][j]<< " ";
}
cout <<endl;
}
ofstream OutFile;
OutFile.open("flip.out");
OutFile << SumaElemente(a,N,M);
OutFile.close();
return 0;
}
int SumaElemente(int MatriceS[][16], int n, int m){
int Suma=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
Suma = Suma + MatriceS[i][j];
}
}
return Suma;
}
void SumaLinieColoana(int Matrice[][16], int n, int m){
int i,j;
int SumaLinie=0;
int SumaColoana=0;
for(i=0;i<n;i++){
SumaLinie=0;
for(j=0;j<m;j++){
SumaLinie = SumaLinie + Matrice[i][j];
}
if(SumaLinie < 0){
InversareLinie(Matrice,m,i);
SumaLinieColoana(Matrice,n,m);
}
}
for( i=0;i<m;i++){
SumaColoana =0;
for( j=0;j<n;j++){
SumaColoana =SumaColoana + Matrice[j][i];
cout <<SumaColoana<<endl;
}
if(SumaColoana < 0){
InversareColoana(Matrice,n,i);
SumaLinieColoana(Matrice,n,m);
}
}
}
void InversareLinie(int Matrice[][16],int m,int i){
for(int j=0;j<m;j++){
Matrice[i][j]= Matrice[i][j]* -1;
}
}
void InversareColoana(int Matrice[][16],int n,int j){
for(int i=0;i<n;i++){
cout << i<<endl;
Matrice[i][j]= Matrice[i][j]* -1;
}
}