Pagini recente » Monitorul de evaluare | Cod sursa (job #2766816) | Cod sursa (job #421028) | Cod sursa (job #926061) | Cod sursa (job #2838559)
#include <bits/stdc++.h>
#define ull unsigned long long
#define FILES freopen("strmatch.in","r",stdin);\
freopen("strmatch.out","w",stdout);
#define CMAX 1000000
#define fastio std::ios_base::sync_with_stdio(NULL),cin.tie(NULL),cout.tie(NULL);
#define mp make_pair
#define INF 999999999999999
#define mod 1000000007
#define ll long long
#define MAX 2000000
#define SMAX 500000
#define pb push_back
#define add emplace_back
#define void inline void
using namespace std;
char a[MAX+5],b[MAX+5];
int main()
{
fastio
FILES
int cnt = 0;
cin >> a >> b;
if(strlen(a) > strlen(b))
{
cout << 0;
exit(0);
}
int n = strlen(a),m = strlen(b);
deque<char> dq,dq2;
for(int i = 0;i < n; ++i) dq.push_back(b[i]),dq2.push_back(a[i]);
vector<int>pz;
for(int i = strlen(a);i < m; ++i)
{
if(dq2 == dq){
cnt++;
if(pz.size() < 1000)
pz.add(i-n);
}
dq.pop_front(),dq.push_back(b[i]);
}
if(dq == dq2) cnt++,pz.add(strlen(b)-strlen(a));
cout << cnt << '\n';
for(int i = 0;i < min(cnt,1000); ++i) cout << pz[i] << ' ';
}