KPO lab №2

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

void printMatrix(int arr[6][6]) {
    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < 6; j++) {
            printf("%d\t", arr[i][j]);
        }
        printf("\n");
    }
    printf("\n");
}

void allocateMemory(int** array, int n) {
    if (array == NULL) {
        printf("Memory allocation failed!");
        return -1;
    }
    for (int i = 0; i < n; i++) {
        array[i] = (int*)malloc(n * sizeof(int));
        if (array[i] == NULL) {
            printf("Memory allocation failed!");
            return -1;
        }
    }
}

void fillArray(int** array, int n) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            array[i][j] = rand() % 201 - 100;
        }
    }
}

int findFirstMin(int** array, int n) {
    int min = array[0][1];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if ((((i + j < n - 1) && (i < j)) || ((i + j >= n) && (i > j))) && (array[i][j] < min)) {
                min = array[i][j];
            }
        }
    }
    return min;
}

int findSecMin(int** array, int n) {
    int min = array[0][1];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if ((i > j) && (i + j < n - 1) && (array[i][j] < min)) {
                min = array[i][j];
            }
        }
    }
    return min;
}

void printArray(int** array, int n) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            printf("%d\t", array[i][j]);
        }
        printf("\n");
    }
}

void freeMemory(int** array, int n) {
    for (int i = 0; i < n; i++) {
        free(array[i]);
    }
}

int main() {
    int n = 0;
    int** array;
    array = (int**)malloc(n * sizeof(int*));
    srand(time(NULL));
    printf("Input n:");
    scanf_s("%d", &n);
    allocateMemory(array, n);
    fillArray(array, n);
    printArray(array, n);
    int min = findFirstMin(array, n);
    printf("\nMin in  first task: \n");
    printf("%d\n", min);
    min = findSecMin(array, n);
    printf("\nMin in  second task: \n");
    printf("%d\n", min);
    freeMemory(array, n);
    return 0;
}