Pagini recente » Cod sursa (job #2626953) | speed | Cod sursa (job #1456461) | Cod sursa (job #2677823) | Cod sursa (job #2970478)
#include <bits/stdc++.h>
//Soltan Cristian
#define fri(a, b) for (int i = (a); i < (b); ++i)
#define frj(a, b) for(int j = a; j < b; j++)
#define frk(a, b) for(int k = a; k < b; k++)
#define frm(a, b, i) for(int i = b; i >= a; i--)
#define ll long long
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define pb push_back
#define st first
#define nd second
#define sz(x) (int)x.size()
#define rall(x) x.rbegin(), x.rend()
#define ct(x) cout << x
#define cts(x) cout << x << ' '
#define ctn(x) cout << x << '\n'
#define Y cout << "YES" << '\n'
#define N cout << "NO" << '\n'
using namespace std;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using ml = map<ll, ll>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <typename T>void read(T n, vector<T> &a){fri(0, n){cin >> a[i];}}
template<typename T>void print(T n, T m, vector<vector<T>> &dp){fri(0, n){ct('\n');frj(0, m){ct(setw(5));cts(dp[i][j]);}}}
const int mxa = 100019;
string __fname = "strmatch"; ifstream in(__fname + ".in"); ofstream out(__fname + ".out");
#define cin in
#define cout out
void solve(){
string a, b;
cin >> a >> b;
string s = a + "#" + b;
int n = sz(a), m = sz(b);
vi pi(n + m + 1, 0);
for(int i = 1; i < n + m + 1; i++){
int j = pi[i - 1];
while( j > 0 && s[i] != s[j]){
j = pi[j - 1];
}
if(s[i] == s[j]){
j++;
}
pi[i] = j;
}
vi ans;
// fri(0, n + m + 1){
// cout << pi[i] << ' ';
// }
cout << '\n';
fri(n + 1, n + m + 1){
if(pi[i] == n){
// cout << i << '\n';
ans.pb(i - n - 1 - n + 1);
}
}
cout << sz(ans) << '\n';
if(sz(ans) > 1000){
fri(0, 1000){
cout << ans[i] << ' ';
}
}
else{
fri(0, sz(ans)){
cout << ans[i] << ' ';
}
}
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); ct(fixed); ct(setprecision(10));
// int t;
// cin >> t;
// while(t--)
solve();
return 0;
}