Pagini recente » Cod sursa (job #2567777) | Cod sursa (job #2862501) | Cod sursa (job #3238480) | Cod sursa (job #916506) | Cod sursa (job #1231183)
#include<fstream>
#include<cstring>
using namespace std;
int i, nrsol, L, k, sol[1007], n, m, p[2000007];
char a[2000007], b[2000007];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main(){
in>>a+1;
in>>b+1;
n=strlen(a+1);
m=strlen(b+1);
for(i=2; i<=n; i++){
while(a[i]!=a[L+1] && L!=0)
L=p[L];
if(a[i]==a[L+1])
L++;
p[i]=L;
}
L=0;
for(i=1; i<=m; i++){
while(b[i]!=a[L+1] && L!=0)
L=p[L];
if(b[i]==a[L+1])
L++;
if(L==n){
nrsol++;
if(nrsol<=1000){
sol[++k]=i-L;
}
}
}
out<<nrsol<<"\n";
for(i=1; i<=k; i++)
out<<sol[i]<<" ";
return 0;
}