Pagini recente » Cod sursa (job #1782913) | Cod sursa (job #2439178) | Cod sursa (job #18524) | Cod sursa (job #2254677) | Cod sursa (job #3274568)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n, m, i, j, lung[4000002];
vector<int> rasp;
string a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
fin >> a >> b;
m = a.size();
b = a + "@" + b;
n = b.size();
j = 0;
for(i = 1; i < n; i++) {
while(0 < j && b[j] != b[i]) j = lung[j - 1];
if(b[j] == b[i]) j++;
lung[i] = j;
if(lung[i] == m) rasp.push_back(i - m + 1 - (m + 1));
}
fout << rasp.size() << "\n";
int nrMax = min((int)rasp.size(), 1000);
for(i = 0; i < nrMax; i++) {
fout << rasp[i] << " ";
}
return 0;
}