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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <complex>
#include <iterator>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include "poszukiwania.h"
#include "message.h"
using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define MP make_pair
#define PF push_front
int numerek;
int wzlen,tlen;
//int tab[10000007];
int pref[22000007];
char zn;
long long ile=0;
int obecny;
int main()
{
	numerek=MyNodeId();
	if(numerek==0)
	{
		wzlen=SignalLength();
		tlen=SeqLength();
		/*
		FOR(i,1,wzlen)
		{
			tab[i]=SignalAt(i);
		}*/
		//tab[wzlen+1]=-1;
		pref[0]=-1;
		pref[1]=0;
		int t=0;
		FOR(i,2,wzlen)
		{
			obecny=SignalAt(i);
			while(t>=0 && SignalAt(t+1)!=obecny)
			{
				t=pref[t];
			}
			t++;
			pref[i]=t;
		}
		t=0;
		FOR(i,1,tlen)
		{
			obecny=SeqAt(i);
			if(t==wzlen)
			t=pref[t];
			
			while(t>=0 && SignalAt(t+1)!=obecny)
			{
				t=pref[t];
			}	
			t++;
			if(t==wzlen)
			ile++;
		}
		printf("%lld\n",ile);
	}
	//return 0;
}