#include<conio.h>
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<malloc.h>
int i, j, size, multip = 0;
int sum_e(int **Massiv)
{
    int maximal = 0,rmin=0,sum=0;
    maximal = Massiv[0][0];
    for (i = 0; i < size; i++)
    {
        for (j = 0; j < size; j++)
        {
            if (Massiv[i][j] > maximal)
            {
                maximal= Massiv[i][j];
            }
        }
    }
    for (i = 0; i < size; i++)
    {
            if (i % 2 == 0)
                sum += maximal;

    }
    return sum;
}
int sum_o(int **Massiv)
{
    int minimal = 0, rmin = 0, sum = 0;
    minimal = Massiv[0][0];
    for (i = 0; i < size; i++)
    {
        for (j = 0; j < size; j++)
        {
            if (Massiv[i][j] < minimal)
            {
                minimal = Massiv[i][j];
            }
        }
    }
    for (i = 0; i < size; i++)
    {
        for (j = 0; j < size; j++)
        {
            if (i % 2 == 1)
                sum += minimal;
        }
    }


    return sum;
}
int main()
{
    int **Massiv,e,o;
    printf("n Vvedite razmer massiva: ");
    scanf_s("%d", &size);
    Massiv = (int **)malloc(size * sizeof(int*));
    for (i = 0; i < size; i++)
    {
        Massiv[i] = (int*)malloc(size * sizeof(int));
    }
    for (i = 0; i < size; i++)
    {
        for (j = 0; j < size; j++)
        {
            printf("n Massiv[%d][%d]= : ", i, j);
            scanf_s("%d", &Massiv[i][j]);
        }
    }
    e = sum_e(Massiv);
    o = sum_o(Massiv);
    printf("n Sum of odd-numbered lines = %d", o);
    printf("n Sum of even-numbered lines = %d", e);
    for (i = 0; i < size; i++)
    {
        free(Massiv[i]);
    }
    free(Massiv);
    _getch();
    return 0;
}