Pagini recente » Cod sursa (job #3240315) | Cod sursa (job #3039702) | Cod sursa (job #1381367) | Cod sursa (job #376799) | Cod sursa (job #3038633)
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
const int NMAX = 2e6 + 1;
char s[NMAX],t[NMAX]; int pi[NMAX];
void kmp()
{
int n = strlen(s + 1),j = 0;
for(int i = 2; i <= n ; i++)
{
while(j && s[i] != s[j + 1]) j = pi[j];
if(s[i] == s[j + 1]) j++;
pi[i] = j;
}
}
int main() {
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
cin.getline(t + 1,NMAX);
cin.getline(s + 1,NMAX);
int j = 0,cnt = 0; int n = strlen(t + 1),m = strlen(s + 1);
kmp();
for(int i = 1; i <= n ; i++)
{
while(j && t[i] != s[j + 1]) j = pi[j];
if(t[i] == s[j + 1]) j++;
if(j == m)
{
cnt++;
j = pi[m];
}
}
cout << cnt;
return 0;
}