Pagini recente » Cod sursa (job #1304250) | Cod sursa (job #2839427) | Cod sursa (job #2753898) | Cod sursa (job #17600) | Cod sursa (job #974507)
Cod sursa(job #974507)
#include<fstream>
using namespace std;
int main()
{
int n,i,j,S=0,m,a[30][30],s1[30],s2[30],Sum[30],Sum2[30],max1,max2;
ifstream f("perechi.in", ios::in);
ofstream g("perechi.out", ios::out);
f>>n;
f>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
S=S+a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s1[i]=s1[i]+a[i][j];
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
s2[j]=s2[j]+a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
Sum[i]=S-2*s1[i];
max1=Sum[1];
for(i=1;i<=n;i++)
if(Sum[i]>max1)
max1=Sum[i];
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
Sum2[j]=S-2*s2[j];
max2=Sum2[1];
for(j=1;j<=m;j++)
if(Sum2[1]>max2)
max2=Sum2[j];
if(max1>max2)
g<<max1;
else
g<<max2;
f.close();
g.close();
return 0;}