poredjenje 2 matrice-zavrseno

#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 20



void ucitaj(FILE *in, int a[MAX_SIZE][MAX_SIZE], int *n)
{
    int j, i, k;


        fscanf(in ,"%d", n);
    k = *n;

    for(i=0; i<k; i++){
        for(j=0; j<k; j++){
            fscanf(in, "%d", &a[i][j]);
            }
    }

}

void ispisi (int a[MAX_SIZE][MAX_SIZE], int n)
{
    int j, i;
    int k = n;

    for(i=0; i<k; i++){
        printf("\n");

        for(j=0; j<k; j++){

            printf("%d", a[i][j]);
            }
    }

}
int Poredjenje(int niz1[MAX_SIZE][MAX_SIZE], int niz2[MAX_SIZE][MAX_SIZE], int n1, int n2){

int j, i;


/*for(i=0; i<n1; i++){
printf("\n");

for(j=0; j<n1; j++){

printf("%d", niz1[i][j]);
}
}



for(i=0; i<n2; i++){
printf("\n");

for(j=0; j<n2; j++){

printf("%d", niz2[i][j]);
}
}
*/





    int j1, j2, i1, i2, k1, k2;
    int istina=0;
    int u;
    u = n1-n2+1;


    for(i1=0; i1<u; i1++){


        for(j1=0; j1<u; j1++){


               if(niz1[i1][j1] == niz2[0][0]){
                printf(" %d je jednako %d\n", niz1[i1][j1], niz2[0][0]);

                        for(k1=0;k1<n2;k1++){
                            for(k2=0; k2<n2; k2++){

                                if(niz1[i1+k1][j1+k2] == niz2[k1][k2])
                                    {
                                    printf(" %d je jednak %d\n", niz1[i1+k1][j1+k2] , niz2[k1][k2]);

                                    istina++;
                                    }
                                        }

                        }

                if(istina!=(n2*n2)){istina = 0; } else { return 1;} }






        }
    }

    printf("vrednost istine je:%d\n", istina);
return 0;

}

int main (int brArg, char *arg[]) {

int big[MAX_SIZE][MAX_SIZE], big_n;
int small[MAX_SIZE][MAX_SIZE], small_n;

FILE *in;
if((in = fopen(arg[1], "r"))==NULL) {printf("fajl se nije ucitao\n");}

ucitaj(in, big, &big_n);
ucitaj(in, small, &small_n);

puts("Big:"); ispisi(big, big_n); printf("\n");
puts("Small:"); ispisi(small, small_n); printf("\n");

//printf("ovo je nesto :%d", big[2][3]);

fclose(in);


    if( Poredjenje(big, small, big_n, small_n))
        {
            printf("matrica small ulazi u sastav matrice big\n");

        }else {printf("matrica nijieeeee\n");}



return 0;
}