Cod sursa(job #3163447)
| Utilizator | Data | 31 octombrie 2023 14:38:33 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
vector<int> pi,q;
int main()
{
string s1,s;
fin>>s1>>s;
s=s1+'?'+s;
pi.resize(s.size());
pi[0]=0;
int k=0,i;
for(i=1;i<s.size();i++)
{
while(k && s[k]!=s[i])
k=pi[k-1];
if(s[k]==s[i])
k++;
pi[i]=k;
if(pi[i]==s1.size())
{
q.push_back(i-2*s1.size());
}
}
fout<<q.size()<<'\n';
for(auto x:q)
fout<<x<<" ";
return 0;
}
