Pagini recente » Cod sursa (job #565993) | Cod sursa (job #2390608) | Cod sursa (job #2509215) | Cod sursa (job #1732310) | Cod sursa (job #1416221)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[100][100],v[100],n,m,k=0;
void citire()
{int i,j;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
}
int suma(int x[100][100])
{int i,j,s=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+x[i][j];
return s;
}
void joc()
{ int i,j;
for(j=1;j<=m;j++)
{for(i=1;i<=n;i++)
a[i][j]=-a[i][j];
v[++k]=suma(a);
}
}
int maxim(int x[100])
{ int i,m=0;
for(i=1;i<=k;i++)
if(x[i]>=m)
m=x[i];
}
int main()
{ int r;
citire();
joc();
r=maxim(v);
g<<r<<endl;
f.close();
g.close();
return 0;
}