Pagini recente » Cod sursa (job #2591079) | Cod sursa (job #683340) | Cod sursa (job #1782488) | Cod sursa (job #48261) | Cod sursa (job #1685638)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char A[2000001], B[2000001];
int l, i, j, ls, N;
int v[1001];
int pi[2000001];
int main()
{
fin>>A;
fin>>B;
l = strlen(A);
for(i = 1; i < l; i++)
{
while(j && A[j] != A[i])
{
j = pi[j - 1];
}
if(A[i] == A[j])
{
j++;
}
pi[i] = j;
}
ls = strlen(B);
j = 0;
for(i = 0; i < ls; i++)
{
while(j && A[j] != B[i])
{
j = pi[j - 1];
}
if(A[j] == B[i])
{
j++;
}
if(j == l)
{
if(N < 1000)
{
v[N] = i - j + 1;
N++;
}
else
{
break;
}
}
}
fout<<N<<'\n';
for(i = 0; i < N; i++)
{
fout<<v[i]<<" ";
}
return 0;
}