Pagini recente » Cod sursa (job #2758438) | Rating CostenarGabriel (Costenar) | Monitorul de evaluare | Cod sursa (job #900970) | Cod sursa (job #1962169)
#include <bits/stdc++.h>
using namespace std;
long long a[17][17];
int n,m,i,j;
long long backmax(int x, int y){
long long sum=0;
for (long i=1;i<=n;i++)
for (long j=1;j<=m;j++)
if ((x==i)||(y==j)) sum-=a[i][j]; else{
sum+=a[i][j];}
return sum;
}
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++) f>>a[i][j];
long long maxim=-100000000000;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if (maxim <backmax(i,j)) maxim=backmax(i,j);
g<<maxim;
maxim=0;
f.close();
g.close();
return 0;
}