Cod sursa(job #2808916)
| Utilizator | Data | 25 noiembrie 2021 17:33:07 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string s,s1,s2;
int urm[2000005],k,i,nr;
vector <int> sol;
int main()
{
f>>s;
f>>s1;
s2=s+'#'+s1;
urm[0]=0;
k=0;
for (i=1;i<s2.size();i++)
{
while (k&&s2[i]!=s2[k])
{
k=urm[k-1];
}
if (s2[i]==s2[k])
{
k++;
}
urm[i]=k;
if (urm[i]==s.size())
{
nr++;
if (nr<=1000)
{
sol.push_back(i-2*s.size());
}
}
}
g<<nr<<'\n';
for (i=0;i<sol.size();i++)
{
g<<sol[i]<<" ";
}
return 0;
}
