Pagini recente » Cod sursa (job #1848728) | Cod sursa (job #351357) | Cod sursa (job #553518) | Cod sursa (job #1867646) | Cod sursa (job #1627960)
#include <iostream>
#include <fstream>
using namespace std;
float a[17][17];
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,i,j,s1,s2;
f>>n>>m;
if(n>=1 && m>=1 && n<=16 && m<=16)
{for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
{
s1=0;
s2=0;
for(j=1;j<=n;j++)
{
s1=s1+a[i][j];
if(a[i][j]!=0)
s2=s2+a[i][j]*(-a[i][j])/a[i][j];
}
if(s2<s1)
for(j=1;j<=n;j++)
{
if(a[i][j]!=0)
a[i][j]=a[i][j]*(-a[i][j])/a[i][j];
}
}
for(i=1;i<=n;i++)
{
s1=0;
s2=0;
for(j=1;j<=n;j++)
{
s1=s1+a[j][i];
if(a[j][i]!=0)
s2=s2+a[j][i]*(-a[j][i])/a[j][i];
}
if(s2<s1)
for(j=1;j<=n;j++)
{
if(a[j][i]!=0)
a[j][i]=a[j][i]*(-a[j][i])/a[j][i];
}
}
s1=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
s1=s1+a[i][j];
}
g<<s1*(-s1)/s1;}
else
g<<0;
return 0;
}