Pagini recente » Cod sursa (job #1705145) | Monitorul de evaluare | Cod sursa (job #1962142) | Cod sursa (job #169525) | Cod sursa (job #1962133)
#include <bits/stdc++.h>
using namespace std;
int a[17][17];
int n,m,i,j;
int backmax(int x, int y){
int sum=0;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if ((x==i)&&(y==j)) sum-=a[i][j] ;else {
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;
cout<<n;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++) f>>a[i][j];
int maxim=0;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if (maxim <backmax(i,j)) maxim=backmax(i,j);
g<<maxim << endl;
return 0;
}