Pagini recente » Cod sursa (job #782457) | Cod sursa (job #1996649) | Cod sursa (job #617627) | Cod sursa (job #361624) | Cod sursa (job #2114969)
#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char x[2000002],y[2000002];
int pi[2000002];
vector<int> nr;
int main()
{
f>>x+1;
f>>y+1;
int n=strlen(x+1);
int m=strlen(y+1);
int k=0;
for(int i=2;i<=n;i++)
{
while(k&&x[i]!=x[k+1])
k=pi[k];
if(x[k+1]==x[i])k++;
pi[i]=k;
}
k=0;
for(int i=1;i<=m&&nr.size()<1000;i++)
{
while(k && y[i]!=x[k+1])
k=pi[k];
if(y[i]==x[k+1])
k++;
if(k==n&&nr.size()<1000)
{
nr.push_back(i-n);
}
}
g<<nr.size()<<"\n";
for(int i=0;i<nr.size();i++)
g<<nr[i]<<" ";
return 0;
}