Pagini recente » Cod sursa (job #1642944) | Cod sursa (job #2005663) | Cod sursa (job #1905095) | Cod sursa (job #1431085) | Cod sursa (job #2020557)
#include<iostream>;
#include<fstream>;
using namespace std;
int main()
{
int n,m,i,j,k,k1,S,P,S1,a[17][17];
ifstream f("flip.in");
ofstream g("flip.out");
f>>n;
f>>m;
for (i=1;i<n+1;i++)
for (j=1;j<m+1;j++)
f>>a[i][j];
k1=0;
do
{
k1=k1+1;
k=0;
do
{
k=k+1;
S=0;
for (i=1;i<n+1;i++)
S=S+a[i][k];
if(S<0) for(i=1;i<n+1;i++)
a[i][k]=a[i][k]*(-1);
for (i=1;i<n+1;i++)
{
P=0;
for (j=1;j<m+1;j++)
P=P+a[i][j];
if(P<0) for(j=1;j<m+1;j++)
a[i][j]=a[i][j]*(-1);
}
}while(k<m);
S1=0;
for (i=1;i<n+1;i++)
for (j=1;j<m+1;j++)
S1=S1+a[i][j];
}while(k1!=n);
g<<S1;
f.close();
g.close();
return 0;
}