-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSearchingAStringInAMartrix.c
More file actions
100 lines (76 loc) · 2.08 KB
/
SearchingAStringInAMartrix.c
File metadata and controls
100 lines (76 loc) · 2.08 KB
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
#include<stdio.h>
#include<string.h>
int main()
{
char a[100][100],b[100];
int i,j,m,n,l,flag=0;
scanf("%s",b);
printf("%s\n",b);
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
scanf("%c",&a[i][j]);
}
}
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
printf("%c",a[i][j]);
}
printf("\n");
}
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
if(a[i][j]==b[0])
{
l=1;
m=i+1;
n=j;
while(a[m][n]==b[l])
{
m++;
l++;
}
if(l==strlen(b))
{
flag=1;
printf("%d %d",i,j);
break;
}
l=1;
m=i;
n=j+1;
while(a[m][n]==b[l])
{
n++;
l++;
}
if(l==strlen(b))
{
flag=1;
printf("%d %d",i,j);
break;
}
l=1;
m=i+1;
n=j+1;
while(a[m][n]==b[l])
{
m++;
n++;
l++;
}
if(l==strlen(b))
{
flag=1;
printf("%d %d",i,j);
break;
}
}
}
}
}