Cod sursa(job #374365)

Utilizator tuddortudor ionut tuddor Data 16 decembrie 2009 20:58:22
Problema Jocul Flip Scor 10
Compilator c Status done
Runda Arhiva de probleme Marime 1.2 kb
#include <stdio.h>

FILE *fin, *fout;


int main () 
{
  long int k, l, s, n, m, i, j, max,  matrice[16][16], suma[16][16];
  fin = fopen("flip.in", "rt");
  fout = fopen ("flip.out", "wt");
  fscanf (fin,"%ld %ld", &n, &m);
  s=0;
  for(i=0; i<n; ++i)
  {
    for(j=0; j<m; ++j)
    {
      fscanf(fin, "%ld", &matrice[i][j]);
      s=s+matrice[i][j];
    }
  }
 
/* fprintf (fout, "%ld\n", s);
  for(i=0; i<n; ++i)
  {
    for(j=0; j<m; ++j)
    {
      fprintf(fout, "%ld ", matrice[i][j]);
    }
    fprintf(fout, "\n");
  }

   fprintf(fout,"******* 16.12.2009 ********\n");*/
  for (k=0; k<n; ++k)
  {
    for (l=0; l<m; ++l) 
     { 
       suma[k][l]=0;	
       for(i=0; i<n; ++i)
       {   
         for(j=0; j<m; ++j)
         {
           if (i!=k && j!=l)
             suma[k][l]= suma[k][l]+matrice[i][j];
           else
             suma[k][l]= suma[k][l]-matrice[i][j];
         }
       }
     }
  }

/*  for(i=0; i<n; ++i)
  {
    for(j=0; j<m; ++j)
    {
      fprintf(fout, "%ld ", suma[i][j]);
    }
    fprintf(fout, " \n");
  } */

 max= suma[0][0];
 for(i=0; i<n; ++i)
  {
    for(j=0; j<m; ++j)
    {
      if (suma[i][j]>max)
         max=suma[i][j];
    }
  } 
 fprintf(fout, "%ld", max);
 return 0;
}