Envío 1168

Código

/* Code by Eduardo Vega */
#include <stdio.h>
#include <stdlib.h>

/* Free function for the allocated matrix */
void my_free(int **matrix, int size)
{
  int i, j;

  for (i = 0; i < size; i++)
      free(matrix[i]);
  
  free(matrix);   
} 

int main()
{ 
  int suma = 0, tmp = 0, size = 0, num = 0, 
  i, j;
  int **matrix = NULL;

  scanf("%d", &size);

  /* Matrix is allocated using double pointer */
  matrix = malloc(sizeof(int *) * size);
  for (i = 0; i < size; i++)  
      matrix[i] = malloc(sizeof(int) * size);

  /* Fill the matrix with the input numbers */
  for (i = 0; i < size; i++)
  {
    for (j = 0; j < size; j++)
    {
      scanf("%d", &num);
      matrix[i][j] = num; 
      
      /* Get the sum of the first row */ 
      if (i == 0)
          suma += num;
    }
  } 
  
  /* Check matrix horizontally and compare */
  for (i = 0; i < size; i++)
  {
    for (j = 0; j < size; j++)    
        tmp += matrix[i][j];

    if (tmp != suma)
    {
      printf("No\n");
      my_free(matrix, size);
      return 0;
    }
    tmp = 0;
  }
  
  /* Check matrix vertically and compare */
  for (j = 0; j < size; j++)
  {
    for (i = 0; i < size; i++)    
        tmp += matrix[i][j];

    if (tmp != suma)
    { 
      printf("No\n");
      my_free(matrix, size);
      return 0;
    } 
    tmp = 0;   
  }
  
  /* Check first diagonal and compare */  
  for (i = 0; i < size; i++)      
      tmp += matrix[i][i];    
   
  if (tmp != suma)
  { 
    printf("No\n");
    my_free(matrix, size);
    return 0;
  } 
  tmp = 0;

  /* Check last diagonal and compare */   
  for (i = 0; i < size; i++)  
      tmp += matrix[i][(size - 1) - i];    
  
  if (tmp != suma)
  { 
    printf("No\n");
    my_free(matrix, size);
    return 0;
  } 

  printf("Yes\n");
  my_free(matrix, size);
  return 0;
}