Pagini recente » Cod sursa (job #988527) | Cod sursa (job #477358) | Cod sursa (job #2947315) | Cod sursa (job #1480275) | Cod sursa (job #3263627)
#include <bits/stdc++.h>
using namespace std;
#define INFILE "strmatch.in"
#define OUTFILE "strmatch.out"
vector<int> zFunction(string s){
int n = s.length();
vector<int> z(n);
int left = 0, right = 0;
for(int i = 1; i < n; ++i){
if(i < right) z[i] = min(right - i, z[i - left]);
while(i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
if(i + z[i] > right) left = i, right = i + z[i];
}
return z;
}
void solve(){
string pattern, s; cin >> pattern >> s;
int sz = pattern.size();
pattern += '#';
pattern += s;
vector<int> z = zFunction(pattern);
vector<int> ans;
for(int i = 0; i < z.size(); ++i){
if(z[i] == sz) ans.push_back(i - sz - 1);
}
cout << ans.size() << '\n';
for(int i = 0; i < min((int)ans.size(), 1000); ++i){
cout << ans[i] << " ";
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
freopen(INFILE, "r", stdin);
freopen(OUTFILE, "w", stdout);
solve();
return 0;
}