Pagini recente » Cod sursa (job #760869) | Cod sursa (job #2458041)
#include <fstream>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
using namespace std;
int ans, phi[405], sol[4000005];
string s1, s2, s;
int main() {
fin >> s1 >> s2;
s = s1 + "$" + s2;
phi[0] = -1;
for (int i = 1; i < s.size(); ++i) {
int x = i - 1;
while (s[phi[x] + 1] != s[i] && phi[x] > -1) {
x = phi[x];
}
if (s[phi[x] + 1] == s[i])
phi[i] = phi[x] + 1;
else phi[i] = -1;
if (phi[i] == s1.size() - 1 && i > s1.size()) {
++ans;
if (ans <= 1000)
sol[ans] = i - s1.size() - 1 - phi[i];
}
}
fout << ans << '\n';
for (int i = 1; i <= min(ans, 1000); ++i)
fout << sol[i] << ' ';
return 0;
}