Segmentation Problem at 1024 size matrixes multiplication

[queer]

I am able to compute the matrix multiplication algorithm upto 512 input square matrices of random numbers. I get a segmentation error at 1024 size input square matrices.

for(i=1;i<=m;i++)
{
for(j=1;j<=q;j++)
{
C[i][j]=0;
for(k=1;k<=p;k++)
{
//printf("i %d k %d j %d",i,k,j);
//printf("Aik %d Bkj%d",A[i][k],B[k][j]);
float d = A[i][k]*B[k][j];
C[i][j] = C[i][j] +d; 
// printf("%d ",C[i][j]); 
}
printf("\n");
printf("%d ",C[i][j]);    
C[i][j]=0;
}
}

[weaknessforcats]

You need to post more code. Missing is the size of the array and the values of various variables like m, q and p.

[queer]

use dynamic memory allocation

[weaknessforcats]

You will get a segmentation error anytime you ry to access memory you have not allocated. It doesn't matter if you allocated it (dynamic) or the compiler allocated it (static).

[techboy]

You must take care when you multiply two integers your result is not exceeding 32 bit integer.instead try using long long int (64-bit integer)

[evena]

Your loops start at 1, C/C++ indexing starts at 0, so maybe you
should: (start at 0, use < instead of <=)

for(i = 0; i < m; i++)
for(j = 0; j < q; j++)
for(k = 0; k < p; k++)

etc.