Pagini recente » Cod sursa (job #2251105) | Cod sursa (job #760193) | Cod sursa (job #141068) | Cod sursa (job #3247441) | Cod sursa (job #1322698)
#include <iostream>
#include <fstream>
using namespace std;
int a[1000000][16];
int main()
{
long long i,j,k,m,n,p,s,q;
s=0;
p=0;
q=0;
k=1;
ifstream fi;
ofstream fo;
fi.open("flip.in");
if(fi.is_open())
{
fi>>n;
fi>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fi>>a[i][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
while(k<=n)
{
s=s+a[k][j];
k++;
}
k=1;
if(s<0)
while(k<=n)
{
a[k][j]=-a[k][j];
k++;
s=0;
}
else s=0;
k=1;
}
for(j=1;j<=m;j++)
p=p+a[i][j];
if(p<0)
{for(j=1;j<=m;j++)
a[i][j]=-a[i][j];
p=0;}
else p=0;
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
q=q+a[i][j];
fo.open("flip.out");
if(fo.is_open())
fo<<q;
fo.close();
return 0;
}