Cod sursa(job #1438519)
| Utilizator | Data | 20 mai 2015 07:57:11 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include<fstream>
#include<cstring>
using namespace std;
int n, m, i, L, p[2000003], nrsol, sol[1003];
char a[2000003], b[2000003];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main(){
in>>a+1;
n=strlen(a+1);
for(i=1; i<=n; i++){
while(a[i]!=a[L+1])
L=p[L];
if(a[i]==a[L+1])
L++;
p[i]=L;
}
in>>b+1;
m=strlen(b+1);
for(i=1; i<=m; i++){
while(b[i]!=a[L+1])
L=p[L];
if(b[i]==a[L+1])
L++;
if(L==n){
nrsol++;
if(nrsol<=1000)
sol[nrsol]=L;
}
}
return 0;
}
