#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include "io_status.h"
#include "array.h"
#include "comparison.h"

int solve9(double*, int, int);

int main(int argc, char* argv[])
    {
    int task = 9;
    double* a;
    int n, m, p, k;
    char* name = 0;
    int res;
    double t;
    if (!((argc == 5 || argc == 6) && sscanf(argv[1], "%d", &m) == 1 && sscanf(argv[2], "%d", &n) == 1 && sscanf(argv[3], "%d", &p) == 1 && sscanf(argv[4], "%d", &k) == 1 && k >= 0 && k <= 4))
        {
        printf("Usage: %s m n p k [name]\n", argv[0]);
        return 1;
        }
    if (k == 0)
        name = argv[5];
    a = (double*) malloc(m * n * sizeof(double));
    if (!a)
        {
        printf("Not enough memory\n");
        return 2;
        }
    if (name)
        {
        io_status ret;
        ret = read_matrix(a, m, n, name);
        do
            {
            switch(ret)
                {
                case SUCCESS:
                    continue;
                case ERROR_OPEN:
                    printf("Can not open file %s\n", name);
                    break;
                case ERROR_READ:
                    printf("Can not read file %s\n", name);
                    break;
                }
            free(a);
            return 3;
            } while (0); 
        }
    else
        init_matrix(a, m, n, k);
    printf("Matrix:\n");
    print_matrix(a, m, n, p);
    t = clock();
    res = solve9(a, m, n);
    t = (clock() - t) / CLOCKS_PER_SEC;
    printf("New matrix:\n");
    print_matrix(a, m - 1, n - 1, p);
    printf ("%s : Task = %d Result = %d Elapsed = %.2f\n", argv[0], task, res, t);
    free(a);
    return 0;
    }
    
int solve9(double* a, int m, int n)
  {
  int i, j, k, ind_max_i = 0, ind_max_j = 0;
  double el, sumstl, sumstr, sum, max = 0;
  int l = 0;
  if ((m == 0) || (n == 0)) return 0;
  for (i = 0; i < m; i++)
      {
      sumstr = 0;
      for (j = 0; j < n; j++)
          {
          sumstl = 0;
          sumstr = 0;
          el = a[i * n + j];
          for (k = 0; k < n; k++)
              {
              if (k != j) sumstr += fabs(a[i * n + k] - el);
              }
          for (k = 0; k < m; k++)
              {
              if (k != i) sumstl += fabs(a[k * n + j] - el);
              }
          sum = sumstl + sumstr;
          if (sum > max)
              {
              max = sum;
              ind_max_i = i;
              ind_max_j = j;
              }
          }
      }
  for (i = 0; i < m; i++)
      {
      for (j = 0; j < n; j++)
          {
          if ((j != ind_max_j) && (i != ind_max_i))
              {
              a[l] = a[i * n + j];
              l++;
              }
          }
      }
  return ind_max_i * n + ind_max_j;
  }