Pagini recente » Cod sursa (job #783339) | Cod sursa (job #1752921) | Cod sursa (job #1559712) | Cod sursa (job #2618698) | Cod sursa (job #3253027)
#include <bits/stdc++.h>
using namespace std;
char s[2000005], w[2000005];
int n, m, ps[2000005], pw[2000005];
vector <int> v;
int main()
{
cin >> s;
cin >> w;
n = strlen(s), m = strlen(w);
for(int i = 1; i < n; i ++)
{
int j = i - 1;
while(j > 0 && s[i] != s[j])
j = ps[j];
if(s[i] == s[j])
j ++;
ps[i] = j;
}
int j = 0;
for(int i = 0; i < m; i ++)
{
while(j > 0 && s[j] != w[i])
j = ps[j];
if(s[j] == w[i])
j ++;
if(j == n)
{
j = ps[n - 1];
if(v.size() < 1000)
v.push_back(i - n + 1);
}
}
cout << v.size() << "\n";
for(int i = 0; i < v.size(); i ++)
cout << v[i] << " ";
return 0;
}