Pagini recente » Cod sursa (job #2953383) | Cod sursa (job #2322011) | Cod sursa (job #1999696) | Cod sursa (job #275668) | Cod sursa (job #1135522)
#include<fstream>
#include<string>
using namespace std;
const int maxn = 2000005;
string s, t;
int a[maxn],x[maxn];
main(){
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
fin>>t>>s;
int k=0,n=0;
a[0]=0;
for(int i=1;i<t.size();i++){
while(k && t[k]!=t[i])k=a[k];
if(t[k]==t[i])k++;
a[i]=k;
}
k=0;
for(int i=0;i<s.size();i++){
while(k && t[k]!=s[i])k=a[k];
if(t[k]==s[i])k++;
if(k==t.size()){
k=a[t.size()-1];
n++;
if(n<1002)
x[n]=i-t.size()+1;
}
}
fout<<n<<"\n";
if(n>1000)n=1000;
for(int i=1;i<=n;i++)fout<<x[i]<<" ";
}