Flip the Boolean matrix

Given a Boolean matrix mat[M][N] of size M X N, modify it such that if a matrix cell mat[i][j] is 1 (or true) then make all the cells of ith row and jth column as 1.

Sample Input:

0 0 0 0
0 0 0 0
0 0 0 0
0 1 0 0

Sample Output:

0 1 0 0 
0 1 0 0 
0 1 0 0 
1 1 1 1

#include <stdio.h> #include <stdlib.h> #define M 4 #define N 4 void makeones(int *a[],int i,int j) { int row,col; for(row=i,col=0;col<N;col++) { *(*(a+row)+col)=1; } for(col=j,row=0;row<M;row++) { *(*(a+row)+col)=1; } } int main(void) { int *a[M]; int i,j,s=0,*row,*col; /* Array of pointers to 1-D array of size 1000 integers */ for(i=0;i<M;i++) *(a+i)=(int*)malloc(sizeof(int)*1000); /* pointer to a 1-D array which stores row indices */ row=(int*)malloc(sizeof(int)*1000); /* pointer to a 1-D array which stores column indices */ col=(int*)malloc(sizeof(int)*1000); /* get the input 2-D array from the user */ for(i=0;i<M;i++) { for(j=0;j<N;j++) { scanf("%d",(*(a+i)+j)); } } /* find the row index & column index of the 2-D array which has boolean '1' */ for(i=0;i<M;i++) { for(j=0;j<N;j++) { if(*(*(a+i)+j)==1) { row[s]=i; col[s]=j; s++; //makeones(a,i,j); } } } /* make the row & column of the 2-D array all 1's */ for(i=0;i<s;i++) { makeones(a,*(row+i),*(col+i)); } /* print the result array */ for(i=0;i<M;i++) { for(j=0;j<N;j++) { printf("%d ",*(*(a+i)+j)); } printf("\n"); } return 0; }