Pagini recente » Cod sursa (job #2541154) | Cod sursa (job #239404) | Cod sursa (job #938592) | Cod sursa (job #3135620) | Cod sursa (job #1727807)
#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
const int BIG = 2000005;
char sir_total[100],sir_comparat[100],KMP[100];
int main() {
int n,m,k=1,cnt=0,j=1,index = 1;
int poz[100],z=0;
freopen("imp.in", "r", stdin);
freopen("imp.out", "w", stdout);
scanf("%s%s",sir_comparat+1,sir_total+1);
n = strlen(sir_total+1);
m = strlen(sir_comparat+1);
if(n < m){
printf("%d\n",0);
fclose(stdin);
fclose(stdout);
}
for(int i=1;i<=m;){
if(sir_comparat[i] == sir_comparat[index]){
KMP[i] = index;
index++;
i++;}
else{
if(index)
index = KMP[index-1];
else{
KMP[i] = 0;
i++;
}
}
}
while(k < n){
if(j == m-1){
poz[z] = k-j;
z++;
j=1;
}
// cout<<"sir_total["<<k<<"]= "<<sir_total[k]<<" ";
// cout<<"sir_comparat["<<j<<"]= "<<sir_comparat[j]<<'\n';
if(sir_total[k] == sir_comparat[j]){
k++;
j++;
}
else{
if(j>1)
j = KMP[j-1];
else
k++;
}
}
printf("%d\n",z-1);
z = min(z, 1000);
for(int i=1;i<z;i++)
printf("%d ",poz[i]);
return 0;
}