Pagini recente » Cod sursa (job #3135498) | Cod sursa (job #609665) | Cod sursa (job #2515341) | Cod sursa (job #1507023) | Cod sursa (job #2719859)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
vector <int> ans;
int ct = 0;
int prefix[2000005];
int main()
{
string A, B;
fin >> A >> B;
int j = 0;
for(int i = 1; i < A.size(); i++)
{
while(j != 0 && A[i] != A[j])
j = prefix[j - 1];
if(A[i] == A[j])
j++;
prefix[i] = j;
}
int poz = 0;
for(int i = 0; i < B.size(); i++)
{
if(B[i] == A[poz])
poz++;
else
poz = prefix[poz - 1];
if(poz == A.size())
{
ct++;
if(ans.size() < 1000)
ans.push_back(i - A.size() + 1);
poz = prefix[poz - 1];
}
}
fout << ct << '\n';
for(int i = 0; i < ans.size(); i++)
fout << ans[i] << " ";
return 0;
}