Cod sursa(job #2838561)

Utilizator 100pCiornei Stefan 100p Data 24 ianuarie 2022 00:54:29
Problema Potrivirea sirurilor Scor 80
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.19 kb


#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 pz[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]);
    for(int i = strlen(a);i < m; ++i)
    {
        if(dq2 == dq){
            cnt++;
            if(cnt <= 1000) pz[cnt] = i - n;
        }
        dq.pop_front(),dq.push_back(b[i]);
    }
    if(dq == dq2){
        cnt++;
        if(cnt <= 1000) pz[cnt] = m - n;
    }
    cout << cnt << '\n';
    for(int i = 1;i <= min(cnt,1000); ++i) cout << pz[i] << ' ';

}