Pagini recente » Cod sursa (job #286485) | Cod sursa (job #2797139) | Cod sursa (job #648285) | Cod sursa (job #1905170) | Cod sursa (job #1044911)
#include <fstream>
#include <cstring>
using namespace std;
char a[2000001],b[2000001];
int pi[2000001],pos[1001];
void citire(){
ifstream f("strmatch.in");
f>>a;
f.get();
f>>b;
f.close();
}
void prefix(){
int n=strlen(a)-1;
int q=-1;
pi[0]=-1;
for(int i=1;i<=n;i++){
while(q>=0&&a[q+1]!=a[i]){
q=pi[q];
}
if(a[q+1]==a[i]) q++;
pi[i]=q;
}
}
int subsiruri(){
int i,n=0,q=-1;
int ni=strlen(a)-1;
int m=strlen(b)-1;
prefix();
for(i=0;i<=m;i++){
while(q>=0&&a[q+1]!=b[i]){
q=pi[q];
}
if(a[q+1]==b[i])
q++;
if(q==ni){
q=pi[q];
n++;
if(n<=1000){
pos[n]=i-ni;
}
}
}
return n;
}
void afisare(int n){
ofstream g("strmatch.out");
g<<n<<"\n";
if(n>1000) n=1000;
for(int i=1;i<=n;i++){
g<<pos[i]<<" ";
}
g<<"\n";
}
int main()
{
citire();
int n=subsiruri();
afisare(n);
return 0;
}