Cod sursa(job #3163469)
| Utilizator | Data | 31 octombrie 2023 14:59:06 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
int pi[2000005], v[2000005], nr;
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[k]!=s[i])
k=pi[k-1];
if (s[k]==s[i])
k++;
pi[i]=k;
if (pi[i]==n)
v[++nr]=i-2*n;
}
fout << nr << '\n';
for (int i=1; i<=min(nr,1000); i++)
fout << v[i] << " ";
return 0;
}
