Pagini recente » Cod sursa (job #615081) | Cod sursa (job #538175) | Cod sursa (job #3288619) | Cod sursa (job #1137082) | Cod sursa (job #567708)
Cod sursa(job #567708)
#include <iostream>
#include <fstream>
using namespace std;
int main ()
{
long long tb[18][18], sumpoz, sumneg, aux;
int m, n, i, j;
ifstream fi("flip.in");
ofstream fo("flip.out");
fi>>n>>m;
for(i=1;i<=n;i++)
{
sumpoz=sumneg=0;
for(j=1;j<=m;j++)
{
fi>>tb[i][j];
if(tb[i][j]>0) sumpoz+=tb[i][j];
if(tb[i][j]<0) sumneg+=tb[i][j];
if(j==m)
{
tb[0][j]=sumpoz;
tb[i+1][j]=sumneg;
}
}
}
/*
for(j=1;j<=m;j++)
{
sumpoz=sumneg=0;
for(i=1;i<=n;i++)
{
if(tb[i][j]>0) sumpoz+=tb[i][j];
if(tb[i][j]<0) sumneg+=tb[i][j];
if(i==n)
{
tb[i][0]=sumpoz;
tb[i][j+1]=sumneg;
}
}
}
*/
for(j=1;j<=m;j++)
{
if(tb[0][j]<0-tb[n+1][j])
{
aux=tb[0][j];
tb[0][j]=tb[n+1][j];
tb[n+1][]
}
}
fi.close();
fo.close();
return 0;
}