Cod sursa(job #3298241)
Utilizator | Data | 28 mai 2025 16:18:35 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
const int nmax=4e6+5;
int m, kmp[nmax], rez[1005];
string s, t;
int main()
{
fin >> s >> t;
int n=s.size();
s=s+"#"+t;
int k=0;
for (int i=1; i<s.size(); i++)
{
while (k!=0 && s[i]!=s[k])
k=kmp[k-1];
if (s[i]==s[k])
k++;
kmp[i]=k;
if (kmp[i]==n)
rez[++m]=i-2*n;
if (m==1001)
m=1000;
}
fout << m << '\n';
for (int i=1; i<=min(m,1000); i++)
fout << rez[i] << " ";
return 0;
}