-
Notifications
You must be signed in to change notification settings - Fork 0
/
2d.c
121 lines (118 loc) · 1.72 KB
/
2d.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
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include<stdio.h>
#include<stdlib.h>
int lowertriangle(int a[10][10], int n)
{
int flag=0,i,j;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i<=j)
{
if(a[i][j]!=0)
{
flag=1;
return 0;
}
}
}
}
if (flag==0)
{
return 1;
}
}
int uppertriangle(int a[10][10], int n)
{
int flag=0,i,j;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i>j)
{
if(a[i][j]!=0)
{
flag=1;
return 0;
}
}
}
}
if (flag==0)
{
return 1;
}
}
int diagonal(int a[10][10], int n)
{
int flag=0,i,j;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i>j||i<j)
{
if(a[i][j]!=0)
{
flag=1;
return 0;
}
}
}
}
if (flag==0)
{
return 1;
}
}
void main()
{
int a[10][10],i,n,choice,j;
printf("\nEnter the side of square matrix\t");
scanf("%d",&n);
printf("\nEnter the matrix\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("\n\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
printf("\n\n1.Check for lower triangle\n2.Check for upper triangle\n3.Check for diagonal\n4.Exit");
printf("\nenter the choice\t");
scanf("%d",&choice);
while(1)
{
switch(choice)
{
case 1 : if(lowertriangle(a,n)==1)
printf("the matrix is lower triangle");
else
printf("the matrix is not lower triangle");
break;
case 2 : if(uppertriangle(a,n)==1)
printf("the matrix is upper triangle");
else
printf("the matrix is not upper triangle");
break;
case 3 : if(diagonal(a,n)==1)
printf("the matrix is daigonal matrix");
else
printf("the matrix is not diagonal matrix");
break;
case 4 :exit(0);
}
printf("\nenter the choice\t");
scanf("%d",&choice);
}
}