Pagini recente » Cod sursa (job #3165014) | Cod sursa (job #2531594) | Cod sursa (job #3238786) | Cod sursa (job #2754662) | Cod sursa (job #2754647)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string a, b;
int pi[2000005], nr;
vector<int> ans;
int main() {
fin >> a >> b;
for(int i = 1; i < a.length(); i++) {
pi[i] = pi[i-1];
while(pi[i] > 0 && a[i] != a[pi[i]])
pi[i] = pi[pi[i]-1];
if(a[i] == a[pi[i]]) pi[i]++;
}
int q = 0;
for(int i = 1; i < b.length(); i++) {
while(q > 0 && b[i] != a[q])
q = pi[q-1];
if(b[i] == a[q]) q++;
if(q == a.length()) {
if(ans.size() < 1000) ans.push_back(i-q+1);
nr++;
}
}
fout << nr << '\n';
for(auto x : ans) fout << x << ' ';
}