Cod sursa(job #1340029)
| Utilizator | Data | 11 februarie 2015 14:18:55 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 14 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include<fstream>
#include<cstring>
using namespace std;
int i, L, p[2000003], n, m, sol;
char a[2000003], b[2000003];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main(){
in>>a+1;
n=strlen(a+1);
for(i=2; i<=n; i++){
while(L!=0 && a[i]!=a[L+1])
L=p[L];
if(a[i]==a[L+1])
L++;
p[i]=L;
}
in>>b;
m=strlen(b+1);
for(i=1; i<=m; i++){
while(L!=0 && b[i]!=a[L+1])
L=p[L];
if(b[i]==a[L+1])
L++;
if(L==n){
sol++;
L=p[L];
}
}
out<<sol;
}
