zadatak_3

void ispisi_niz(int niz[], int mixi) {
    for (int i = 0; i < mixi; i++)
    {
        printf("niz[%d] = %d \n", i, niz[i]);
    }
}
int ima_podniz_neparnih(int niz[], int n) {
    int temp = 0;
    for (int i = 0; i < n - 1; i++)
    {
        if (niz[i] % 2 == 1 && niz[i + 1] % 2 == 1) {
            temp = 1;
            break;
        }
    }
    return temp;
}
void ispisiMatricu(int M[][MAX], int n) {
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            printf("M[%d][%d] = %d\t", i, j, M[i][j]);
        }
        printf("\n");
    }
}
void obod_u_niz(int M[][MAX], int n, int niz[], int *n2) {
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (i == 0 || i == n - 1 || j == 0 || j == n - 1) {
                printf("%d\t", M[i][j]);
                niz[*n2] = M[i][j];
                (*n2)++;
            }
            else {
                printf("\t");
            }
        }
        printf("\n");
    }
    ispisi_niz(niz, *n2);
    ima_podniz_neparnih(niz, *n2) ? printf("DA") : printf("NE");

}
void zadatak_3() {
    int m[MAX][MAX] = { 1, 2, 3, 4,
                        5, 6, 7, 8,
                        9,10, 11,12,
                        13,14,15,17 };
    int n = 4, n2 = 0, niz[100];
    ispisiMatricu(m, n);
    obod_u_niz(m, n, niz, &n2);
}
int main(void) {
    zadatak_3();
    return 0;
}