Pagini recente » Cod sursa (job #1739919) | Cod sursa (job #2331058) | Istoria paginii utilizator/busioccostin | Cod sursa (job #994046) | Cod sursa (job #1603564)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
unsigned int n,m;
ifstream f("flip.in");
ofstream g("flip.out");
int i,j, a[256][256],s=0,nr,max=0,jmax=0;
f>>n; f>>m;
for(i=1;i<=n;i++)
{ nr=0;
for(j=1;j<=m;j++)
{ f>>a[i][j];
if(a[i][j]<0)
nr++;
}
if(max<nr)
{
max=nr;
jmax=j;
}
}
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
{
if(jmax==j)
s=(-1)*a[i][j]+s;
else s=s+a[i][j];
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+a[i][j];
g<<s<<endl;
f.close();
g.close();
return 0;
}