Pagini recente » Cod sursa (job #3243999) | Cod sursa (job #1040514) | Cod sursa (job #2165905) | Diferente pentru problema/trilant intre reviziile 26 si 4 | Cod sursa (job #1462747)
#include <fstream>
using namespace std;
int main()
{
fstream f("flip.in",ios::in);
fstream g("flip.out",ios::out);
int a[100][100],n,m,i,j,sum,b[100][100],sum1;
f>>n>>m;
for (int i(0);i<n;i++)
for (int j(0);j<m;j++)
{
f>>a[i][j];
b[i][j]=a[i][j];
}
for (int i(0);i<n;i++)
for (int j(0);j<m;j++)
{
sum=sum+a[i][j];
if(sum<0)
{
for (int j(0);j<m;j++)
a[i][j]=a[i][j]*(-1);
sum=0;
}
else sum=0;
}
for (int j(0);j<m;j++)
for (int i(0);i<n;i++)
{
sum=sum+a[i][j];
if (sum<0)
{
for (int i(0);i<n;i++)
a[i][j]=a[i][j]*(-1);
sum=0;
}
else sum=0;
}
for (int i(0);i<n;i++)
for (int j(0);j<m;j++)
sum=sum+a[i][j];
for (int j(0);j<m;j++)
for (int i(0);i<n;i++)
{
sum1=sum1+b[i][j];
if (sum1<0)
{
for (int i(0);i<n;i++)
b[i][j]=b[i][j]*(-1);
sum1=0;
}
else sum1=0;
}
for (int i(0);i<n;i++)
for (int j(0);j<m;j++)
{
sum1=sum1+b[i][j];
if(sum1<0)
{
for (int j(0);j<m;j++)
b[i][j]=b[i][j]*(-1);
sum1=0;
}
else sum1=0;
}
for (int i(0);i<n;i++)
for (int j(0);j<m;j++)
sum1=sum1+b[i][j];
if (sum>sum1)
g<<sum;
else g<<sum1;
f.close();
g.close();
return 0;
}