Pagini recente » Cod sursa (job #561695) | Autentificare | Cod sursa (job #1007007) | Cod sursa (job #1309938) | Cod sursa (job #2023625)
#include <iostream>
#include <fstream>
using namespace std;
int a[50][17];
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
int i, j, s=0, n, m, ok=1;
f>>n;f>>m;
for (i=0; i<n; i++){
for (j=0; j<m; j++)
{f>>a[i][j];
a[i][m]+=a[i][j];
a[n][j]+=a[i][j];
}
}
while (ok)
{
ok=0;
for (i=0; i<m; i++)
if (a[i][m]<0)
{
for (int k=0; k<m; k++)
{
a[i][k]*=-1;
a[i][m]+=a[i][k];
}
ok=1;
}
for (j=0; j<n; j++)
if (a[n][j]<0)
{
for (int l=0; l<n; l++)
{
a[l][n]*=-1;
a[n][j]+=a[l][n];
}
ok=1;
}
for (i=0; i<=n; i++){
for (j=0; j<=m; j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
cout<<endl;
}
for (i=0; i<n; i++)
for (j=0; j<m; j++)
s+=a[i][j];
g<<s;
return 0;
}