Pagini recente » Cod sursa (job #2557917) | Cod sursa (job #1870327) | Cod sursa (job #1052296) | Cod sursa (job #1452636) | Cod sursa (job #3159632)
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.first << ' ' << p.second << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define NMAX 2000005
const long double PI = acos(-1);
int pr[NMAX];
string a, b;
vector<int> ans;
int main(){
ios::sync_with_stdio(false);
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
cin >> a;
cin >> b;
a += '#';
// onions
int k = 0;
for (int i=1;i<a.size();i++){
while (k != 0 && a[k] != a[i])
k = pr[k];
if (a[k] == a[i])
k++;
pr[i+1] = k;
}
k = 0;
for (int i=0;i<b.size();i++) {
while (k && a[k] != b[i])
k = pr[k];
if (a[k] == b[i])
k++;
if (k == a.size() - 1) {
ans.push_back(i - a.size() + 2);
}
}
cout << ans.size() << '\n';
for (int i=0;i<min(1000, (int)ans.size());i++){
cout << ans[i] << ' ';
}
cout << '\n';
return 0;
}