-
Notifications
You must be signed in to change notification settings - Fork 2
/
NHAY (Spoj).cpp
81 lines (63 loc) · 1002 Bytes
/
NHAY (Spoj).cpp
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
#include<bits/stdc++.h>
#define speed ios_base::sync_with_stdio(false)
#define boost cin.tie(NULL)
#define booster cout.tie(NULL)
#define endl "\n"
typedef long long int lld;
#define F(a,n) for(int i=0;i<n;i++){cin>>a[i];}
#define F1(a,n) for(int i=1;i<=n;i++){cin>>a[i];}
using namespace std;
int table[10000]={0};
void CalculateTable(string p){
lld i=1;
lld j=0;
lld lp = p.length();
while(i<lp){
while(j>0 && p[i]!=p[j]){
j = table[j-1];
}
if(p[i] == p[j]){
table[i] = j+1;
i++;
j++;
}
else{
i++;
}
}
}
void KMP(string s,string p){
CalculateTable(p);
lld i=0,j=0;
lld ls = s.length();
lld lp = p.length();
while(i<ls){
while(j>0 && s[i] != p[j]){
j = table[j-1];
}
if(s[i] == p[j]){
i++;
j++;
}
else{
i++;
}
if(j == lp){
cout<<i-j<<endl;
j = table[j-1];
}
}
}
int main(){
speed;
boost;
lld n;
while(cin>>n){
string needle;
string hay;
cin>>needle;
cin>>hay;
KMP(hay,needle);
}
return 0;
}