-
Notifications
You must be signed in to change notification settings - Fork 1
/
Boolean_Matrix.c
60 lines (57 loc) · 1.25 KB
/
Boolean_Matrix.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <stdio.h>
struct node
{
int row;
int col;
};
void booleanMatrix(int r, int c, int matrix[r][c]){
int max_ele_possible = r*c;
struct node m[max_ele_possible];
int count = 0;
// int arr[max_ele_possible];
for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
if(matrix[i][j] == 1){
m[count].row = i;
m[count].col = j;
count++;
}
}
}
// The add 1 part
for (int i = 0; i < count; i++)
{
for (int j = 0; j < r; j++)
{
matrix[j][m[i].col] = 1;
}
for (int j = 0; j < c; j++)
{
matrix[m[i].row][j] = 1;
}
}
}
int main()
{
int r=3,c=4;
int matrix[r][c];
for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
scanf("%d",&matrix[i][j]);
}
}
booleanMatrix(r,c,matrix);
for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
printf("%d ",matrix[i][j]);
}
printf("\n");
}
return 0;
}