Pagini recente » Cod sursa (job #131105) | Cod sursa (job #1514702) | Cod sursa (job #2943349) | Cod sursa (job #1057159) | Cod sursa (job #3039464)
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
string filename = "strmatch";
#ifdef LOCAL
ifstream fin("input.in");
ofstream fout("output.out");
#else
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");
#endif
const int NMAX = 4e6;
int kmp[NMAX + 1];
void Kmp(string s){
kmp[1] = 0;
for(int i = 2; i < (int)s.size() - 1; i++){
int l = kmp[i - 1];
while(l > 0 && s[i] != s[l + 1]){
l = kmp[l];
}
if(s[i] == s[l + 1]){
kmp[i] = l + 1;
}
}
}
signed main(){
string a, b;
fin >> a >> b;
b = "$" + a + "$" + b;
Kmp(b);
int ans = 0;
vector <int> Ans;
for(int i = 1; i < (int)b.size() - 1; i++){
if(kmp[i] == (int)a.size()){
ans++;
if((int)Ans.size() < 1000){
Ans.push_back(i - (int)a.size() - 1);
}
}
}
fout << ans << '\n';
for(int x : Ans){
fout << x - (int)a.size() << ' ';
}
fout << '\n';
return 0;
}