Pagini recente » Cod sursa (job #1413216) | Cod sursa (job #893355) | Cod sursa (job #2898298) | Cod sursa (job #2300296) | Cod sursa (job #926013)
Cod sursa(job #926013)
#include<stdlib.h>
#include<stdio.h>
int n,m,a[17][17],i,j;
long sum,maxi;
int suma(int i, int j)
{
long x = 0;
for(int k = 0; k < n; k++)
for(int l = 0; l < m; l++)
if(k == i || l == j)
x += -1*a[k][l];
else x += a[k][l];
return x;
}
int main()
{
FILE*in,*out;
in = fopen("flip.in","r");
out = fopen("flip.out","w");
fscanf(in,"%d",&n);
fscanf(in,"%d",&m);
for(i = 0; i < n; i++)
for(j = 0; j < m; j++)
fscanf(in,"%d",&a[i][j]);
for(i = 0; i < n; i++)
for(j = 0; j < m; j++)
if(suma(i,j)>=maxi)
maxi = suma(i,j);
fprintf(out,"%d",maxi);
fclose(in);
fclose(out);
return 0;
}