Pagini recente » Monitorul de evaluare | Rating john bear (1o4n) | Cod sursa (job #1284876) | Cod sursa (job #1962579) | Cod sursa (job #2307844)
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fs first
#define sc second
int n,m,p[2000005],k,t,a[1005];
string S,s;
int main()
{
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
cin>>s;
cin>>S;
s=" "+s;
S=" "+S;
n=s.size();
m=S.size();
k=0;
for(int i=2;i<=n;i++)
{
while(k>0 && s[k+1]!=s[i]) k=p[k];
if(s[k+1]==s[i])k++;
p[i]=k;
}
k=0;
for(int i=1;i<=m;i++)
{
while(k>0 && s[k+1]!=S[i]) k=p[k];
if(s[k+1]==S[i])k++;
if(k==n-1) {
if(t<1000)
a[t]=i-n+1;
t++;}
}
cout<<t<<"\n";
t=min(t,1000);
for(int i=0;i<t;i++)
cout<<a[i]<<" ";
}