Pagini recente » Cod sursa (job #2467465) | Cod sursa (job #1788795) | Cod sursa (job #2530557) | Cod sursa (job #2881900) | Cod sursa (job #2953118)
#include <bits/stdc++.h>
#define L 4000005
#define LIM 1000
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string a, b, s;
int z[L];
void Z(){
s = a + "#" + b;
z[0] = 0;
int r = 1, l = 0;
for (int i = 1; i < (int)s.size(); i++){
z[i] = min(r - i, z[i - l]);
while (i + z[i] < (int)s.size() && s[z[i]] == s[i + z[i]])
z[i]++;
if (i + z[i] >= r){
r = max(i + 1, i + z[i]);
l = i;
}
}
}
int main(){
fin >> a >> b;
Z();
int r = 0;
for (int i = a.size() + 1; i < (int)s.size(); i++)
r += (z[i] == (int)a.size());
fout << r << "\n";
int out = 0;
for (int i = a.size() + 1; i < (int)s.size() && out < LIM; i++)
if (z[i] == (int)a.size()){
fout << i - a.size() - 1 << " ";
out++;
}
fout << "\n";
return 0;
}