Pagini recente » Cod sursa (job #1581052) | Cod sursa (job #1710845) | Cod sursa (job #2962352) | Cod sursa (job #2862653) | Cod sursa (job #1290059)
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
vector<int> Sol;
int pi[2000005];
char A[2000005],B[2000005];
void compute_pi(char A[],int n)
{
pi[1] = 0;
int k = 0;
for(int i = 1; i < n; i++)
{
while(k > 0 && A[k] != A[i])
k = pi[k+1];
if(A[i] == A[k])
k++;
pi[i+1] = k;
}
}
int main()
{
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
fgets(A, sizeof(A), stdin);
fgets(B, sizeof(B), stdin);
int n = strlen(A)-1;
int m = strlen(B)-1;
if(n > m)
{
printf("0");
return 0;
}
compute_pi(A,n);
int k = 0;
for(int i = 0; i < m; i++)
{
while(k > 0 && A[k] != B[i])
k = pi[k];
if(A[k] == B[i])
k++;
if(k == n)
{
Sol.push_back(i-n+1);
}
}
printf("%d\n",Sol.size());
int lim = Sol.size();
if(lim > 1000) lim = 1000;
for(int i = 0; i < lim; i++)
printf("%d ",Sol[i]);
}