-
Notifications
You must be signed in to change notification settings - Fork 0
/
binaryMatrix
93 lines (80 loc) · 1.62 KB
/
binaryMatrix
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include <stdio.h>
int n = 2;
void join(int a[][n], int b[][n]);
void meet(int a[][n], int b[][n]);
void product(int a[][n], int b[][n]);
int main(){
printf("Enter Size for Matrices : ");
scanf("%d",&n);
int A[n][n];
int B[n][n];
int i,j,sum;
printf("Enter elements of 1st matrix : \n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
scanf("%d",&A[i][j]);
}
printf("\n");
}
printf("Enter elements of 2nd matrix :\n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
scanf("%d",&B[i][j]);
}
printf("\n");
}
join(A , B);
meet(A, B);
product(A, B);
}
void join(int A[n][n], int B[n][n]){
int C[n][n];
int i, j , sum;
printf("join :\n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
sum =0;
sum=A[i][j]+B[i][j];
C[i][j] = sum;
if(sum>1){
C[i][j]=1;
}
printf("%d\t", C[i][j]);
}
printf("\n");
}
}
void meet(int A[n][n], int B[n][n]){
int C[n][n];
int i, j , sum;
printf("Meet :\n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(A[i][j]&&B[i][j]==1){
C[i][j]=1;
}
else
C[i][j]=0;
printf("%d\t", C[i][j]);
}
printf("\n");
}
}
void product(int A[n][n], int B[n][n]){
int c[n][n];
int i, j,k , sum;
printf("Boolean product :\n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
c[i][j] =0;
for(k = 0; k < n; k++){
c[i][j] += A[i][k] * B[k][j];
}
if(c[i][j]>1){
c[i][j]=1;
}
printf("%d\t", c[i][j]);
}
printf("\n");
}
}