Pagini recente » Cod sursa (job #400963) | Cod sursa (job #220360) | Cod sursa (job #2042895) | Cod sursa (job #1076013) | Cod sursa (job #1398033)
#include <iostream>
#include<fstream>
using namespace std;
int n,m,t[16][16],i,j,sum,gasit;
ifstream f;
ofstream g;
main()
{
f.open("flip.in");
g.open("flip.out");
f>>n>>m;
for (i=0;i<n;i++) for (j=0;j<m;j++) f>>t[i][j];
while (gasit==0)
{
gasit=1;
for (i=0;i<n;i++)
{
sum=0;
for (j=0;j<m;j++) sum+=t[i][j];
if (sum<0) {for (j=0;j<m;j++) t[i][j]=t[i][j]*(-1); gasit=0;}
}
for (j=0;j<m;j++)
{
sum=0;
for (i=0;i<n;i++) sum+=t[i][j];
if (sum<0) {for (i=0;i<n;i++) t[i][j]=t[i][j]*(-1); gasit=0;}
}
}
sum=0;
for (i=0;i<n;i++) for (j=0;j<m;j++) sum+=t[i][j];
g<<sum;
}