Mai intai trebuie sa te autentifici.
Cod sursa(job #2057462)
| Utilizator | Data | 4 noiembrie 2017 15:42:07 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 78 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include<fstream>
#include<iostream>
#include<vector>
#define DN 2000005
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string a,b;
int pr[DN],k,nr;
vector<int>r;
int main()
{
fin>>a>>b;
k=-1;
pr[0]=-1;
for(int i=1;i<a.size();i++)
{
while(k!=-1&&a[k+1]!=a[i])
k=pr[k];
if(a[k+1]==a[i])
k++;
pr[i]=k;
}
k=-1;
for(int i=1;i<b.size();i++)
{
while(k!=-1&&a[k+1]!=b[i])
k=pr[k];
if(a[k+1]==b[i])
k++;
if(k==a.size()-1)
{
nr++;
r.push_back(i-k);
}
}
fout<<nr<<'\n';
for(int i=0;i<min(nr,1000);i++)
fout<<r[i]<<' ';
}
