Shilenko3

#include <stdlib.h>
#include <stdio.h>

int max_column(int **x, int n, int j)
{
    int i, max = x[0][j];
    for (i = 0; i < n; i++)
        if (max < x[i][j])
            max = x[i][j];
    return max;
}

int min_column(int **x, int n, int j)
{
    int i, min = x[0][j];
    for (i = 0; i < n; i++)
        if (min > x[i][j])
            min = x[i][j];
    return min;
}

int main()
{
    int **x, n, m, i, j, k, t, max, min;

    printf("n = ");
    scanf("%d", &n);
    printf("m = ");
    scanf("%d", &m);

    x = (int **)malloc((n + 1)*sizeof(int *));
    for (i = 0; i < n + 1; i++)
        x[i] = (int*)malloc(m*sizeof(int));

    for (i = 0; i < n; i++)
        for (j = 0; j < m; j++)
        {
            printf("x[%d][%d] = ", i, j);
            scanf("%d", &x[i][j]);
        }

    max = x[0][0];
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < m; j++)
            printf("%d ", x[i][j]);
        printf("\n");
    }

    i = 0;
    for (i = 0; i < n; i++)
        for (j = 0; j < m; j++)
        {
            x[n][j] = max_column(x, n, j) - min_column(x, n, j);
        }

    printf("\n");
    for (i = 0; i < n + 1; i++)
    {
        for (j = 0; j < m; j++)
            printf("%d ", x[i][j]);
        printf("\n");
    }

    return 0;
}