Pagini recente » Cod sursa (job #1852415) | Cod sursa (job #2405894) | Cod sursa (job #2716152) | Cod sursa (job #3348066) | Cod sursa (job #3348953)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string a, b;
int n, m, pi[2000001];
int main()
{
fin>>a>>b;
n=a.size();
m=b.size();
for (int i=1; i<n; i++)
{
int j=pi[i-1];
while (j>0 and a[i]!=a[j])
{
j=pi[j-1];
}
if (a[i]==a[j])
{
j++;
}
pi[i]=j;
}
vector<int> rez;
int cnt=0, j=0;
for (int i=0; i<m; i++)
{
while (j>0 and b[i]!=a[j])
{
j=pi[j-1];
}
if (b[i]==a[j])
{
j++;
}
if (j==n)
{
cnt++;
if (rez.size()<1000)
{
rez.push_back(i-n+1);
}
j=pi[j-1];
}
}
fout<<cnt<<'\n';
for (auto u:rez)
{
fout<<u<<" ";
}
return 0;
}